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.r114-smll-177955740600500.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 ErlangenMainframeV0-PT-1105, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740600500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 60M
-rw-r--r-- 1 mcc users 8.0K Mar 7 04:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Mar 7 04:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 04:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 04:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 09:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 04:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Mar 7 04:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Mar 7 04:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 7 04:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 59M Mar 3 18:30 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 ErlangenMainframeV0-PT-1105-LTLFireability-00
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLFireability-01
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLFireability-02
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLFireability-03
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLFireability-04
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLFireability-05
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLFireability-06
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLFireability-07
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLFireability-08
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLFireability-09
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLFireability-10
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLFireability-11
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLFireability-12
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLFireability-13
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLFireability-14
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779913680398

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-1105
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 20:28:02] [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-27 20:28:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 20:28:05] [INFO ] Load time of PNML (sax parser for PT used): 3216 ms
[2026-05-27 20:28:06] [INFO ] Transformed 287 places.
[2026-05-27 20:28:06] [INFO ] Transformed 46948 transitions.
[2026-05-27 20:28:06] [INFO ] Found NUPN structural information;
[2026-05-27 20:28:06] [INFO ] Parsed PT model containing 287 places and 46948 transitions and 1182750 arcs in 3821 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ErlangenMainframeV0-PT-1105-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1105-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 46948/46948 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 216 transition count 46877
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 216 transition count 46877
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 182 place count 176 transition count 46837
Iterating global reduction 0 with 40 rules applied. Total rules applied 222 place count 176 transition count 46837
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 225 place count 173 transition count 46834
Iterating global reduction 0 with 3 rules applied. Total rules applied 228 place count 173 transition count 46834
Applied a total of 228 rules in 1647 ms. Remains 173 /287 variables (removed 114) and now considering 46834/46948 (removed 114) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1677834787365116550.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4491676482352981839.kers'
[2026-05-27 20:28:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1677834787365116550.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4491676482352981839.kers]
Culled 0 columns in 349 ms.
// Phase 1: matrix 46834 rows 173 cols 1182522 entries
Finished phase 1 with 142 SingleSign rule and 3 generalized
[2026-05-27 20:28:11] [INFO ] Computed 28 invariants in 1211 ms
Computed 28 P flows in 1214 ms.
Exported basis to /tmp/petrispot-output-4491676482352981839.kers
Total runtime 1461 ms.
[2026-05-27 20:28:11] [INFO ] Implicit Places using invariants in 2689 ms returned []
Implicit Place search using SMT only with invariants took 2743 ms to find 0 implicit places.
Running 46833 sub problems to find dead transitions.
[2026-05-27 20:28:12] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 46833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 172/47007 variables, and 11 constraints, problems are : Problem set: 0 solved, 46833 unsolved in 31568 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/173 constraints, PredecessorRefiner: 46833/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 46833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 172/47007 variables, and 11 constraints, problems are : Problem set: 0 solved, 46833 unsolved in 30924 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/173 constraints, PredecessorRefiner: 46709/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 260830ms problems are : Problem set: 0 solved, 46833 unsolved
Search for dead transitions found 0 dead transitions in 261345ms
Starting structural reductions in LTL mode, iteration 1 : 173/287 places, 46834/46948 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266207 ms. Remains : 173/287 places, 46834/46948 transitions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 46834/46834 transitions.
Applied a total of 0 rules in 253 ms. Remains 173 /173 variables (removed 0) and now considering 46834/46834 (removed 0) transitions.
[2026-05-27 20:32:33] [INFO ] Invariant cache hit.
[2026-05-27 20:32:33] [INFO ] Implicit Places using invariants in 271 ms returned []
Implicit Place search using SMT only with invariants took 274 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 536 ms. Remains : 173/173 places, 46834/46834 transitions.
Support contains 58 out of 173 places after structural reductions.
[2026-05-27 20:32:41] [INFO ] Flatten gal took : 6740 ms
[2026-05-27 20:32:49] [INFO ] Flatten gal took : 7129 ms
[2026-05-27 20:32:59] [INFO ] Input system was already deterministic with 46834 transitions.
RANDOM walk for 40000 steps (8 resets) in 29225 ms. (1 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 147 ms. (27 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 132 ms. (30 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 101 ms. (39 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 88 ms. (44 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 108 ms. (36 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 118 ms. (33 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 116 ms. (34 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 120 ms. (33 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 118 ms. (33 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 120 ms. (33 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 114 ms. (34 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 118 ms. (33 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 397 ms. (10 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 109 ms. (36 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 41/41 properties
Interrupted probabilistic random walk after 68150 steps, run timeout after 30001 ms. (steps per millisecond=2 ) properties seen :0 out of 41
Probabilistic random walk after 68150 steps, saw 45860 distinct states, run finished after 30016 ms. (steps per millisecond=2 ) properties seen :0
[2026-05-27 20:33:41] [INFO ] Invariant cache hit.
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 39 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 2 (OVERLAPS) 78/136 variables, 13/24 constraints. Problems are: Problem set: 3 solved, 38 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/47007 variables, and 24 constraints, problems are : Problem set: 3 solved, 38 unsolved in 5675 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/173 constraints, PredecessorRefiner: 39/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 11/11 constraints. Problems are: Problem set: 3 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 78/136 variables, 13/24 constraints. Problems are: Problem set: 3 solved, 38 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/47007 variables, and 24 constraints, problems are : Problem set: 3 solved, 38 unsolved in 5063 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/173 constraints, PredecessorRefiner: 38/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11492ms problems are : Problem set: 3 solved, 38 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 58 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 46834/46834 transitions.
Graph (trivial) has 84 edges and 173 vertex of which 4 / 173 are part of one of the 2 SCC in 20 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 171 transition count 46817
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 158 transition count 46817
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 27 place count 158 transition count 46798
Deduced a syphon composed of 19 places in 53 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 65 place count 139 transition count 46798
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 137 transition count 46781
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 137 transition count 46781
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 137 transition count 46779
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 17 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 137 place count 104 transition count 46746
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 22 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 102 transition count 46763
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 146 place count 102 transition count 46758
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 153 place count 97 transition count 46756
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 155 place count 97 transition count 46756
Partial Post-agglomeration rule applied 11 times.
Drop transitions (Partial Post agglomeration) removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 166 place count 97 transition count 46756
Applied a total of 166 rules in 10315 ms. Remains 97 /173 variables (removed 76) and now considering 46756/46834 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10317 ms. Remains : 97/173 places, 46756/46834 transitions.
RANDOM walk for 40000 steps (8 resets) in 43138 ms. (0 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 571 ms. (7 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 621 ms. (6 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 556 ms. (7 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 549 ms. (7 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 499 ms. (8 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 476 ms. (8 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 516 ms. (7 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 454 ms. (8 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 500 ms. (7 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 360 ms. (11 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 542 ms. (7 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 460 ms. (8 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 630 ms. (6 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 520 ms. (7 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 463 ms. (8 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 541 ms. (7 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 560 ms. (7 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 547 ms. (7 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 514 ms. (7 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 496 ms. (8 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 534 ms. (7 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 455 ms. (8 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 444 ms. (8 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 532 ms. (7 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 437 ms. (9 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 564 ms. (7 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 558 ms. (7 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 469 ms. (8 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 486 ms. (8 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 417 ms. (9 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 452 ms. (8 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 511 ms. (7 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 463 ms. (8 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 420 ms. (9 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 490 ms. (8 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 491 ms. (8 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 484 ms. (8 steps per ms) remains 37/37 properties
Interrupted probabilistic random walk after 167523 steps, run timeout after 48002 ms. (steps per millisecond=3 ) properties seen :0 out of 37
Probabilistic random walk after 167523 steps, saw 25749 distinct states, run finished after 48002 ms. (steps per millisecond=3 ) properties seen :0
[2026-05-27 20:35:08] [INFO ] Flow matrix only has 46738 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16591914817537111626.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-321974855381837455.kers'
[2026-05-27 20:35:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16591914817537111626.kers, --Pflows, --basisKERS=/tmp/petrispot-output-321974855381837455.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 275 ms.
// Phase 1: matrix 46738 rows 96 cols 1182262 entries
Finished phase 1 with 66 SingleSign rule and 3 generalized
[2026-05-27 20:35:09] [INFO ] Computed 28 invariants in 996 ms
Computed 28 P flows in 997 ms.
Exported basis to /tmp/petrispot-output-321974855381837455.kers
Total runtime 1147 ms.
[2026-05-27 20:35:10] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 6/64 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 7/71 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 26/97 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 46835/46835 variables, and 125 constraints, problems are : Problem set: 0 solved, 37 unsolved in 45014 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 97/97 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 37/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 6/64 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 7/71 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 26/97 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 37 unsolved
SMT process timed out in 92073ms, After SMT, problems are : Problem set: 0 solved, 37 unsolved
Fused 37 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 58 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 46756/46756 transitions.
Applied a total of 0 rules in 1142 ms. Remains 97 /97 variables (removed 0) and now considering 46756/46756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1142 ms. Remains : 97/97 places, 46756/46756 transitions.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
Computed a total of 23 stabilizing places and 23 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&(X(p2)||p1))))))'
Support contains 37 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 46834/46834 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 168 transition count 33330
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 168 transition count 33330
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 167 transition count 22962
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 167 transition count 22962
Applied a total of 12 rules in 3309 ms. Remains 167 /173 variables (removed 6) and now considering 22962/46834 (removed 23872) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13374752841823492357.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7786462412661116912.kers'
[2026-05-27 20:36:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13374752841823492357.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7786462412661116912.kers]
Culled 0 columns in 98 ms.
// Phase 1: matrix 22962 rows 167 cols 588858 entries
Finished phase 1 with 137 SingleSign rule and 2 generalized
[2026-05-27 20:36:46] [INFO ] Computed 28 invariants in 384 ms
Computed 28 P flows in 384 ms.
Exported basis to /tmp/petrispot-output-7786462412661116912.kers
Total runtime 478 ms.
[2026-05-27 20:36:50] [INFO ] Implicit Places using invariants in 4130 ms returned []
Implicit Place search using SMT only with invariants took 4132 ms to find 0 implicit places.
Running 22961 sub problems to find dead transitions.
[2026-05-27 20:36:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 22961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 166/23129 variables, and 11 constraints, problems are : Problem set: 0 solved, 22961 unsolved in 30556 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/167 constraints, PredecessorRefiner: 22961/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 22961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 166/23129 variables, and 11 constraints, problems are : Problem set: 0 solved, 22961 unsolved in 30648 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/167 constraints, PredecessorRefiner: 22837/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 123145ms problems are : Problem set: 0 solved, 22961 unsolved
Search for dead transitions found 0 dead transitions in 123321ms
Starting structural reductions in LTL mode, iteration 1 : 167/173 places, 22962/46834 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130894 ms. Remains : 167/173 places, 22962/46834 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&(X(p2)||p1))))))'
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ErlangenMainframeV0-PT-1105-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 1974 ms.
Product exploration explored 100000 steps with 33333 reset in 1464 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge based reduction with 4 factoid took 56 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 12039 ms. (3 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1180 ms. (33 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1518 ms. (26 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 820 ms. (48 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 712 ms. (56 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 562 ms. (71 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 508 ms. (78 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 74530 steps, run timeout after 15001 ms. (steps per millisecond=4 ) properties seen :0 out of 6
Probabilistic random walk after 74530 steps, saw 50306 distinct states, run finished after 15002 ms. (steps per millisecond=4 ) properties seen :0
[2026-05-27 20:39:18] [INFO ] Invariant cache hit.
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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 83/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 37/157 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 10/167 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 5194ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 37 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 22962/22962 transitions.
Graph (trivial) has 89 edges and 167 vertex of which 4 / 167 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 165 transition count 22945
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 152 transition count 22945
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 27 place count 152 transition count 22926
Deduced a syphon composed of 19 places in 57 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 65 place count 133 transition count 22926
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 131 transition count 22909
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 131 transition count 22909
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 131 transition count 22907
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 7 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 143 place count 95 transition count 22871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 93 transition count 22890
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 153 place count 93 transition count 22884
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 161 place count 87 transition count 22882
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 163 place count 87 transition count 22882
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 173 place count 87 transition count 22882
Applied a total of 173 rules in 5217 ms. Remains 87 /167 variables (removed 80) and now considering 22882/22962 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5219 ms. Remains : 87/167 places, 22882/22962 transitions.
RANDOM walk for 40000 steps (8 resets) in 21410 ms. (1 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3881 ms. (10 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1381 ms. (28 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3628 ms. (11 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2841 ms. (14 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1352 ms. (29 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1335 ms. (29 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 260981 steps, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen :0 out of 6
Probabilistic random walk after 260981 steps, saw 37129 distinct states, run finished after 30004 ms. (steps per millisecond=8 ) properties seen :0
[2026-05-27 20:40:09] [INFO ] Flow matrix only has 22861 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4147641963866456523.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2708576097143955278.kers'
[2026-05-27 20:40:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4147641963866456523.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2708576097143955278.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 98 ms.
// Phase 1: matrix 22861 rows 86 cols 588590 entries
Finished phase 1 with 57 SingleSign rule and 2 generalized
[2026-05-27 20:40:09] [INFO ] Computed 28 invariants in 420 ms
Computed 28 P flows in 436 ms.
Exported basis to /tmp/petrispot-output-2708576097143955278.kers
Total runtime 531 ms.
[2026-05-27 20:40:09] [INFO ] State equation strengthened by 36 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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 17/54 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 7/61 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 26/87 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 22861/22948 variables, 87/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22948 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22948 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/22948 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22948/22948 variables, and 151 constraints, problems are : Problem set: 0 solved, 6 unsolved in 30915 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 87/87 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 17/54 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 7/61 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 26/87 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 22861/22948 variables, 87/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22948 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22948 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 22948/22948 variables, and 151 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45040 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 87/87 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 76892ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 22882/22882 transitions.
Applied a total of 0 rules in 919 ms. Remains 87 /87 variables (removed 0) and now considering 22882/22882 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 920 ms. Remains : 87/87 places, 22882/22882 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 22882/22882 transitions.
Applied a total of 0 rules in 669 ms. Remains 87 /87 variables (removed 0) and now considering 22882/22882 (removed 0) transitions.
[2026-05-27 20:41:27] [INFO ] Flow matrix only has 22861 transitions (discarded 21 similar events)
[2026-05-27 20:41:27] [INFO ] Invariant cache hit.
[2026-05-27 20:41:30] [INFO ] Implicit Places using invariants in 3132 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3174 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 86/87 places, 22882/22882 transitions.
Applied a total of 0 rules in 866 ms. Remains 86 /86 variables (removed 0) and now considering 22882/22882 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4720 ms. Remains : 86/87 places, 22882/22882 transitions.
Knowledge based reduction with 4 factoid took 57 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Knowledge-based reduction took 154378 ms.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 37 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 22962/22962 transitions.
Applied a total of 0 rules in 146 ms. Remains 167 /167 variables (removed 0) and now considering 22962/22962 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5004882735547024103.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3330414483818841679.kers'
[2026-05-27 20:41:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5004882735547024103.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3330414483818841679.kers]
Culled 0 columns in 170 ms.
// Phase 1: matrix 22962 rows 167 cols 588858 entries
Finished phase 1 with 137 SingleSign rule and 2 generalized
[2026-05-27 20:41:33] [INFO ] Computed 28 invariants in 595 ms
Computed 28 P flows in 596 ms.
Exported basis to /tmp/petrispot-output-3330414483818841679.kers
Total runtime 718 ms.
[2026-05-27 20:41:37] [INFO ] Implicit Places using invariants in 5205 ms returned []
Implicit Place search using SMT only with invariants took 5206 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 5355 ms. Remains : 167/167 places, 22962/22962 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge based reduction with 4 factoid took 48 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 12429 ms. (3 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 911 ms. (43 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 901 ms. (44 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 865 ms. (46 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 904 ms. (44 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 880 ms. (45 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 759 ms. (52 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 75284 steps, run timeout after 15002 ms. (steps per millisecond=5 ) properties seen :0 out of 6
Probabilistic random walk after 75284 steps, saw 50717 distinct states, run finished after 15005 ms. (steps per millisecond=5 ) properties seen :0
[2026-05-27 20:41:58] [INFO ] Invariant cache hit.
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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 83/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 37/157 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 10/167 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 5201ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 37 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 22962/22962 transitions.
Graph (trivial) has 89 edges and 167 vertex of which 4 / 167 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 165 transition count 22945
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 152 transition count 22945
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 27 place count 152 transition count 22926
Deduced a syphon composed of 19 places in 35 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 65 place count 133 transition count 22926
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 131 transition count 22909
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 131 transition count 22909
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 131 transition count 22907
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 9 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 143 place count 95 transition count 22871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 93 transition count 22890
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 153 place count 93 transition count 22884
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 161 place count 87 transition count 22882
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 163 place count 87 transition count 22882
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 173 place count 87 transition count 22882
Applied a total of 173 rules in 5650 ms. Remains 87 /167 variables (removed 80) and now considering 22882/22962 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5652 ms. Remains : 87/167 places, 22882/22962 transitions.
RANDOM walk for 40000 steps (8 resets) in 18601 ms. (2 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2899 ms. (13 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1344 ms. (29 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2803 ms. (14 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2893 ms. (13 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1303 ms. (30 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1314 ms. (30 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 204250 steps, run timeout after 24001 ms. (steps per millisecond=8 ) properties seen :0 out of 6
Probabilistic random walk after 204250 steps, saw 30109 distinct states, run finished after 24005 ms. (steps per millisecond=8 ) properties seen :0
[2026-05-27 20:42:41] [INFO ] Flow matrix only has 22861 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7991056859994482743.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1605447854696929006.kers'
[2026-05-27 20:42:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7991056859994482743.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1605447854696929006.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 99 ms.
// Phase 1: matrix 22861 rows 86 cols 588590 entries
Finished phase 1 with 57 SingleSign rule and 2 generalized
[2026-05-27 20:42:42] [INFO ] Computed 28 invariants in 398 ms
Computed 28 P flows in 399 ms.
Exported basis to /tmp/petrispot-output-1605447854696929006.kers
Total runtime 490 ms.
[2026-05-27 20:42:42] [INFO ] State equation strengthened by 36 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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 17/54 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 7/61 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 26/87 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 22861/22948 variables, 87/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22948 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22948 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/22948 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22948/22948 variables, and 151 constraints, problems are : Problem set: 0 solved, 6 unsolved in 30974 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 87/87 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 17/54 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 7/61 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 26/87 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 22861/22948 variables, 87/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22948 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22948 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 22948/22948 variables, and 151 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 87/87 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 76855ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 22882/22882 transitions.
Applied a total of 0 rules in 864 ms. Remains 87 /87 variables (removed 0) and now considering 22882/22882 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 865 ms. Remains : 87/87 places, 22882/22882 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 22882/22882 transitions.
Applied a total of 0 rules in 704 ms. Remains 87 /87 variables (removed 0) and now considering 22882/22882 (removed 0) transitions.
[2026-05-27 20:44:00] [INFO ] Flow matrix only has 22861 transitions (discarded 21 similar events)
[2026-05-27 20:44:00] [INFO ] Invariant cache hit.
[2026-05-27 20:44:03] [INFO ] Implicit Places using invariants in 3613 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3654 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 86/87 places, 22882/22882 transitions.
Applied a total of 0 rules in 837 ms. Remains 86 /86 variables (removed 0) and now considering 22882/22882 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5203 ms. Remains : 86/87 places, 22882/22882 transitions.
Knowledge based reduction with 4 factoid took 52 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Knowledge-based reduction took 147395 ms.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 33333 reset in 1278 ms.
Product exploration explored 100000 steps with 33333 reset in 1251 ms.
Spot run failed in 104 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin6069980786509557292
[2026-05-27 20:44:08] [INFO ] Built C files in 834ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6069980786509557292
Running compilation step : cd /tmp/ltsmin6069980786509557292;'/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/ltsmin6069980786509557292;'/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/ltsmin6069980786509557292;'/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 37 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 22962/22962 transitions.
Applied a total of 0 rules in 134 ms. Remains 167 /167 variables (removed 0) and now considering 22962/22962 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3547138776917643799.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-887871718283845042.kers'
[2026-05-27 20:44:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3547138776917643799.kers, --Pflows, --basisKERS=/tmp/petrispot-output-887871718283845042.kers]
Culled 0 columns in 179 ms.
// Phase 1: matrix 22962 rows 167 cols 588858 entries
Finished phase 1 with 137 SingleSign rule and 2 generalized
[2026-05-27 20:44:12] [INFO ] Computed 28 invariants in 634 ms
Computed 28 P flows in 635 ms.
Exported basis to /tmp/petrispot-output-887871718283845042.kers
Total runtime 759 ms.
[2026-05-27 20:44:16] [INFO ] Implicit Places using invariants in 4371 ms returned []
Implicit Place search using SMT only with invariants took 4372 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 4508 ms. Remains : 167/167 places, 22962/22962 transitions.
Built C files in :
/tmp/ltsmin5223306276544612186
[2026-05-27 20:44:17] [INFO ] Built C files in 813ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5223306276544612186
Running compilation step : cd /tmp/ltsmin5223306276544612186;'/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/ltsmin5223306276544612186;'/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/ltsmin5223306276544612186;'/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-27 20:44:29] [INFO ] Flatten gal took : 4141 ms
[2026-05-27 20:44:32] [INFO ] Flatten gal took : 3257 ms
[2026-05-27 20:44:33] [INFO ] Time to serialize gal into /tmp/LTL8266871894400923785.gal : 656 ms
[2026-05-27 20:44:33] [INFO ] Time to serialize properties into /tmp/LTL14725404877038992898.prop : 2 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/LTL8266871894400923785.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15203197879828398443.hoa' '-atoms' '/tmp/LTL14725404877038992898.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Detected timeout of ITS tools.
[2026-05-27 20:44:58] [INFO ] Flatten gal took : 3460 ms
[2026-05-27 20:45:01] [INFO ] Flatten gal took : 3315 ms
[2026-05-27 20:45:01] [INFO ] Time to serialize gal into /tmp/LTL3604211857853180498.gal : 605 ms
[2026-05-27 20:45:01] [INFO ] Time to serialize properties into /tmp/LTL16508633514456487794.ltl : 3 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/LTL3604211857853180498.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16508633514456487794.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2026-05-27 20:45:21] [INFO ] Flatten gal took : 3848 ms
[2026-05-27 20:45:21] [INFO ] Applying decomposition
[2026-05-27 20:45:24] [INFO ] Flatten gal took : 3072 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/graph11884974538415587070.txt' '-o' '/tmp/graph11884974538415587070.bin' '-w' '/tmp/graph11884974538415587070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11884974538415587070.bin' '-l' '-1' '-v' '-w' '/tmp/graph11884974538415587070.weights' '-q' '0' '-e' '0.001'
[2026-05-27 20:45:35] [INFO ] Decomposing Gal with order
[2026-05-27 20:45:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 20:45:44] [INFO ] Removed a total of 305280 redundant transitions.
[2026-05-27 20:45:44] [INFO ] Flatten gal took : 7015 ms
[2026-05-27 20:45:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 3392 ms.
[2026-05-27 20:45:49] [INFO ] Time to serialize gal into /tmp/LTL8732058362626834702.gal : 177 ms
[2026-05-27 20:45:49] [INFO ] Time to serialize properties into /tmp/LTL13454899501299198087.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/LTL8732058362626834702.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13454899501299198087.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(((((i2.u6.p22==0)||(i2.u10.p35==0))||((i2.u13.p48==0)||(i3.u14.p57==0)))||(((i2.u18.p70==0)||(i2.u22.p87==0))||((i2.u23.p9...1041
Formula 0 simplified : XXG(!"(((((i2.u6.p22==0)||(i2.u10.p35==0))||((i2.u13.p48==0)||(i3.u14.p57==0)))||(((i2.u18.p70==0)||(i2.u22.p87==0))||((i2.u23.p96==...1027
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-1105-LTLFireability-00 finished in 561818 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)&&G(p1)))'
Support contains 25 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 46834/46834 transitions.
Graph (trivial) has 101 edges and 173 vertex of which 4 / 173 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 170 transition count 46819
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 158 transition count 46819
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 25 place count 158 transition count 46800
Deduced a syphon composed of 19 places in 56 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 63 place count 139 transition count 46800
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 70 place count 132 transition count 33279
Iterating global reduction 2 with 7 rules applied. Total rules applied 77 place count 132 transition count 33279
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 132 transition count 33277
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 12 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 169 place count 87 transition count 33232
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 171 place count 86 transition count 33243
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 176 place count 86 transition count 33243
Applied a total of 176 rules in 7498 ms. Remains 86 /173 variables (removed 87) and now considering 33243/46834 (removed 13591) transitions.
[2026-05-27 20:46:12] [INFO ] Flow matrix only has 33222 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11685045577531892813.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1204995469784892569.kers'
[2026-05-27 20:46:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11685045577531892813.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1204995469784892569.kers]
Normalized transition count is 33221 out of 33222 initially.
Culled 0 columns in 138 ms.
// Phase 1: matrix 33221 rows 86 cols 827066 entries
Finished phase 1 with 56 SingleSign rule and 2 generalized
[2026-05-27 20:46:12] [INFO ] Computed 28 invariants in 580 ms
Computed 28 P flows in 580 ms.
Exported basis to /tmp/petrispot-output-1204995469784892569.kers
Total runtime 682 ms.
[2026-05-27 20:46:28] [INFO ] Implicit Places using invariants in 16134 ms returned []
Implicit Place search using SMT only with invariants took 16136 ms to find 0 implicit places.
Running 33241 sub problems to find dead transitions.
[2026-05-27 20:46:28] [INFO ] Flow matrix only has 33222 transitions (discarded 21 similar events)
[2026-05-27 20:46:28] [INFO ] Invariant cache hit.
[2026-05-27 20:46:29] [INFO ] State equation strengthened by 15563 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 33241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 85/33308 variables, and 11 constraints, problems are : Problem set: 0 solved, 33241 unsolved in 31039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/86 constraints, ReadFeed: 0/15563 constraints, PredecessorRefiner: 33241/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 33241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 85/33308 variables, and 11 constraints, problems are : Problem set: 0 solved, 33241 unsolved in 30713 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/86 constraints, ReadFeed: 0/15563 constraints, PredecessorRefiner: 33208/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 189954ms problems are : Problem set: 0 solved, 33241 unsolved
Search for dead transitions found 0 dead transitions in 190196ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/173 places, 33243/46834 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 213982 ms. Remains : 86/173 places, 33243/46834 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)&&G(p1)))'
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-1105-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 7 ms.
FORMULA ErlangenMainframeV0-PT-1105-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1105-LTLFireability-01 finished in 214428 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))'
Support contains 13 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 46834/46834 transitions.
Graph (trivial) has 101 edges and 173 vertex of which 4 / 173 are part of one of the 2 SCC in 16 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 170 transition count 46819
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 158 transition count 46819
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 25 place count 158 transition count 46800
Deduced a syphon composed of 19 places in 67 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 63 place count 139 transition count 46800
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 81 place count 121 transition count 31232
Ensure Unique test removed 11 places
Iterating global reduction 2 with 29 rules applied. Total rules applied 110 place count 110 transition count 31232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 112 place count 110 transition count 31230
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 117 place count 105 transition count 4222
Iterating global reduction 3 with 5 rules applied. Total rules applied 122 place count 105 transition count 4222
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 104 transition count 4220
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 104 transition count 4220
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 212 place count 60 transition count 4176
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 216 place count 58 transition count 4187
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 220 place count 58 transition count 4183
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 225 place count 58 transition count 4183
Applied a total of 225 rules in 11617 ms. Remains 58 /173 variables (removed 115) and now considering 4183/46834 (removed 42651) transitions.
[2026-05-27 20:49:50] [INFO ] Flow matrix only has 4162 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8102035951256698874.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14460702562613625891.kers'
[2026-05-27 20:49:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8102035951256698874.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14460702562613625891.kers]
Normalized transition count is 4161 out of 4162 initially.
Culled 0 columns in 16 ms.
// Phase 1: matrix 4161 rows 58 cols 102688 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-27 20:49:50] [INFO ] Computed 17 invariants in 47 ms
Computed 17 P flows in 47 ms.
Exported basis to /tmp/petrispot-output-14460702562613625891.kers
Total runtime 70 ms.
[2026-05-27 20:49:52] [INFO ] Implicit Places using invariants in 2124 ms returned []
[2026-05-27 20:49:52] [INFO ] Flow matrix only has 4162 transitions (discarded 21 similar events)
[2026-05-27 20:49:52] [INFO ] Invariant cache hit.
[2026-05-27 20:49:55] [INFO ] State equation strengthened by 2059 read => feed constraints.
[2026-05-27 20:49:58] [INFO ] Implicit Places using invariants and state equation in 5696 ms returned []
Implicit Place search using SMT with State Equation took 7827 ms to find 0 implicit places.
[2026-05-27 20:49:59] [INFO ] Redundant transitions in 1403 ms returned []
Running 4181 sub problems to find dead transitions.
[2026-05-27 20:49:59] [INFO ] Flow matrix only has 4162 transitions (discarded 21 similar events)
[2026-05-27 20:49:59] [INFO ] Invariant cache hit.
[2026-05-27 20:50:00] [INFO ] State equation strengthened by 2059 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 57/4220 variables, and 0 constraints, problems are : Problem set: 0 solved, 4181 unsolved in 30128 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, State Equation: 0/58 constraints, ReadFeed: 0/2059 constraints, PredecessorRefiner: 4181/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4181 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 57/4220 variables, and 0 constraints, problems are : Problem set: 0 solved, 4181 unsolved in 30126 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, State Equation: 0/58 constraints, ReadFeed: 0/2059 constraints, PredecessorRefiner: 4148/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67827ms problems are : Problem set: 0 solved, 4181 unsolved
Search for dead transitions found 0 dead transitions in 67867ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/173 places, 4183/46834 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88782 ms. Remains : 58/173 places, 4183/46834 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))'
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1105-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 8764 ms.
Product exploration explored 100000 steps with 0 reset in 8270 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 3 factoid took 52 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 5261 ms. (7 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 744 ms. (53 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 114476 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 1
Probabilistic random walk after 114476 steps, saw 25613 distinct states, run finished after 3005 ms. (steps per millisecond=38 ) properties seen :0
[2026-05-27 20:51:29] [INFO ] Flow matrix only has 4162 transitions (discarded 21 similar events)
[2026-05-27 20:51:29] [INFO ] Invariant cache hit.
[2026-05-27 20:51:29] [INFO ] State equation strengthened by 2059 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/46 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/58 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4219/4220 variables, and 75 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2123 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 58/58 constraints, ReadFeed: 0/2059 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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/46 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/58 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4161/4219 variables, 58/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4219 variables, 2058/2133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4219 variables, 0/2133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/4220 variables, 1/2134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4220 variables, 0/2134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/4220 variables, 0/2134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4220/4220 variables, and 2134 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3109 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 58/58 constraints, ReadFeed: 2059/2059 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5311ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 33 ms.
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 3 factoid took 51 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 10194 ms.
FORMULA ErlangenMainframeV0-PT-1105-LTLFireability-02 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1105-LTLFireability-02 finished in 116226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0))||G((!p1||(F(!p0)&&F(!p2))))||(X(X(X(F(p3))))&&(!p1||G(F(!p0))||(F(!p0)&&F(!p2))))))'
Support contains 28 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 46834/46834 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 157 transition count 31283
Ensure Unique test removed 11 places
Iterating global reduction 0 with 27 rules applied. Total rules applied 43 place count 146 transition count 31283
Applied a total of 43 rules in 4473 ms. Remains 146 /173 variables (removed 27) and now considering 31283/46834 (removed 15551) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8496667781016088682.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15303563383719170944.kers'
[2026-05-27 20:51:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8496667781016088682.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15303563383719170944.kers]
Culled 0 columns in 79 ms.
// Phase 1: matrix 31283 rows 146 cols 467143 entries
Finished phase 1 with 129 SingleSign rule and 0 generalized
[2026-05-27 20:51:40] [INFO ] Computed 17 invariants in 493 ms
Computed 17 P flows in 494 ms.
Exported basis to /tmp/petrispot-output-15303563383719170944.kers
Total runtime 554 ms.
[2026-05-27 20:51:41] [INFO ] Implicit Places using invariants in 2269 ms returned []
Implicit Place search using SMT only with invariants took 2271 ms to find 0 implicit places.
Running 31282 sub problems to find dead transitions.
[2026-05-27 20:51:42] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 145/31429 variables, and 0 constraints, problems are : Problem set: 0 solved, 31282 unsolved in 30923 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, State Equation: 0/146 constraints, PredecessorRefiner: 31282/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 145/31429 variables, and 0 constraints, problems are : Problem set: 0 solved, 31282 unsolved in 30529 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, State Equation: 0/146 constraints, PredecessorRefiner: 31146/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 179482ms problems are : Problem set: 0 solved, 31282 unsolved
Search for dead transitions found 0 dead transitions in 179624ms
Starting structural reductions in LTL mode, iteration 1 : 146/173 places, 31283/46834 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186425 ms. Remains : 146/173 places, 31283/46834 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))||G(((F(p0)&&F(p2))||p1))||(X(X(X(F(p3))))&&(G(F(p0))||(F(p0)&&F(p2))||p4))))'
Stuttering acceptance computed with spot in 809 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p4))), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3) p1), (AND p1 (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : ErlangenMainframeV0-PT-1105-LTLFireability-03
Product exploration timeout after 30150 steps with 0 reset in 10004 ms.
Product exploration timeout after 30950 steps with 0 reset in 10005 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge based reduction with 19 factoid took 198 ms. Reduced automaton from 16 states, 34 edges and 5 AP (stutter sensitive) to 7 states, 10 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 20027 ms. (1 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1380 ms. (28 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1810 ms. (22 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1110 ms. (36 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1407 ms. (28 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1148 ms. (34 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1400 ms. (28 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1202 ms. (33 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1308 ms. (30 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1292 ms. (30 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 83977 steps, run timeout after 24001 ms. (steps per millisecond=3 ) properties seen :0 out of 9
Probabilistic random walk after 83977 steps, saw 56868 distinct states, run finished after 24001 ms. (steps per millisecond=3 ) properties seen :0
[2026-05-27 20:55:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf1 is UNSAT
Problem apf5 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 81/109 variables, 13/13 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 37/146 variables, 4/17 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 6 unsolved
SMT process timed out in 5382ms, After SMT, problems are : Problem set: 3 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 28 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 31283/31283 transitions.
Graph (trivial) has 86 edges and 146 vertex of which 4 / 146 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 144 transition count 31266
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 131 transition count 31266
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 27 place count 131 transition count 31247
Deduced a syphon composed of 19 places in 97 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 65 place count 112 transition count 31247
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 110 transition count 31230
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 110 transition count 31230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 110 transition count 31228
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 22 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 143 place count 74 transition count 31192
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 22 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 72 transition count 31210
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 152 place count 72 transition count 31205
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 159 place count 67 transition count 31203
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 161 place count 67 transition count 31203
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 171 place count 67 transition count 31203
Applied a total of 171 rules in 6386 ms. Remains 67 /146 variables (removed 79) and now considering 31203/31283 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6388 ms. Remains : 67/146 places, 31203/31283 transitions.
RANDOM walk for 40000 steps (8 resets) in 33395 ms. (1 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6125 ms. (6 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6268 ms. (6 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6538 ms. (6 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 6034 ms. (6 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5271 ms. (7 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5883 ms. (6 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 365854 steps, run timeout after 57001 ms. (steps per millisecond=6 ) properties seen :2 out of 6
Probabilistic random walk after 365854 steps, saw 48529 distinct states, run finished after 57001 ms. (steps per millisecond=6 ) properties seen :2
[2026-05-27 20:57:05] [INFO ] Flow matrix only has 31184 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5613830729808910020.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-713624885262019274.kers'
[2026-05-27 20:57:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5613830729808910020.kers, --Pflows, --basisKERS=/tmp/petrispot-output-713624885262019274.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 136 ms.
// Phase 1: matrix 31184 rows 66 cols 809012 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-27 20:57:05] [INFO ] Computed 17 invariants in 472 ms
Computed 17 P flows in 473 ms.
Exported basis to /tmp/petrispot-output-713624885262019274.kers
Total runtime 600 ms.
[2026-05-27 20:57:05] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 34/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 7/67 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 31184/31251 variables, 67/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31251 variables, 36/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31251 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/31251 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
No progress, stopping.
After SMT solving in domain Real declared 31251/31251 variables, and 120 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45047 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 67/67 constraints, ReadFeed: 36/36 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/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 34/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 7/67 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 31184/31251 variables, 67/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31251 variables, 36/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31251 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 31251/31251 variables, and 120 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45044 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 67/67 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 91060ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 31203/31203 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 31201
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 65 transition count 31201
Applied a total of 4 rules in 4555 ms. Remains 65 /67 variables (removed 2) and now considering 31201/31203 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4555 ms. Remains : 65/67 places, 31201/31203 transitions.
Found 3 invariant AP formulas.
Knowledge based reduction with 22 factoid took 101 ms. Proved property starting from automaton with 7 states, 10 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 218175 ms.
FORMULA ErlangenMainframeV0-PT-1105-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1105-LTLFireability-03 finished in 425645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G((p1||X(X(X(F(p2)))))))))'
Support contains 35 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 46834/46834 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 168 transition count 33330
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 168 transition count 33330
Applied a total of 10 rules in 1339 ms. Remains 168 /173 variables (removed 5) and now considering 33330/46834 (removed 13504) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9457234816591008622.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8746425643608877278.kers'
[2026-05-27 20:58:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9457234816591008622.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8746425643608877278.kers]
Culled 0 columns in 164 ms.
// Phase 1: matrix 33330 rows 168 cols 858426 entries
Finished phase 1 with 138 SingleSign rule and 2 generalized
[2026-05-27 20:58:43] [INFO ] Computed 28 invariants in 645 ms
Computed 28 P flows in 646 ms.
Exported basis to /tmp/petrispot-output-8746425643608877278.kers
Total runtime 754 ms.
[2026-05-27 20:58:49] [INFO ] Implicit Places using invariants in 7401 ms returned []
Implicit Place search using SMT only with invariants took 7402 ms to find 0 implicit places.
Running 33329 sub problems to find dead transitions.
[2026-05-27 20:58:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 33329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 167/33498 variables, and 11 constraints, problems are : Problem set: 0 solved, 33329 unsolved in 30684 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 33329/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 33329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 167/33498 variables, and 11 constraints, problems are : Problem set: 0 solved, 33329 unsolved in 30627 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 33205/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 176648ms problems are : Problem set: 0 solved, 33329 unsolved
Search for dead transitions found 0 dead transitions in 176792ms
Starting structural reductions in LTL mode, iteration 1 : 168/173 places, 33330/46834 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185597 ms. Remains : 168/173 places, 33330/46834 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G((X(X(X(F(p1))))||p2)))))'
Stuttering acceptance computed with spot in 483 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV0-PT-1105-LTLFireability-04
Product exploration timeout after 28620 steps with 0 reset in 10005 ms.
Stack based approach found an accepted trace after 51 steps with 0 reset with depth 52 and stack size 52 in 3 ms.
FORMULA ErlangenMainframeV0-PT-1105-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1105-LTLFireability-04 finished in 196322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 25 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 46834/46834 transitions.
Graph (trivial) has 101 edges and 173 vertex of which 4 / 173 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 170 transition count 46819
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 158 transition count 46819
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 25 place count 158 transition count 46800
Deduced a syphon composed of 19 places in 59 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 63 place count 139 transition count 46800
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 70 place count 132 transition count 33279
Iterating global reduction 2 with 7 rules applied. Total rules applied 77 place count 132 transition count 33279
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 132 transition count 33277
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 14 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 165 place count 89 transition count 33234
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 167 place count 88 transition count 33245
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 174 place count 88 transition count 33245
Applied a total of 174 rules in 9865 ms. Remains 88 /173 variables (removed 85) and now considering 33245/46834 (removed 13589) transitions.
[2026-05-27 21:02:07] [INFO ] Flow matrix only has 33224 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5967052666032520485.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5735620703220743384.kers'
[2026-05-27 21:02:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5967052666032520485.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5735620703220743384.kers]
Normalized transition count is 33223 out of 33224 initially.
Culled 0 columns in 138 ms.
// Phase 1: matrix 33223 rows 88 cols 827070 entries
Finished phase 1 with 58 SingleSign rule and 2 generalized
[2026-05-27 21:02:07] [INFO ] Computed 28 invariants in 596 ms
Computed 28 P flows in 597 ms.
Exported basis to /tmp/petrispot-output-5735620703220743384.kers
Total runtime 708 ms.
[2026-05-27 21:02:23] [INFO ] Implicit Places using invariants in 16350 ms returned []
Implicit Place search using SMT only with invariants took 16351 ms to find 0 implicit places.
Running 33243 sub problems to find dead transitions.
[2026-05-27 21:02:23] [INFO ] Flow matrix only has 33224 transitions (discarded 21 similar events)
[2026-05-27 21:02:23] [INFO ] Invariant cache hit.
[2026-05-27 21:02:23] [INFO ] State equation strengthened by 15563 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 33243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 87/33312 variables, and 11 constraints, problems are : Problem set: 0 solved, 33243 unsolved in 30698 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/88 constraints, ReadFeed: 0/15563 constraints, PredecessorRefiner: 33243/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 33243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 87/33312 variables, and 11 constraints, problems are : Problem set: 0 solved, 33243 unsolved in 30930 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/88 constraints, ReadFeed: 0/15563 constraints, PredecessorRefiner: 33208/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 186468ms problems are : Problem set: 0 solved, 33243 unsolved
Search for dead transitions found 0 dead transitions in 186601ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/173 places, 33245/46834 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 212875 ms. Remains : 88/173 places, 33245/46834 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-1105-LTLFireability-05
Product exploration timeout after 17420 steps with 0 reset in 10004 ms.
Product exploration timeout after 18360 steps with 0 reset in 10002 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 9 factoid took 55 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 32264 ms. (1 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2525 ms. (15 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2453 ms. (16 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2143 ms. (18 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3723 ms. (10 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 180586 steps, run timeout after 39001 ms. (steps per millisecond=4 ) properties seen :0 out of 4
Probabilistic random walk after 180586 steps, saw 43807 distinct states, run finished after 39002 ms. (steps per millisecond=4 ) properties seen :0
[2026-05-27 21:06:43] [INFO ] Flow matrix only has 33224 transitions (discarded 21 similar events)
[2026-05-27 21:06:43] [INFO ] Invariant cache hit.
[2026-05-27 21:06:43] [INFO ] State equation strengthened by 15563 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 18/43 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 12/55 variables, 4/17 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 33/88 variables, 11/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SMT process timed out in 5308ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 25 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 33245/33245 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 88 transition count 33243
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 33254
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 87 transition count 33242
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 30 place count 75 transition count 33240
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 75 transition count 33240
Applied a total of 31 rules in 8446 ms. Remains 75 /88 variables (removed 13) and now considering 33240/33245 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8448 ms. Remains : 75/88 places, 33240/33245 transitions.
RANDOM walk for 40000 steps (8 resets) in 35790 ms. (1 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3200 ms. (12 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2563 ms. (15 steps per ms) remains 2/2 properties
[2026-05-27 21:07:10] [INFO ] Flow matrix only has 33213 transitions (discarded 27 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6397983768263122890.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18064400768868803762.kers'
[2026-05-27 21:07:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6397983768263122890.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18064400768868803762.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 239 ms.
// Phase 1: matrix 33213 rows 74 cols 827022 entries
Finished phase 1 with 45 SingleSign rule and 2 generalized
[2026-05-27 21:07:11] [INFO ] Computed 28 invariants in 851 ms
Computed 28 P flows in 852 ms.
Exported basis to /tmp/petrispot-output-18064400768868803762.kers
Total runtime 1023 ms.
[2026-05-27 21:07:11] [INFO ] State equation strengthened by 15588 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/65 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/75 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 33288/33288 variables, and 103 constraints, problems are : Problem set: 0 solved, 2 unsolved in 28416 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 75/75 constraints, ReadFeed: 0/15588 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/65 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/75 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 33288/33288 variables, and 103 constraints, problems are : Problem set: 0 solved, 2 unsolved in 29033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 75/75 constraints, ReadFeed: 0/15588 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58980ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1310 steps, including 61 resets, run visited all 2 properties in 2169 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 2180 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 85 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 141493 ms.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 12 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 33245/33245 transitions.
Applied a total of 0 rules in 1139 ms. Remains 88 /88 variables (removed 0) and now considering 33245/33245 (removed 0) transitions.
[2026-05-27 21:08:13] [INFO ] Flow matrix only has 33224 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7596547211805983971.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17962919173803919356.kers'
[2026-05-27 21:08:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7596547211805983971.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17962919173803919356.kers]
Normalized transition count is 33223 out of 33224 initially.
Culled 0 columns in 227 ms.
// Phase 1: matrix 33223 rows 88 cols 827070 entries
Finished phase 1 with 58 SingleSign rule and 2 generalized
[2026-05-27 21:08:14] [INFO ] Computed 28 invariants in 797 ms
Computed 28 P flows in 798 ms.
Exported basis to /tmp/petrispot-output-17962919173803919356.kers
Total runtime 949 ms.
[2026-05-27 21:08:31] [INFO ] Implicit Places using invariants in 18435 ms returned []
Implicit Place search using SMT only with invariants took 18436 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19578 ms. Remains : 88/88 places, 33245/33245 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 3 factoid took 69 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 31347 ms. (1 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2544 ms. (15 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 135826 steps, run timeout after 27001 ms. (steps per millisecond=5 ) properties seen :0 out of 1
Probabilistic random walk after 135826 steps, saw 31541 distinct states, run finished after 27002 ms. (steps per millisecond=5 ) properties seen :0
[2026-05-27 21:09:08] [INFO ] Flow matrix only has 33224 transitions (discarded 21 similar events)
[2026-05-27 21:09:08] [INFO ] Invariant cache hit.
[2026-05-27 21:09:08] [INFO ] State equation strengthened by 15563 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/27 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/44 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/88 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5296ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 33245/33245 transitions.
Graph (trivial) has 33 edges and 88 vertex of which 2 / 88 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 87 transition count 33233
Deduced a syphon composed of 8 places in 15 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 79 transition count 33233
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 23 place count 73 transition count 4169
Iterating global reduction 0 with 6 rules applied. Total rules applied 29 place count 73 transition count 4169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 73 transition count 4168
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 72 transition count 4179
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 72 transition count 4178
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 40 place count 72 transition count 4171
Free-agglomeration rule applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 56 place count 72 transition count 4155
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 91 place count 56 transition count 4136
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 100 place count 56 transition count 4127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 55 transition count 4126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 54 transition count 4126
Applied a total of 102 rules in 26802 ms. Remains 54 /88 variables (removed 34) and now considering 4126/33245 (removed 29119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26802 ms. Remains : 54/88 places, 4126/33245 transitions.
RANDOM walk for 40000 steps (8 resets) in 6939 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5628 steps, run visited all 1 properties in 184 ms. (steps per millisecond=30 )
Probabilistic random walk after 5628 steps, saw 1499 distinct states, run finished after 192 ms. (steps per millisecond=29 ) properties seen :1
Knowledge based reduction with 3 factoid took 58 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 68 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 71533 ms.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 18100 steps with 0 reset in 10004 ms.
Product exploration timeout after 18560 steps with 0 reset in 10001 ms.
Built C files in :
/tmp/ltsmin10527533337055252164
[2026-05-27 21:10:03] [INFO ] Too many transitions (33245) to apply POR reductions. Disabling POR matrices.
[2026-05-27 21:10:04] [INFO ] Built C files in 1339ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10527533337055252164
Running compilation step : cd /tmp/ltsmin10527533337055252164;'/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/ltsmin10527533337055252164;'/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/ltsmin10527533337055252164;'/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 12 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 33245/33245 transitions.
Graph (trivial) has 33 edges and 88 vertex of which 2 / 88 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 87 transition count 33236
Deduced a syphon composed of 8 places in 16 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 79 transition count 33236
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 23 place count 73 transition count 4172
Iterating global reduction 0 with 6 rules applied. Total rules applied 29 place count 73 transition count 4172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 73 transition count 4171
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 73 transition count 4166
Applied a total of 35 rules in 21296 ms. Remains 73 /88 variables (removed 15) and now considering 4166/33245 (removed 29079) transitions.
[2026-05-27 21:10:28] [INFO ] Flow matrix only has 4146 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3161675439180223122.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2569160737553461449.kers'
[2026-05-27 21:10:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3161675439180223122.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2569160737553461449.kers]
Normalized transition count is 4145 out of 4146 initially.
Culled 0 columns in 16 ms.
// Phase 1: matrix 4145 rows 73 cols 98504 entries
Finished phase 1 with 43 SingleSign rule and 2 generalized
[2026-05-27 21:10:29] [INFO ] Computed 28 invariants in 60 ms
Computed 28 P flows in 61 ms.
Exported basis to /tmp/petrispot-output-2569160737553461449.kers
Total runtime 76 ms.
[2026-05-27 21:10:31] [INFO ] Implicit Places using invariants in 2994 ms returned []
[2026-05-27 21:10:31] [INFO ] Flow matrix only has 4146 transitions (discarded 20 similar events)
[2026-05-27 21:10:31] [INFO ] Invariant cache hit.
[2026-05-27 21:10:33] [INFO ] State equation strengthened by 2068 read => feed constraints.
[2026-05-27 21:10:39] [INFO ] Implicit Places using invariants and state equation in 7949 ms returned []
Implicit Place search using SMT with State Equation took 10949 ms to find 0 implicit places.
[2026-05-27 21:10:40] [INFO ] Redundant transitions in 1010 ms returned []
Running 4164 sub problems to find dead transitions.
[2026-05-27 21:10:40] [INFO ] Flow matrix only has 4146 transitions (discarded 20 similar events)
[2026-05-27 21:10:40] [INFO ] Invariant cache hit.
[2026-05-27 21:10:40] [INFO ] State equation strengthened by 2068 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4164 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 72/4219 variables, and 11 constraints, problems are : Problem set: 0 solved, 4164 unsolved in 30127 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/73 constraints, ReadFeed: 0/2068 constraints, PredecessorRefiner: 4164/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4164 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 72/4219 variables, and 11 constraints, problems are : Problem set: 0 solved, 4164 unsolved in 30123 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/73 constraints, ReadFeed: 0/2068 constraints, PredecessorRefiner: 4137/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66910ms problems are : Problem set: 0 solved, 4164 unsolved
Search for dead transitions found 0 dead transitions in 66952ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/88 places, 4166/33245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100223 ms. Remains : 73/88 places, 4166/33245 transitions.
Built C files in :
/tmp/ltsmin129016257784249931
[2026-05-27 21:11:47] [INFO ] Too many transitions (4166) to apply POR reductions. Disabling POR matrices.
[2026-05-27 21:11:48] [INFO ] Built C files in 127ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin129016257784249931
Running compilation step : cd /tmp/ltsmin129016257784249931;'/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/ltsmin129016257784249931;'/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/ltsmin129016257784249931;'/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-27 21:11:56] [INFO ] Flatten gal took : 1485 ms
[2026-05-27 21:11:58] [INFO ] Flatten gal took : 1471 ms
[2026-05-27 21:11:58] [INFO ] Time to serialize gal into /tmp/LTL5669055665565280689.gal : 445 ms
[2026-05-27 21:11:58] [INFO ] Time to serialize properties into /tmp/LTL3374595126109876849.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/LTL5669055665565280689.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3033183147453080805.hoa' '-atoms' '/tmp/LTL3374595126109876849.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...317
Loading property file /tmp/LTL3374595126109876849.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3033183147453080805.hoa
Detected timeout of ITS tools.
[2026-05-27 21:12:26] [INFO ] Flatten gal took : 7491 ms
[2026-05-27 21:12:32] [INFO ] Flatten gal took : 6434 ms
[2026-05-27 21:12:33] [INFO ] Time to serialize gal into /tmp/LTL16966940636277518937.gal : 701 ms
[2026-05-27 21:12:33] [INFO ] Time to serialize properties into /tmp/LTL8596535184226222379.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/LTL16966940636277518937.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8596535184226222379.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2026-05-27 21:12:55] [INFO ] Flatten gal took : 6627 ms
[2026-05-27 21:12:55] [INFO ] Applying decomposition
[2026-05-27 21:13:02] [INFO ] Flatten gal took : 6883 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/graph15190195249965440895.txt' '-o' '/tmp/graph15190195249965440895.bin' '-w' '/tmp/graph15190195249965440895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15190195249965440895.bin' '-l' '-1' '-v' '-w' '/tmp/graph15190195249965440895.weights' '-q' '0' '-e' '0.001'
[2026-05-27 21:13:17] [INFO ] Decomposing Gal with order
[2026-05-27 21:13:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 21:13:32] [INFO ] Removed a total of 423745 redundant transitions.
[2026-05-27 21:13:33] [INFO ] Flatten gal took : 11934 ms
[2026-05-27 21:13:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 3282 ms.
[2026-05-27 21:13:37] [INFO ] Time to serialize gal into /tmp/LTL8306945312166285409.gal : 82 ms
[2026-05-27 21:13:37] [INFO ] Time to serialize properties into /tmp/LTL7608972289246886718.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/LTL8306945312166285409.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7608972289246886718.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((i1.u0.p17==0)||(u2.p30==0))||((i1.u5.p47==0)||(i0.i0.u6.p56==0)))||(((i3.u8.p69==0)||(i3.u11.p86==0))||((i0.i0.u13.p99==0...539
Formula 0 simplified : G(F!"(((((i1.u0.p18==1)&&(u2.p31==1))&&((i1.u5.p48==1)&&(i0.i0.u6.p57==1)))&&(((i1.u9.p74==1)&&(i1.u10.p83==1))&&((i3.u12.p106==1)&&...532
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-1105-LTLFireability-05 finished in 715751 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)&&F(G(p1))))'
Support contains 17 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 46834/46834 transitions.
Graph (trivial) has 97 edges and 173 vertex of which 4 / 173 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 170 transition count 46819
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 158 transition count 46819
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 25 place count 158 transition count 46800
Deduced a syphon composed of 19 places in 68 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 63 place count 139 transition count 46800
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 81 place count 121 transition count 31232
Ensure Unique test removed 11 places
Iterating global reduction 2 with 29 rules applied. Total rules applied 110 place count 110 transition count 31232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 112 place count 110 transition count 31230
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 116 place count 106 transition count 6270
Iterating global reduction 3 with 4 rules applied. Total rules applied 120 place count 106 transition count 6270
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 206 place count 63 transition count 6227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 208 place count 62 transition count 6238
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 212 place count 62 transition count 6234
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 220 place count 62 transition count 6234
Applied a total of 220 rules in 17270 ms. Remains 62 /173 variables (removed 111) and now considering 6234/46834 (removed 40600) transitions.
[2026-05-27 21:14:10] [INFO ] Flow matrix only has 6213 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2720276749608046566.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11636047206593339508.kers'
[2026-05-27 21:14:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2720276749608046566.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11636047206593339508.kers]
Normalized transition count is 6212 out of 6213 initially.
Culled 0 columns in 25 ms.
// Phase 1: matrix 6212 rows 62 cols 153894 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-27 21:14:10] [INFO ] Computed 17 invariants in 72 ms
Computed 17 P flows in 73 ms.
Exported basis to /tmp/petrispot-output-11636047206593339508.kers
Total runtime 92 ms.
[2026-05-27 21:14:12] [INFO ] Implicit Places using invariants in 2416 ms returned []
[2026-05-27 21:14:12] [INFO ] Flow matrix only has 6213 transitions (discarded 21 similar events)
[2026-05-27 21:14:12] [INFO ] Invariant cache hit.
[2026-05-27 21:14:15] [INFO ] State equation strengthened by 3083 read => feed constraints.
[2026-05-27 21:14:18] [INFO ] Implicit Places using invariants and state equation in 6015 ms returned []
Implicit Place search using SMT with State Equation took 8436 ms to find 0 implicit places.
[2026-05-27 21:14:21] [INFO ] Redundant transitions in 2740 ms returned []
Running 6232 sub problems to find dead transitions.
[2026-05-27 21:14:21] [INFO ] Flow matrix only has 6213 transitions (discarded 21 similar events)
[2026-05-27 21:14:21] [INFO ] Invariant cache hit.
[2026-05-27 21:14:21] [INFO ] State equation strengthened by 3083 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 61/6275 variables, and 0 constraints, problems are : Problem set: 0 solved, 6232 unsolved in 30180 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, State Equation: 0/62 constraints, ReadFeed: 0/3083 constraints, PredecessorRefiner: 6232/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6232 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 61/6275 variables, and 0 constraints, problems are : Problem set: 0 solved, 6232 unsolved in 30184 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, State Equation: 0/62 constraints, ReadFeed: 0/3083 constraints, PredecessorRefiner: 6196/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 71425ms problems are : Problem set: 0 solved, 6232 unsolved
Search for dead transitions found 0 dead transitions in 71456ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/173 places, 6234/46834 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99925 ms. Remains : 62/173 places, 6234/46834 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)&&F(G(p1))))'
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1105-LTLFireability-06
Product exploration timeout after 84190 steps with 0 reset in 10001 ms.
Product exploration timeout after 86340 steps with 0 reset in 10001 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 7 factoid took 56 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 6180 ms. (6 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 600 ms. (66 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 816 ms. (48 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 851 ms. (46 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 145242 steps, run timeout after 6001 ms. (steps per millisecond=24 ) properties seen :0 out of 3
Probabilistic random walk after 145242 steps, saw 31607 distinct states, run finished after 6001 ms. (steps per millisecond=24 ) properties seen :0
[2026-05-27 21:16:01] [INFO ] Flow matrix only has 6213 transitions (discarded 21 similar events)
[2026-05-27 21:16:01] [INFO ] Invariant cache hit.
[2026-05-27 21:16:01] [INFO ] State equation strengthened by 3083 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/50 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 12/62 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6274/6275 variables, and 79 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4855 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 62/62 constraints, ReadFeed: 0/3083 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/50 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 12/62 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6212/6274 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6274 variables, 3082/3161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6274 variables, 0/3161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/6275 variables, 1/3162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6275 variables, 0/3162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/6275 variables, 0/3162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6275/6275 variables, and 3162 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4952 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 62/62 constraints, ReadFeed: 3083/3083 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9884ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 1119 ms.
Support contains 17 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 6234/6234 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 6232
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 61 transition count 6242
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 61 transition count 6241
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 14 place count 61 transition count 6232
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 25 place count 52 transition count 6230
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 2 with 29 rules applied. Total rules applied 54 place count 52 transition count 6201
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 52 transition count 6201
Applied a total of 55 rules in 15982 ms. Remains 52 /62 variables (removed 10) and now considering 6201/6234 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15982 ms. Remains : 52/62 places, 6201/6234 transitions.
RANDOM walk for 1464 steps (0 resets) in 344 ms. (4 steps per ms) remains 0/2 properties
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 7 factoid took 46 ms. Proved property starting from automaton with 3 states, 6 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 35725 ms.
FORMULA ErlangenMainframeV0-PT-1105-LTLFireability-06 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1105-LTLFireability-06 finished in 155877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(G(!p1)))))'
Support contains 16 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 46834/46834 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 170 transition count 35890
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 170 transition count 35890
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 167 transition count 14002
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 167 transition count 14002
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 166 transition count 14000
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 166 transition count 14000
Applied a total of 14 rules in 4205 ms. Remains 166 /173 variables (removed 7) and now considering 14000/46834 (removed 32834) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13488551193637343696.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16205309048834147098.kers'
[2026-05-27 21:16:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13488551193637343696.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16205309048834147098.kers]
Culled 0 columns in 100 ms.
// Phase 1: matrix 14000 rows 166 cols 350774 entries
Finished phase 1 with 135 SingleSign rule and 3 generalized
[2026-05-27 21:16:33] [INFO ] Computed 28 invariants in 338 ms
Computed 28 P flows in 339 ms.
Exported basis to /tmp/petrispot-output-16205309048834147098.kers
Total runtime 416 ms.
[2026-05-27 21:16:44] [INFO ] Implicit Places using invariants in 11818 ms returned []
Implicit Place search using SMT only with invariants took 11821 ms to find 0 implicit places.
Running 13999 sub problems to find dead transitions.
[2026-05-27 21:16:44] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 13999 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 165/14166 variables, and 11 constraints, problems are : Problem set: 0 solved, 13999 unsolved in 30399 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/166 constraints, PredecessorRefiner: 13999/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13999 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 13999 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 165/14166 variables, and 11 constraints, problems are : Problem set: 0 solved, 13999 unsolved in 30396 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/166 constraints, PredecessorRefiner: 13877/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 98263ms problems are : Problem set: 0 solved, 13999 unsolved
Search for dead transitions found 0 dead transitions in 98318ms
Starting structural reductions in LTL mode, iteration 1 : 166/173 places, 14000/46834 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114368 ms. Remains : 166/173 places, 14000/46834 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(G(!p1)))))'
Stuttering acceptance computed with spot in 287 ms :[p1, p1, p1, (AND p1 (NOT p0)), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-1105-LTLFireability-07
Product exploration timeout after 80420 steps with 0 reset in 10001 ms.
Product exploration timeout after 85110 steps with 0 reset in 10002 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge based reduction with 10 factoid took 60 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 6688 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 359 ms. (111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 22316 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :0 out of 1
Probabilistic random walk after 22316 steps, saw 15555 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
[2026-05-27 21:18:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/104 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 50/154 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/166 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 14166/14166 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 166/166 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/104 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 50/154 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/166 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 14166/14166 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10125ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 14000/14000 transitions.
Graph (trivial) has 113 edges and 166 vertex of which 6 / 166 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 163 transition count 13981
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 150 transition count 13981
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 27 place count 150 transition count 13960
Deduced a syphon composed of 21 places in 14 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 69 place count 129 transition count 13960
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 74 place count 124 transition count 6771
Iterating global reduction 2 with 5 rules applied. Total rules applied 79 place count 124 transition count 6771
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 124 transition count 6768
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 122 transition count 4208
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 122 transition count 4208
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 88 place count 120 transition count 4204
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 120 transition count 4204
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 176 place count 77 transition count 4161
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 186 place count 72 transition count 4179
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 187 place count 72 transition count 4178
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 190 place count 72 transition count 4175
Free-agglomeration rule applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 206 place count 72 transition count 4159
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 4 with 35 rules applied. Total rules applied 241 place count 56 transition count 4140
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 256 place count 56 transition count 4125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 257 place count 55 transition count 4124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 258 place count 54 transition count 4124
Applied a total of 258 rules in 12744 ms. Remains 54 /166 variables (removed 112) and now considering 4124/14000 (removed 9876) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12749 ms. Remains : 54/166 places, 4124/14000 transitions.
RANDOM walk for 40000 steps (8 resets) in 7657 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 342 ms. (116 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 189847 steps, run visited all 1 properties in 5481 ms. (steps per millisecond=34 )
Probabilistic random walk after 189847 steps, saw 30059 distinct states, run finished after 5482 ms. (steps per millisecond=34 ) properties seen :1
Negative knowledge disproves property using: (G (NOT p1))
Knowledge based reduction with 10 factoid took 38 ms. Proved property starting from automaton with 4 states, 5 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 35692 ms.
FORMULA ErlangenMainframeV0-PT-1105-LTLFireability-07 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1105-LTLFireability-07 finished in 170537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G((X(p2)&&p1))||X(F(!p0)))))'
Support contains 31 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 46834/46834 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 168 transition count 33330
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 168 transition count 33330
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 166 transition count 16050
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 166 transition count 16050
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 164 transition count 16046
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 164 transition count 16046
Applied a total of 18 rules in 3766 ms. Remains 164 /173 variables (removed 9) and now considering 16046/46834 (removed 30788) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4412528372833539249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4767137912170043453.kers'
[2026-05-27 21:19:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4412528372833539249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4767137912170043453.kers]
Culled 0 columns in 74 ms.
// Phase 1: matrix 16046 rows 164 cols 409138 entries
Finished phase 1 with 134 SingleSign rule and 2 generalized
[2026-05-27 21:19:23] [INFO ] Computed 28 invariants in 372 ms
Computed 28 P flows in 372 ms.
Exported basis to /tmp/petrispot-output-4767137912170043453.kers
Total runtime 429 ms.
[2026-05-27 21:19:29] [INFO ] Implicit Places using invariants in 6039 ms returned []
Implicit Place search using SMT only with invariants took 6041 ms to find 0 implicit places.
Running 16045 sub problems to find dead transitions.
[2026-05-27 21:19:29] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16045 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 163/16210 variables, and 11 constraints, problems are : Problem set: 0 solved, 16045 unsolved in 30450 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/164 constraints, PredecessorRefiner: 16045/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16045 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16045 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 163/16210 variables, and 11 constraints, problems are : Problem set: 0 solved, 16045 unsolved in 30279 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/164 constraints, PredecessorRefiner: 15925/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 103534ms problems are : Problem set: 0 solved, 16045 unsolved
Search for dead transitions found 0 dead transitions in 103642ms
Starting structural reductions in LTL mode, iteration 1 : 164/173 places, 16046/46834 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113491 ms. Remains : 164/173 places, 16046/46834 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G((X(p2)&&p1))||X(F(!p0)))))'
Stuttering acceptance computed with spot in 151 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : ErlangenMainframeV0-PT-1105-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 1239 ms.
Product exploration explored 100000 steps with 50000 reset in 1330 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 13 factoid took 16 ms. Proved property starting from automaton with 4 states, 8 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 362 ms.
FORMULA ErlangenMainframeV0-PT-1105-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1105-LTLFireability-09 finished in 116686 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&&(G(p1)||X(p2))&&(G(p0)||p3))))'
Support contains 37 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 46834/46834 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 168 transition count 33330
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 168 transition count 33330
Applied a total of 10 rules in 1546 ms. Remains 168 /173 variables (removed 5) and now considering 33330/46834 (removed 13504) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12009695458310783946.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10776869614801194310.kers'
[2026-05-27 21:21:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12009695458310783946.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10776869614801194310.kers]
Culled 0 columns in 205 ms.
// Phase 1: matrix 33330 rows 168 cols 858426 entries
Finished phase 1 with 138 SingleSign rule and 2 generalized
[2026-05-27 21:21:18] [INFO ] Computed 28 invariants in 886 ms
Computed 28 P flows in 887 ms.
Exported basis to /tmp/petrispot-output-10776869614801194310.kers
Total runtime 1016 ms.
[2026-05-27 21:21:23] [INFO ] Implicit Places using invariants in 5901 ms returned []
Implicit Place search using SMT only with invariants took 5903 ms to find 0 implicit places.
Running 33329 sub problems to find dead transitions.
[2026-05-27 21:21:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 33329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 167/33498 variables, and 11 constraints, problems are : Problem set: 0 solved, 33329 unsolved in 30684 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 33329/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 33329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 167/33498 variables, and 11 constraints, problems are : Problem set: 0 solved, 33329 unsolved in 30874 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 33205/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 189858ms problems are : Problem set: 0 solved, 33329 unsolved
Search for dead transitions found 0 dead transitions in 190047ms
Starting structural reductions in LTL mode, iteration 1 : 168/173 places, 33330/46834 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197631 ms. Remains : 168/173 places, 33330/46834 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&&(G(p1)||X(p2))&&(G(p0)||p3))))'
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1105-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 2029 ms.
Product exploration explored 100000 steps with 33333 reset in 2234 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge based reduction with 12 factoid took 54 ms. Proved property starting from automaton with 7 states, 13 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 727 ms.
FORMULA ErlangenMainframeV0-PT-1105-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1105-LTLFireability-10 finished in 203052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||(!p0&&(G(!p1)||(!p1&&F(((!p0&&X(!p2))||G(!p2)))))))) U X(p3)))'
Support contains 38 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 46834/46834 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 168 transition count 33330
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 168 transition count 33330
Applied a total of 10 rules in 1332 ms. Remains 168 /173 variables (removed 5) and now considering 33330/46834 (removed 13504) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15145676293022403762.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-979888130013343394.kers'
[2026-05-27 21:24:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15145676293022403762.kers, --Pflows, --basisKERS=/tmp/petrispot-output-979888130013343394.kers]
Culled 0 columns in 178 ms.
// Phase 1: matrix 33330 rows 168 cols 858426 entries
Finished phase 1 with 138 SingleSign rule and 2 generalized
[2026-05-27 21:24:41] [INFO ] Computed 28 invariants in 700 ms
Computed 28 P flows in 701 ms.
Exported basis to /tmp/petrispot-output-979888130013343394.kers
Total runtime 819 ms.
[2026-05-27 21:24:45] [INFO ] Implicit Places using invariants in 4873 ms returned []
Implicit Place search using SMT only with invariants took 4874 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 168/173 places, 33330/46834 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6208 ms. Remains : 168/173 places, 33330/46834 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||(!p0&&(G(!p1)||(!p1&&F(((!p0&&X(!p2))||G(!p2)))))))) U X(p3)))'
Stuttering acceptance computed with spot in 579 ms :[(NOT p3), (NOT p3), (AND p0 p1 (NOT p3) p2), (NOT p3), (AND p0 (NOT p3)), true, p2, (AND p0 p2 p1), (AND p1 p2), (AND p0 p2), p2, p0, (AND p1 p2)]
Running random walk in product with property : ErlangenMainframeV0-PT-1105-LTLFireability-11
Product exploration explored 100000 steps with 33327 reset in 2024 ms.
Product exploration explored 100000 steps with 33322 reset in 2020 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge based reduction with 37 factoid took 131 ms. Reduced automaton from 13 states, 41 edges and 4 AP (stutter sensitive) to 13 states, 38 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 20992 ms. (1 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 157 ms. (25 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 206 ms. (19 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 154 ms. (25 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 149 ms. (26 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 169 ms. (23 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 170 ms. (23 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 51436 steps, run timeout after 18002 ms. (steps per millisecond=2 ) properties seen :0 out of 24
Probabilistic random walk after 51436 steps, saw 34674 distinct states, run finished after 18003 ms. (steps per millisecond=2 ) properties seen :0
[2026-05-27 21:25:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem apf6 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf16 is UNSAT
Problem apf17 is UNSAT
Problem apf18 is UNSAT
Problem apf21 is UNSAT
At refinement iteration 1 (OVERLAPS) 83/121 variables, 13/13 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/14 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 37/158 variables, 4/18 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/18 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 10/168 variables, 10/28 constraints. Problems are: Problem set: 8 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 168/33498 variables, and 28 constraints, problems are : Problem set: 8 solved, 16 unsolved in 5321 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 24/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 83/121 variables, 13/13 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/14 constraints. Problems are: Problem set: 8 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/33498 variables, and 14 constraints, problems are : Problem set: 8 solved, 16 unsolved in 5355 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 1/11 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 16/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11105ms problems are : Problem set: 8 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 33330/33330 transitions.
Graph (trivial) has 88 edges and 168 vertex of which 4 / 168 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 166 transition count 33313
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 153 transition count 33313
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 27 place count 153 transition count 33294
Deduced a syphon composed of 19 places in 47 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 65 place count 134 transition count 33294
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 132 transition count 33277
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 132 transition count 33277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 132 transition count 33275
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 20 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 143 place count 96 transition count 33239
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 94 transition count 33258
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 153 place count 94 transition count 33252
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 161 place count 88 transition count 33250
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 163 place count 88 transition count 33250
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 173 place count 88 transition count 33250
Applied a total of 173 rules in 8475 ms. Remains 88 /168 variables (removed 80) and now considering 33250/33330 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8477 ms. Remains : 88/168 places, 33250/33330 transitions.
RANDOM walk for 40000 steps (8 resets) in 35500 ms. (1 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 540 ms. (7 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 630 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 658 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 483 ms. (8 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 667 ms. (5 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 548 ms. (7 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 509 ms. (7 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 579 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 573 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 579 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 554 ms. (7 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 585 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 485 ms. (8 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 573 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 470 ms. (8 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 609 ms. (6 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 214614 steps, run timeout after 39002 ms. (steps per millisecond=5 ) properties seen :0 out of 16
Probabilistic random walk after 214614 steps, saw 31969 distinct states, run finished after 39002 ms. (steps per millisecond=5 ) properties seen :0
[2026-05-27 21:26:27] [INFO ] Flow matrix only has 33229 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10239481173803539752.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9504282157389547818.kers'
[2026-05-27 21:26:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10239481173803539752.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9504282157389547818.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 246 ms.
// Phase 1: matrix 33229 rows 87 cols 858158 entries
Finished phase 1 with 58 SingleSign rule and 2 generalized
[2026-05-27 21:26:28] [INFO ] Computed 28 invariants in 884 ms
Computed 28 P flows in 885 ms.
Exported basis to /tmp/petrispot-output-9504282157389547818.kers
Total runtime 1015 ms.
[2026-05-27 21:26:29] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 33/71 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 7/78 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 10/88 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 33229/33317 variables, 88/116 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
SMT process timed out in 46659ms, After SMT, problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 3 different solutions.
Parikh walk visited 12 properties in 4452 ms.
Support contains 32 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 33250/33250 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 88 transition count 33248
Deduced a syphon composed of 2 places in 20 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 86 transition count 33248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 85 transition count 22880
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 85 transition count 22880
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 11 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 82 transition count 22880
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 82 transition count 22879
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 81 transition count 22879
Applied a total of 14 rules in 7561 ms. Remains 81 /88 variables (removed 7) and now considering 22879/33250 (removed 10371) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7561 ms. Remains : 81/88 places, 22879/33250 transitions.
Found 8 invariant AP formulas.
Knowledge based reduction with 45 factoid took 493 ms. Reduced automaton from 13 states, 38 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p3), (NOT p3), (NOT p3), (AND p0 (NOT p3)), true, p0]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6178521046651754292.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17962483890404670624.kers'
[2026-05-27 21:27:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6178521046651754292.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17962483890404670624.kers]
Culled 0 columns in 156 ms.
// Phase 1: matrix 33330 rows 168 cols 858426 entries
Finished phase 1 with 138 SingleSign rule and 2 generalized
[2026-05-27 21:27:29] [INFO ] Computed 28 invariants in 822 ms
Computed 28 P flows in 823 ms.
Exported basis to /tmp/petrispot-output-17962483890404670624.kers
Total runtime 931 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:834)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeFacts.computeEGknowledge(KnowledgeFacts.java:240)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:52)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:248)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-27 21:27:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression EG (NOT p3)
Could not prove EG (NOT p3)
Knowledge-based reduction took 174116 ms.
Stuttering acceptance computed with spot in 198 ms :[(NOT p3), (NOT p3), (NOT p3), (AND p0 (NOT p3)), true, p0]
Support contains 32 out of 168 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 33330/33330 transitions.
Applied a total of 0 rules in 198 ms. Remains 168 /168 variables (removed 0) and now considering 33330/33330 (removed 0) transitions.
[2026-05-27 21:27:44] [INFO ] Invariant cache hit.
[2026-05-27 21:27:48] [INFO ] Implicit Places using invariants in 4113 ms returned []
Implicit Place search using SMT only with invariants took 4114 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 4314 ms. Remains : 168/168 places, 33330/33330 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge based reduction with 13 factoid took 68 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 20633 ms. (1 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1367 ms. (29 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1379 ms. (28 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1152 ms. (34 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1155 ms. (34 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1340 ms. (29 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1242 ms. (32 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1012 ms. (39 steps per ms) remains 7/7 properties

BK_TIME_CONFINEMENT_REACHED

--------------------
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="ErlangenMainframeV0-PT-1105"
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 ErlangenMainframeV0-PT-1105, 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 r114-smll-177955740600500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV0-PT-1105.tgz
mv ErlangenMainframeV0-PT-1105 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;