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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 90M
-rw-r--r-- 1 mcc users 6.5K Mar 7 04:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Mar 7 04:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 04:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 7 04:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 09:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 09:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 09:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 04:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 7 04:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 7 04:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 7 04:59 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 89M 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-1106-LTLFireability-00
FORMULA_NAME ErlangenMainframeV0-PT-1106-LTLFireability-01
FORMULA_NAME ErlangenMainframeV0-PT-1106-LTLFireability-02
FORMULA_NAME ErlangenMainframeV0-PT-1106-LTLFireability-03
FORMULA_NAME ErlangenMainframeV0-PT-1106-LTLFireability-04
FORMULA_NAME ErlangenMainframeV0-PT-1106-LTLFireability-05
FORMULA_NAME ErlangenMainframeV0-PT-1106-LTLFireability-06
FORMULA_NAME ErlangenMainframeV0-PT-1106-LTLFireability-07
FORMULA_NAME ErlangenMainframeV0-PT-1106-LTLFireability-08
FORMULA_NAME ErlangenMainframeV0-PT-1106-LTLFireability-09
FORMULA_NAME ErlangenMainframeV0-PT-1106-LTLFireability-10
FORMULA_NAME ErlangenMainframeV0-PT-1106-LTLFireability-11
FORMULA_NAME ErlangenMainframeV0-PT-1106-LTLFireability-12
FORMULA_NAME ErlangenMainframeV0-PT-1106-LTLFireability-13
FORMULA_NAME ErlangenMainframeV0-PT-1106-LTLFireability-14
FORMULA_NAME ErlangenMainframeV0-PT-1106-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779920467841

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-1106
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 22:21:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 22:21:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 22:21:14] [INFO ] Load time of PNML (sax parser for PT used): 4274 ms
[2026-05-27 22:21:14] [INFO ] Transformed 293 places.
[2026-05-27 22:21:14] [INFO ] Transformed 70282 transitions.
[2026-05-27 22:21:14] [INFO ] Found NUPN structural information;
[2026-05-27 22:21:15] [INFO ] Parsed PT model containing 293 places and 70282 transitions and 1773744 arcs in 5053 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ErlangenMainframeV0-PT-1106-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1106-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 70282/70282 transitions.
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 73 place count 220 transition count 70209
Iterating global reduction 0 with 73 rules applied. Total rules applied 146 place count 220 transition count 70209
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 187 place count 179 transition count 70168
Iterating global reduction 0 with 41 rules applied. Total rules applied 228 place count 179 transition count 70168
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 231 place count 176 transition count 70165
Iterating global reduction 0 with 3 rules applied. Total rules applied 234 place count 176 transition count 70165
Applied a total of 234 rules in 2712 ms. Remains 176 /293 variables (removed 117) and now considering 70165/70282 (removed 117) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-371499876970313399.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15870740429450893234.kers'
[2026-05-27 22:21:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-371499876970313399.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15870740429450893234.kers]
Culled 0 columns in 480 ms.
// Phase 1: matrix 70165 rows 176 cols 1773510 entries
Finished phase 1 with 145 SingleSign rule and 3 generalized
[2026-05-27 22:21:21] [INFO ] Computed 28 invariants in 1778 ms
Computed 28 P flows in 1785 ms.
Exported basis to /tmp/petrispot-output-15870740429450893234.kers
Total runtime 2023 ms.
[2026-05-27 22:21:21] [INFO ] Implicit Places using invariants in 3072 ms returned []
Implicit Place search using SMT only with invariants took 3143 ms to find 0 implicit places.
Running 70164 sub problems to find dead transitions.
[2026-05-27 22:21:23] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
SMT process timed out in 463891ms, After SMT, problems are : Problem set: 0 solved, 70164 unsolved
Search for dead transitions found 0 dead transitions in 464551ms
Starting structural reductions in LTL mode, iteration 1 : 176/293 places, 70165/70282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 471032 ms. Remains : 176/293 places, 70165/70282 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 70165/70165 transitions.
Applied a total of 0 rules in 401 ms. Remains 176 /176 variables (removed 0) and now considering 70165/70165 (removed 0) transitions.
[2026-05-27 22:29:07] [INFO ] Invariant cache hit.
[2026-05-27 22:29:07] [INFO ] Implicit Places using invariants in 211 ms returned []
Implicit Place search using SMT only with invariants took 213 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 622 ms. Remains : 176/176 places, 70165/70165 transitions.
Support contains 60 out of 176 places after structural reductions.
[2026-05-27 22:29:19] [INFO ] Flatten gal took : 10903 ms
[2026-05-27 22:29:30] [INFO ] Flatten gal took : 10650 ms
[2026-05-27 22:29:46] [INFO ] Input system was already deterministic with 70165 transitions.
RANDOM walk for 40000 steps (8 resets) in 52201 ms. (0 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 208 ms. (19 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 211 ms. (18 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 195 ms. (20 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 255 ms. (15 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 189 ms. (21 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 178 ms. (22 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 194 ms. (20 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 206 ms. (19 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 142 ms. (28 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 170 ms. (23 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 161 ms. (24 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 199 ms. (20 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 154 ms. (25 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 168 ms. (23 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 165 ms. (24 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 167 ms. (23 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 196 ms. (20 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 215 ms. (18 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 184 ms. (21 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 255 ms. (15 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 235 ms. (16 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 194 ms. (20 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 186 ms. (21 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 218 ms. (18 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 264 ms. (15 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 228 ms. (17 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 183 ms. (21 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 191 ms. (20 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 183 ms. (21 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 231 ms. (17 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 207 ms. (19 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 212 ms. (18 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 217 ms. (18 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 296 ms. (13 steps per ms) remains 34/34 properties
Interrupted probabilistic random walk after 57862 steps, run timeout after 48003 ms. (steps per millisecond=1 ) properties seen :0 out of 34
Probabilistic random walk after 57862 steps, saw 39159 distinct states, run finished after 48016 ms. (steps per millisecond=1 ) properties seen :0
[2026-05-27 22:30:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 79/139 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 139/70341 variables, and 24 constraints, problems are : Problem set: 0 solved, 34 unsolved in 6138 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/176 constraints, PredecessorRefiner: 34/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 79/139 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 139/70341 variables, and 24 constraints, problems are : Problem set: 0 solved, 34 unsolved in 5328 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/176 constraints, PredecessorRefiner: 34/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12514ms problems are : Problem set: 0 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 70165/70165 transitions.
Graph (trivial) has 85 edges and 176 vertex of which 4 / 176 are part of one of the 2 SCC in 26 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 174 transition count 70148
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 161 transition count 70148
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 161 transition count 70129
Deduced a syphon composed of 19 places in 121 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 65 place count 142 transition count 70129
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 140 transition count 70112
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 140 transition count 70112
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 140 transition count 70110
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 28 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 137 place count 107 transition count 70077
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 27 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 105 transition count 70095
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 146 place count 105 transition count 70090
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 100 transition count 70088
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 100 transition count 70088
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 100 transition count 70088
Applied a total of 166 rules in 17145 ms. Remains 100 /176 variables (removed 76) and now considering 70088/70165 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17155 ms. Remains : 100/176 places, 70088/70165 transitions.
RANDOM walk for 40000 steps (8 resets) in 77194 ms. (0 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 900 ms. (4 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 982 ms. (4 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 674 ms. (5 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 852 ms. (4 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1033 ms. (3 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 922 ms. (4 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 870 ms. (4 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 875 ms. (4 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 677 ms. (5 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 755 ms. (5 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 855 ms. (4 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 942 ms. (4 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 700 ms. (5 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 939 ms. (4 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 761 ms. (5 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 714 ms. (5 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 837 ms. (4 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 890 ms. (4 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 933 ms. (4 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 795 ms. (5 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 802 ms. (4 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 719 ms. (5 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 919 ms. (4 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 885 ms. (4 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 787 ms. (5 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 762 ms. (5 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 794 ms. (5 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 798 ms. (5 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 730 ms. (5 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 803 ms. (4 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 823 ms. (4 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 754 ms. (5 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 849 ms. (4 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 891 ms. (4 steps per ms) remains 34/34 properties
Interrupted probabilistic random walk after 142552 steps, run timeout after 84002 ms. (steps per millisecond=1 ) properties seen :0 out of 34
Probabilistic random walk after 142552 steps, saw 22486 distinct states, run finished after 84003 ms. (steps per millisecond=1 ) properties seen :0
[2026-05-27 22:33:13] [INFO ] Flow matrix only has 70070 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-7337920503769240670.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2941460537271113584.kers'
[2026-05-27 22:33:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7337920503769240670.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2941460537271113584.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 333 ms.
// Phase 1: matrix 70070 rows 99 cols 1773252 entries
Finished phase 1 with 69 SingleSign rule and 3 generalized
[2026-05-27 22:33:15] [INFO ] Computed 28 invariants in 1664 ms
Computed 28 P flows in 1664 ms.
Exported basis to /tmp/petrispot-output-2941460537271113584.kers
Total runtime 1902 ms.
[2026-05-27 22:33:16] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 6/66 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 7/73 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 27/100 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 70170/70170 variables, and 128 constraints, problems are : Problem set: 0 solved, 34 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 100/100 constraints, ReadFeed: 0/37 constraints, PredecessorRefiner: 34/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 6/66 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 7/73 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 73/70170 variables, and 17 constraints, problems are : Problem set: 0 solved, 34 unsolved in 45685 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 0/11 constraints, State Equation: 0/100 constraints, ReadFeed: 0/37 constraints, PredecessorRefiner: 34/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 94106ms problems are : Problem set: 0 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 70088/70088 transitions.
Applied a total of 0 rules in 2259 ms. Remains 100 /100 variables (removed 0) and now considering 70088/70088 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2259 ms. Remains : 100/100 places, 70088/70088 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 70088/70088 transitions.
Applied a total of 0 rules in 1911 ms. Remains 100 /100 variables (removed 0) and now considering 70088/70088 (removed 0) transitions.
[2026-05-27 22:34:52] [INFO ] Flow matrix only has 70070 transitions (discarded 18 similar events)
[2026-05-27 22:34:52] [INFO ] Invariant cache hit.
[2026-05-27 22:34:52] [INFO ] Implicit Places using invariants in 206 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 373 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/100 places, 70088/70088 transitions.
Applied a total of 0 rules in 1919 ms. Remains 99 /99 variables (removed 0) and now considering 70088/70088 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4238 ms. Remains : 99/100 places, 70088/70088 transitions.
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' '!((F(p0)||G(p1)))'
Support contains 31 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 70165/70165 transitions.
Graph (trivial) has 97 edges and 176 vertex of which 4 / 176 are part of one of the 2 SCC in 4 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 173 transition count 70150
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 161 transition count 70150
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 25 place count 161 transition count 70132
Deduced a syphon composed of 18 places in 82 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 143 transition count 70132
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 69 place count 135 transition count 48835
Iterating global reduction 2 with 8 rules applied. Total rules applied 77 place count 135 transition count 48835
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 135 transition count 48833
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 134 transition count 33281
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 134 transition count 33281
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 133 transition count 33279
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 133 transition count 33279
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 12 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 163 place count 93 transition count 33239
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 167 place count 91 transition count 33250
Partial Post-agglomeration rule applied 9 times.
Drop transitions (Partial Post agglomeration) removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 176 place count 91 transition count 33250
Applied a total of 176 rules in 12631 ms. Remains 91 /176 variables (removed 85) and now considering 33250/70165 (removed 36915) transitions.
[2026-05-27 22:35:08] [INFO ] Flow matrix only has 33228 transitions (discarded 22 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17476471063039055309.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8150864803126993741.kers'
[2026-05-27 22:35:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17476471063039055309.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8150864803126993741.kers]
Normalized transition count is 33227 out of 33228 initially.
Culled 0 columns in 187 ms.
// Phase 1: matrix 33227 rows 91 cols 858188 entries
Finished phase 1 with 61 SingleSign rule and 2 generalized
[2026-05-27 22:35:09] [INFO ] Computed 28 invariants in 665 ms
Computed 28 P flows in 665 ms.
Exported basis to /tmp/petrispot-output-8150864803126993741.kers
Total runtime 796 ms.
[2026-05-27 22:35:20] [INFO ] Implicit Places using invariants in 11484 ms returned []
Implicit Place search using SMT only with invariants took 11500 ms to find 0 implicit places.
Running 33248 sub problems to find dead transitions.
[2026-05-27 22:35:20] [INFO ] Flow matrix only has 33228 transitions (discarded 22 similar events)
[2026-05-27 22:35:20] [INFO ] Invariant cache hit.
[2026-05-27 22:35:21] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 33248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 90/33319 variables, and 11 constraints, problems are : Problem set: 0 solved, 33248 unsolved in 31100 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/91 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 33248/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 33248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 90/33319 variables, and 11 constraints, problems are : Problem set: 0 solved, 33248 unsolved in 30896 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/91 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 33219/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 178252ms problems are : Problem set: 0 solved, 33248 unsolved
Search for dead transitions found 0 dead transitions in 178419ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/176 places, 33250/70165 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202644 ms. Remains : 91/176 places, 33250/70165 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 324 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-1106-LTLFireability-01
Product exploration timeout after 16710 steps with 0 reset in 10005 ms.
Product exploration timeout after 17990 steps with 0 reset in 10005 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 64 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 38764 ms. (1 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 3914 ms. (10 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2714 ms. (14 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3491 ms. (11 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2444 ms. (16 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 149297 steps, run timeout after 39001 ms. (steps per millisecond=3 ) properties seen :0 out of 4
Probabilistic random walk after 149297 steps, saw 41685 distinct states, run finished after 39003 ms. (steps per millisecond=3 ) properties seen :0
[2026-05-27 22:39:32] [INFO ] Flow matrix only has 33228 transitions (discarded 22 similar events)
[2026-05-27 22:39:32] [INFO ] Invariant cache hit.
[2026-05-27 22:39:32] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 18/49 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/61 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 30/91 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 5357ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 31 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 33250/33250 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 91 transition count 33248
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 90 transition count 33261
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 13 place count 90 transition count 33252
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 24 place count 81 transition count 33250
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 81 transition count 33250
Applied a total of 26 rules in 6772 ms. Remains 81 /91 variables (removed 10) and now considering 33250/33250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6773 ms. Remains : 81/91 places, 33250/33250 transitions.
RANDOM walk for 40000 steps (8 resets) in 32561 ms. (1 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 3082 ms. (12 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2825 ms. (14 steps per ms) remains 2/2 properties
[2026-05-27 22:39:54] [INFO ] Flow matrix only has 33220 transitions (discarded 30 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2188310062754225267.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6973856808912866540.kers'
[2026-05-27 22:39:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2188310062754225267.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6973856808912866540.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 145 ms.
// Phase 1: matrix 33220 rows 80 cols 858144 entries
Finished phase 1 with 51 SingleSign rule and 2 generalized
[2026-05-27 22:39:55] [INFO ] Computed 28 invariants in 654 ms
Computed 28 P flows in 655 ms.
Exported basis to /tmp/petrispot-output-6973856808912866540.kers
Total runtime 788 ms.
[2026-05-27 22:39:56] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/64 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/71 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/81 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 33301/33301 variables, and 109 constraints, problems are : Problem set: 0 solved, 2 unsolved in 30632 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 81/81 constraints, ReadFeed: 0/37 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/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/64 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/71 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/81 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 33301/33301 variables, and 109 constraints, problems are : Problem set: 0 solved, 2 unsolved in 27984 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 81/81 constraints, ReadFeed: 0/37 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60018ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4038 ms.
Support contains 31 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 33250/33250 transitions.
Applied a total of 0 rules in 969 ms. Remains 81 /81 variables (removed 0) and now considering 33250/33250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 970 ms. Remains : 81/81 places, 33250/33250 transitions.
Knowledge based reduction with 9 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 140905 ms.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 31 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 33250/33250 transitions.
Applied a total of 0 rules in 1067 ms. Remains 91 /91 variables (removed 0) and now considering 33250/33250 (removed 0) transitions.
[2026-05-27 22:41:01] [INFO ] Flow matrix only has 33228 transitions (discarded 22 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8261010290296740164.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3332291476371617262.kers'
[2026-05-27 22:41:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8261010290296740164.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3332291476371617262.kers]
Normalized transition count is 33227 out of 33228 initially.
Culled 0 columns in 145 ms.
// Phase 1: matrix 33227 rows 91 cols 858188 entries
Finished phase 1 with 61 SingleSign rule and 2 generalized
[2026-05-27 22:41:02] [INFO ] Computed 28 invariants in 655 ms
Computed 28 P flows in 655 ms.
Exported basis to /tmp/petrispot-output-3332291476371617262.kers
Total runtime 764 ms.
[2026-05-27 22:41:11] [INFO ] Implicit Places using invariants in 10607 ms returned []
Implicit Place search using SMT only with invariants took 10622 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11692 ms. Remains : 91/91 places, 33250/33250 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 9 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 38210 ms. (1 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3762 ms. (10 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2700 ms. (14 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3758 ms. (10 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2488 ms. (16 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 142730 steps, run timeout after 39001 ms. (steps per millisecond=3 ) properties seen :0 out of 4
Probabilistic random walk after 142730 steps, saw 40045 distinct states, run finished after 39002 ms. (steps per millisecond=3 ) properties seen :0
[2026-05-27 22:42:05] [INFO ] Flow matrix only has 33228 transitions (discarded 22 similar events)
[2026-05-27 22:42:05] [INFO ] Invariant cache hit.
[2026-05-27 22:42:05] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 18/49 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/61 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 30/91 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 5296ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 31 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 33250/33250 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 91 transition count 33248
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 90 transition count 33261
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 13 place count 90 transition count 33252
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 24 place count 81 transition count 33250
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 81 transition count 33250
Applied a total of 26 rules in 6745 ms. Remains 81 /91 variables (removed 10) and now considering 33250/33250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6746 ms. Remains : 81/91 places, 33250/33250 transitions.
RANDOM walk for 40000 steps (8 resets) in 36660 ms. (1 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 3813 ms. (10 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3015 ms. (13 steps per ms) remains 2/2 properties
[2026-05-27 22:42:28] [INFO ] Flow matrix only has 33220 transitions (discarded 30 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13310194433512013926.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16962545617070204595.kers'
[2026-05-27 22:42:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13310194433512013926.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16962545617070204595.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 146 ms.
// Phase 1: matrix 33220 rows 80 cols 858144 entries
Finished phase 1 with 51 SingleSign rule and 2 generalized
[2026-05-27 22:42:30] [INFO ] Computed 28 invariants in 818 ms
Computed 28 P flows in 819 ms.
Exported basis to /tmp/petrispot-output-16962545617070204595.kers
Total runtime 1047 ms.
[2026-05-27 22:42:30] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/64 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/71 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/81 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 33301/33301 variables, and 109 constraints, problems are : Problem set: 0 solved, 2 unsolved in 29197 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 81/81 constraints, ReadFeed: 0/37 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/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/64 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/71 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/81 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 33301/33301 variables, and 109 constraints, problems are : Problem set: 0 solved, 2 unsolved in 31077 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 81/81 constraints, ReadFeed: 0/37 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61806ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5085 ms.
Support contains 31 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 33250/33250 transitions.
Applied a total of 0 rules in 991 ms. Remains 81 /81 variables (removed 0) and now considering 33250/33250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 991 ms. Remains : 81/81 places, 33250/33250 transitions.
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 145115 ms.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 16310 steps with 0 reset in 10005 ms.
Product exploration timeout after 15010 steps with 0 reset in 10004 ms.
Built C files in :
/tmp/ltsmin4957442838334806911
[2026-05-27 22:43:57] [INFO ] Too many transitions (33250) to apply POR reductions. Disabling POR matrices.
[2026-05-27 22:43:58] [INFO ] Built C files in 1304ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4957442838334806911
Running compilation step : cd /tmp/ltsmin4957442838334806911;'/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/ltsmin4957442838334806911;'/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/ltsmin4957442838334806911;'/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 31 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 33250/33250 transitions.
Applied a total of 0 rules in 1011 ms. Remains 91 /91 variables (removed 0) and now considering 33250/33250 (removed 0) transitions.
[2026-05-27 22:44:02] [INFO ] Flow matrix only has 33228 transitions (discarded 22 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14720991439168014565.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15745267492148138975.kers'
[2026-05-27 22:44:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14720991439168014565.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15745267492148138975.kers]
Normalized transition count is 33227 out of 33228 initially.
Culled 0 columns in 147 ms.
// Phase 1: matrix 33227 rows 91 cols 858188 entries
Finished phase 1 with 61 SingleSign rule and 2 generalized
[2026-05-27 22:44:03] [INFO ] Computed 28 invariants in 744 ms
Computed 28 P flows in 744 ms.
Exported basis to /tmp/petrispot-output-15745267492148138975.kers
Total runtime 851 ms.
[2026-05-27 22:44:14] [INFO ] Implicit Places using invariants in 12219 ms returned []
Implicit Place search using SMT only with invariants took 12221 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13236 ms. Remains : 91/91 places, 33250/33250 transitions.
Built C files in :
/tmp/ltsmin14096869588752898545
[2026-05-27 22:44:14] [INFO ] Too many transitions (33250) to apply POR reductions. Disabling POR matrices.
[2026-05-27 22:44:15] [INFO ] Built C files in 1013ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14096869588752898545
Running compilation step : cd /tmp/ltsmin14096869588752898545;'/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/ltsmin14096869588752898545;'/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/ltsmin14096869588752898545;'/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 22:44:34] [INFO ] Flatten gal took : 7698 ms
[2026-05-27 22:44:41] [INFO ] Flatten gal took : 6337 ms
[2026-05-27 22:44:41] [INFO ] Time to serialize gal into /tmp/LTL7559466820457875650.gal : 872 ms
[2026-05-27 22:44:41] [INFO ] Time to serialize properties into /tmp/LTL497006360267729745.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/LTL7559466820457875650.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7124317092544438893.hoa' '-atoms' '/tmp/LTL497006360267729745.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...316
Detected timeout of ITS tools.
[2026-05-27 22:45:13] [INFO ] Flatten gal took : 6707 ms
[2026-05-27 22:45:19] [INFO ] Flatten gal took : 6012 ms
[2026-05-27 22:45:20] [INFO ] Time to serialize gal into /tmp/LTL2356360231476416746.gal : 992 ms
[2026-05-27 22:45:20] [INFO ] Time to serialize properties into /tmp/LTL14787817913545438937.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/LTL2356360231476416746.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14787817913545438937.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 22:45:42] [INFO ] Flatten gal took : 6642 ms
[2026-05-27 22:45:42] [INFO ] Applying decomposition
[2026-05-27 22:45:48] [INFO ] Flatten gal took : 5788 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/graph15774735348685230501.txt' '-o' '/tmp/graph15774735348685230501.bin' '-w' '/tmp/graph15774735348685230501.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15774735348685230501.bin' '-l' '-1' '-v' '-w' '/tmp/graph15774735348685230501.weights' '-q' '0' '-e' '0.001'
[2026-05-27 22:46:04] [INFO ] Decomposing Gal with order
[2026-05-27 22:46:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 22:46:17] [INFO ] Removed a total of 434124 redundant transitions.
[2026-05-27 22:46:17] [INFO ] Flatten gal took : 9564 ms
[2026-05-27 22:46:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 4770 ms.
[2026-05-27 22:46:23] [INFO ] Time to serialize gal into /tmp/LTL8682924014446043923.gal : 125 ms
[2026-05-27 22:46:23] [INFO ] Time to serialize properties into /tmp/LTL16187028972940701946.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/LTL8682924014446043923.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16187028972940701946.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("((((((i3.u0.p18==1)&&(i1.u3.p35==1))&&((i1.u4.p44==1)&&(i1.u7.p61==1)))&&(((i3.u9.p74==1)&&(i3.u10.p83==1))&&((i3.u12.p102==1)&...759
Formula 0 simplified : G!"((((((i3.u0.p18==1)&&(i1.u3.p35==1))&&((i1.u4.p44==1)&&(i1.u7.p61==1)))&&(((i3.u9.p74==1)&&(i3.u10.p83==1))&&((i3.u12.p102==1)&&(...751
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-1106-LTLFireability-01 finished in 703084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(!p0)&&X(X(G(!p1)))) U (F(!p0)&&X(X(G(!p1)))&&p2))))'
Support contains 31 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 70165/70165 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 170 transition count 48885
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 170 transition count 48885
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 168 transition count 22965
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 168 transition count 22965
Applied a total of 16 rules in 6030 ms. Remains 168 /176 variables (removed 8) and now considering 22965/70165 (removed 47200) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8103556269772557964.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13554756169905323229.kers'
[2026-05-27 22:46:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8103556269772557964.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13554756169905323229.kers]
Culled 0 columns in 100 ms.
// Phase 1: matrix 22965 rows 168 cols 588870 entries
Finished phase 1 with 138 SingleSign rule and 2 generalized
[2026-05-27 22:46:45] [INFO ] Computed 28 invariants in 453 ms
Computed 28 P flows in 454 ms.
Exported basis to /tmp/petrispot-output-13554756169905323229.kers
Total runtime 531 ms.
[2026-05-27 22:46:54] [INFO ] Implicit Places using invariants in 9034 ms returned []
Implicit Place search using SMT only with invariants took 9038 ms to find 0 implicit places.
Running 22964 sub problems to find dead transitions.
[2026-05-27 22:46:54] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 22964 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 167/23133 variables, and 11 constraints, problems are : Problem set: 0 solved, 22964 unsolved in 30595 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 22964/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22964 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 22964 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 167/23133 variables, and 11 constraints, problems are : Problem set: 0 solved, 22964 unsolved in 30577 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 22838/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 131518ms problems are : Problem set: 0 solved, 22964 unsolved
Search for dead transitions found 0 dead transitions in 131682ms
Starting structural reductions in LTL mode, iteration 1 : 168/176 places, 22965/70165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146825 ms. Remains : 168/176 places, 22965/70165 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(!p0)&&X(X(G(!p1)))) U (F(!p0)&&X(X(G(!p1)))&&p2))))'
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p2) p0 p1), (OR (NOT p2) p0 p1), p0, p1, p1, true]
Running random walk in product with property : ErlangenMainframeV0-PT-1106-LTLFireability-02
Product exploration timeout after 47060 steps with 0 reset in 10005 ms.
Product exploration timeout after 51520 steps with 0 reset in 10001 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 7 factoid took 98 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 11208 ms. (3 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1194 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 603 ms. (66 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 934 ms. (42 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 887 ms. (45 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 84214 steps, run timeout after 12001 ms. (steps per millisecond=7 ) properties seen :0 out of 4
Probabilistic random walk after 84214 steps, saw 57008 distinct states, run finished after 12002 ms. (steps per millisecond=7 ) properties seen :0
[2026-05-27 22:49:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 90/121 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 37/158 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 10/168 variables, 10/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SMT process timed out in 5480ms, 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 31 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 22965/22965 transitions.
Graph (trivial) has 97 edges and 168 vertex of which 4 / 168 are part of one of the 2 SCC in 9 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 22948
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 22948
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 22929
Deduced a syphon composed of 19 places in 41 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 22929
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 132 transition count 22912
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 132 transition count 22912
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 22910
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 8 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 151 place count 92 transition count 22870
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
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 155 place count 90 transition count 22891
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 163 place count 90 transition count 22883
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 173 place count 82 transition count 22881
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 175 place count 82 transition count 22881
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 182 place count 82 transition count 22881
Applied a total of 182 rules in 6745 ms. Remains 82 /168 variables (removed 86) and now considering 22881/22965 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6764 ms. Remains : 82/168 places, 22881/22965 transitions.
RANDOM walk for 40000 steps (8 resets) in 17392 ms. (2 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1275 ms. (31 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2352 ms. (17 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2340 ms. (17 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 188188 steps, run timeout after 18001 ms. (steps per millisecond=10 ) properties seen :0 out of 3
Probabilistic random walk after 188188 steps, saw 28480 distinct states, run finished after 18001 ms. (steps per millisecond=10 ) properties seen :0
[2026-05-27 22:50:20] [INFO ] Flow matrix only has 22858 transitions (discarded 23 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4224053813063806507.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6497127565886793100.kers'
[2026-05-27 22:50:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4224053813063806507.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6497127565886793100.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 180 ms.
// Phase 1: matrix 22858 rows 81 cols 588590 entries
Finished phase 1 with 52 SingleSign rule and 2 generalized
[2026-05-27 22:50:21] [INFO ] Computed 28 invariants in 614 ms
Computed 28 P flows in 615 ms.
Exported basis to /tmp/petrispot-output-6497127565886793100.kers
Total runtime 696 ms.
[2026-05-27 22:50:21] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 34/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7/72 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 10/82 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 22858/22940 variables, 82/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/22940 variables, 38/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/22940 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/22940 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22940/22940 variables, and 148 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28568 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 82/82 constraints, ReadFeed: 38/38 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/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 34/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7/72 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 10/82 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 22858/22940 variables, 82/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22940 variables, 38/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/22940 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/22940 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22940/22940 variables, and 148 constraints, problems are : Problem set: 0 solved, 3 unsolved in 39620 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 82/82 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69336ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 6848 ms.
Support contains 25 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 22881/22881 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 82 transition count 22879
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 80 transition count 22879
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 78 transition count 11359
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 78 transition count 11359
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 77 transition count 11358
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 76 transition count 11358
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 0 with 32 rules applied. Total rules applied 44 place count 76 transition count 11326
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 45 place count 76 transition count 11325
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 46 place count 75 transition count 11325
Applied a total of 46 rules in 29024 ms. Remains 75 /82 variables (removed 7) and now considering 11325/22881 (removed 11556) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29026 ms. Remains : 75/82 places, 11325/22881 transitions.
Found 1 invariant AP formulas.
Knowledge based reduction with 8 factoid took 84 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p1, p1, true]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9273044286832807874.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9323759742637702379.kers'
[2026-05-27 22:52:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9273044286832807874.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9323759742637702379.kers]
Culled 0 columns in 102 ms.
// Phase 1: matrix 22965 rows 168 cols 588870 entries
Finished phase 1 with 138 SingleSign rule and 2 generalized
[2026-05-27 22:52:06] [INFO ] Computed 28 invariants in 400 ms
Computed 28 P flows in 401 ms.
Exported basis to /tmp/petrispot-output-9323759742637702379.kers
Total runtime 486 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:231)
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 22:52:21] [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 p2)
Could not prove EG (NOT p2)
Knowledge-based reduction took 175012 ms.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p1, p1, true]
Support contains 25 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, 22965/22965 transitions.
Applied a total of 0 rules in 153 ms. Remains 168 /168 variables (removed 0) and now considering 22965/22965 (removed 0) transitions.
[2026-05-27 22:52:22] [INFO ] Invariant cache hit.
[2026-05-27 22:52:29] [INFO ] Implicit Places using invariants in 7794 ms returned []
Implicit Place search using SMT only with invariants took 7796 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 7951 ms. Remains : 168/168 places, 22965/22965 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 3 factoid took 114 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 11207 ms. (3 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1015 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 948 ms. (42 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 59528 steps, run timeout after 9001 ms. (steps per millisecond=6 ) properties seen :0 out of 2
Probabilistic random walk after 59528 steps, saw 40328 distinct states, run finished after 9005 ms. (steps per millisecond=6 ) properties seen :0
[2026-05-27 22:52:43] [INFO ] Invariant cache hit.
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) 96/121 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 37/158 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/168 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 5279ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 25 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 22965/22965 transitions.
Graph (trivial) has 103 edges and 168 vertex of which 4 / 168 are part of one of the 2 SCC in 3 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 22948
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 22948
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 27 place count 153 transition count 22928
Deduced a syphon composed of 20 places in 22 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 67 place count 133 transition count 22928
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 71 place count 129 transition count 11391
Iterating global reduction 2 with 4 rules applied. Total rules applied 75 place count 129 transition count 11391
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 129 transition count 11389
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 128 transition count 11387
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 128 transition count 11387
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 161 place count 87 transition count 11346
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 167 place count 84 transition count 11368
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 173 place count 84 transition count 11362
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 185 place count 84 transition count 11350
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 3 with 14 rules applied. Total rules applied 199 place count 72 transition count 11348
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 223 place count 72 transition count 11324
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 224 place count 72 transition count 11324
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 229 place count 72 transition count 11324
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 234 place count 72 transition count 11319
Applied a total of 234 rules in 67054 ms. Remains 72 /168 variables (removed 96) and now considering 11319/22965 (removed 11646) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67055 ms. Remains : 72/168 places, 11319/22965 transitions.
RANDOM walk for 40000 steps (8 resets) in 10230 ms. (3 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 832 ms. (48 steps per ms) remains 1/1 properties
[2026-05-27 22:53:59] [INFO ] Flow matrix only has 11316 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15097493464471497278.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8901853266628342705.kers'
[2026-05-27 22:53:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15097493464471497278.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8901853266628342705.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 48 ms.
// Phase 1: matrix 11316 rows 71 cols 279750 entries
Finished phase 1 with 42 SingleSign rule and 2 generalized
[2026-05-27 22:53:59] [INFO ] Computed 28 invariants in 181 ms
Computed 28 P flows in 182 ms.
Exported basis to /tmp/petrispot-output-8901853266628342705.kers
Total runtime 230 ms.
[2026-05-27 22:53:59] [INFO ] State equation strengthened by 4637 read => feed constraints.
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) 39/51 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 11/62 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/72 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11316/11388 variables, 72/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/11388 variables, 4637/4737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/11388 variables, 0/4737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/11388 variables, 0/4737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11388/11388 variables, and 4737 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8634 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 72/72 constraints, ReadFeed: 4637/4637 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) 39/51 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 11/62 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/72 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11316/11388 variables, 72/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/11388 variables, 4637/4737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/11388 variables, 0/4737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/11388 variables, 0/4737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11388/11388 variables, and 4737 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9822 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 72/72 constraints, ReadFeed: 4637/4637 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18833ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=1 )
Parikh walk visited 1 properties in 35 ms.
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p1, p1, true]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-628552369399434350.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15533347598594376641.kers'
[2026-05-27 22:54:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-628552369399434350.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15533347598594376641.kers]
Culled 0 columns in 171 ms.
// Phase 1: matrix 22965 rows 168 cols 588870 entries
Finished phase 1 with 138 SingleSign rule and 2 generalized
[2026-05-27 22:54:19] [INFO ] Computed 28 invariants in 589 ms
Computed 28 P flows in 590 ms.
Exported basis to /tmp/petrispot-output-15533347598594376641.kers
Total runtime 667 ms.
Could not prove EG (NOT p2)
Knowledge-based reduction took 124481 ms.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p1, p1, true]
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p1, p1, true]
Product exploration timeout after 50350 steps with 0 reset in 10002 ms.
Product exploration timeout after 52930 steps with 0 reset in 10001 ms.
Spot run failed in 166 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/ltsmin18215245759311875761
[2026-05-27 22:54:56] [INFO ] Built C files in 951ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18215245759311875761
Running compilation step : cd /tmp/ltsmin18215245759311875761;'/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/ltsmin18215245759311875761;'/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/ltsmin18215245759311875761;'/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 25 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 22965/22965 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 166 transition count 11445
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 166 transition count 11445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 165 transition count 11443
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 165 transition count 11443
Applied a total of 6 rules in 751 ms. Remains 165 /168 variables (removed 3) and now considering 11443/22965 (removed 11522) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4823134968171320295.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4851359716121565922.kers'
[2026-05-27 22:54:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4823134968171320295.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4851359716121565922.kers]
Culled 0 columns in 83 ms.
// Phase 1: matrix 11443 rows 165 cols 289346 entries
Finished phase 1 with 135 SingleSign rule and 2 generalized
[2026-05-27 22:55:00] [INFO ] Computed 28 invariants in 286 ms
Computed 28 P flows in 286 ms.
Exported basis to /tmp/petrispot-output-4851359716121565922.kers
Total runtime 325 ms.
[2026-05-27 22:55:04] [INFO ] Implicit Places using invariants in 4912 ms returned []
Implicit Place search using SMT only with invariants took 4913 ms to find 0 implicit places.
Running 11442 sub problems to find dead transitions.
[2026-05-27 22:55:04] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 164/11608 variables, and 11 constraints, problems are : Problem set: 0 solved, 11442 unsolved in 30213 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/165 constraints, PredecessorRefiner: 11442/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11442 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 164/11608 variables, and 11 constraints, problems are : Problem set: 0 solved, 11442 unsolved in 30266 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/165 constraints, PredecessorRefiner: 11318/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 87294ms problems are : Problem set: 0 solved, 11442 unsolved
Search for dead transitions found 0 dead transitions in 87430ms
Starting structural reductions in LTL mode, iteration 1 : 165/168 places, 11443/22965 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93132 ms. Remains : 165/168 places, 11443/22965 transitions.
Built C files in :
/tmp/ltsmin1268681017191458377
[2026-05-27 22:56:32] [INFO ] Built C files in 231ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1268681017191458377
Running compilation step : cd /tmp/ltsmin1268681017191458377;'/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/ltsmin1268681017191458377;'/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/ltsmin1268681017191458377;'/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 22:56:48] [INFO ] Flatten gal took : 2547 ms
[2026-05-27 22:56:50] [INFO ] Flatten gal took : 1774 ms
[2026-05-27 22:56:50] [INFO ] Time to serialize gal into /tmp/LTL199844172208708762.gal : 438 ms
[2026-05-27 22:56:50] [INFO ] Time to serialize properties into /tmp/LTL6299667775420404035.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL199844172208708762.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6045991650490034549.hoa' '-atoms' '/tmp/LTL6299667775420404035.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...316
Loading property file /tmp/LTL6299667775420404035.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6045991650490034549.hoa
Detected timeout of ITS tools.
[2026-05-27 22:57:20] [INFO ] Flatten gal took : 3325 ms
[2026-05-27 22:57:23] [INFO ] Flatten gal took : 3113 ms
[2026-05-27 22:57:24] [INFO ] Time to serialize gal into /tmp/LTL4374121858042088662.gal : 541 ms
[2026-05-27 22:57:24] [INFO ] Time to serialize properties into /tmp/LTL15218284093181191605.ltl : 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/LTL4374121858042088662.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15218284093181191605.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 22:57:43] [INFO ] Flatten gal took : 3566 ms
[2026-05-27 22:57:43] [INFO ] Applying decomposition
[2026-05-27 22:57:46] [INFO ] Flatten gal took : 3143 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/graph5654009635547208388.txt' '-o' '/tmp/graph5654009635547208388.bin' '-w' '/tmp/graph5654009635547208388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5654009635547208388.bin' '-l' '-1' '-v' '-w' '/tmp/graph5654009635547208388.weights' '-q' '0' '-e' '0.001'
[2026-05-27 22:57:58] [INFO ] Decomposing Gal with order
[2026-05-27 22:57:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 22:58:07] [INFO ] Removed a total of 298358 redundant transitions.
[2026-05-27 22:58:07] [INFO ] Flatten gal took : 5792 ms
[2026-05-27 22:58:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 2649 ms.
[2026-05-27 22:58:11] [INFO ] Time to serialize gal into /tmp/LTL1339259307596806574.gal : 88 ms
[2026-05-27 22:58:11] [INFO ] Time to serialize properties into /tmp/LTL1051927750858469599.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/LTL1339259307596806574.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1051927750858469599.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(((F(!("(((((i3.u7.p22==1)&&(i2.u11.p35==1))&&((i2.u12.p44==1)&&(i3.u17.p61==1)))&&(((i3.u20.p74==1)&&(i2.u22.p83==1))&&((i2.u26.p...1327
Formula 0 simplified : X((G"(((((i3.u7.p22==1)&&(i2.u11.p35==1))&&((i2.u12.p44==1)&&(i3.u17.p61==1)))&&(((i3.u20.p74==1)&&(i2.u22.p83==1))&&((i2.u26.p106==...1288
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-1106-LTLFireability-02 finished in 707475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1) U (p2 U p3))))'
Support contains 41 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 70165/70165 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 62389
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 62389
Applied a total of 2 rules in 1260 ms. Remains 175 /176 variables (removed 1) and now considering 62389/70165 (removed 7776) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17994903035122030898.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1769804557974919075.kers'
[2026-05-27 22:58:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17994903035122030898.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1769804557974919075.kers]
Culled 0 columns in 272 ms.
// Phase 1: matrix 62389 rows 175 cols 1586886 entries
Finished phase 1 with 144 SingleSign rule and 3 generalized
[2026-05-27 22:58:29] [INFO ] Computed 28 invariants in 1407 ms
Computed 28 P flows in 1407 ms.
Exported basis to /tmp/petrispot-output-1769804557974919075.kers
Total runtime 1611 ms.
[2026-05-27 22:58:44] [INFO ] Implicit Places using invariants in 16853 ms returned []
Implicit Place search using SMT only with invariants took 16858 ms to find 0 implicit places.
Running 62388 sub problems to find dead transitions.
[2026-05-27 22:58:45] [INFO ] Invariant cache hit.
SMT process timed out in 410944ms, After SMT, problems are : Problem set: 0 solved, 62388 unsolved
Search for dead transitions found 0 dead transitions in 411313ms
Starting structural reductions in LTL mode, iteration 1 : 175/176 places, 62389/70165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 429552 ms. Remains : 175/176 places, 62389/70165 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1) U (p2 U p3))))'
Stuttering acceptance computed with spot in 301 ms :[(NOT p3), (NOT p3), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : ErlangenMainframeV0-PT-1106-LTLFireability-03
Product exploration timeout after 18770 steps with 0 reset in 10003 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 5 ms.
FORMULA ErlangenMainframeV0-PT-1106-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1106-LTLFireability-03 finished in 440254 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||X(X((F(p1) U (F(p3)&&p2))))))))'
Support contains 35 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 70165/70165 transitions.
Applied a total of 0 rules in 577 ms. Remains 176 /176 variables (removed 0) and now considering 70165/70165 (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-16353057841579991384.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12924732878369289983.kers'
[2026-05-27 23:05:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16353057841579991384.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12924732878369289983.kers]
Culled 0 columns in 306 ms.
// Phase 1: matrix 70165 rows 176 cols 1773510 entries
Finished phase 1 with 145 SingleSign rule and 3 generalized
[2026-05-27 23:05:49] [INFO ] Computed 28 invariants in 1806 ms
Computed 28 P flows in 1807 ms.
Exported basis to /tmp/petrispot-output-12924732878369289983.kers
Total runtime 2069 ms.
[2026-05-27 23:06:17] [INFO ] Implicit Places using invariants in 29823 ms returned []
Implicit Place search using SMT only with invariants took 29844 ms to find 0 implicit places.
Running 70164 sub problems to find dead transitions.
[2026-05-27 23:06:17] [INFO ] Invariant cache hit.
SMT process timed out in 497088ms, After SMT, problems are : Problem set: 0 solved, 70164 unsolved
Search for dead transitions found 0 dead transitions in 497413ms
Finished structural reductions in LTL mode , in 1 iterations and 527973 ms. Remains : 176/176 places, 70165/70165 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X((F(p0) U (F(p2)&&p1))))||p3))))'
Stuttering acceptance computed with spot in 328 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV0-PT-1106-LTLFireability-04
Product exploration timeout after 16050 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 64 steps with 0 reset with depth 65 and stack size 65 in 14 ms.
FORMULA ErlangenMainframeV0-PT-1106-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1106-LTLFireability-04 finished in 538774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 12 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 70165/70165 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 170 transition count 48885
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 170 transition count 48885
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 164 transition count 6325
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 164 transition count 6325
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 163 transition count 6323
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 163 transition count 6323
Applied a total of 26 rules in 9587 ms. Remains 163 /176 variables (removed 13) and now considering 6323/70165 (removed 63842) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7279197894886371549.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9047881144117653869.kers'
[2026-05-27 23:14:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7279197894886371549.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9047881144117653869.kers]
Culled 0 columns in 27 ms.
// Phase 1: matrix 6323 rows 163 cols 156226 entries
Finished phase 1 with 133 SingleSign rule and 2 generalized
[2026-05-27 23:14:55] [INFO ] Computed 28 invariants in 107 ms
Computed 28 P flows in 108 ms.
Exported basis to /tmp/petrispot-output-9047881144117653869.kers
Total runtime 131 ms.
[2026-05-27 23:14:59] [INFO ] Implicit Places using invariants in 4210 ms returned []
[2026-05-27 23:14:59] [INFO ] Invariant cache hit.
[2026-05-27 23:15:09] [INFO ] Implicit Places using invariants and state equation in 10182 ms returned []
Implicit Place search using SMT with State Equation took 14403 ms to find 0 implicit places.
Running 6322 sub problems to find dead transitions.
[2026-05-27 23:15:09] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 162/6486 variables, and 11 constraints, problems are : Problem set: 0 solved, 6322 unsolved in 30123 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/163 constraints, PredecessorRefiner: 6322/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6322 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 162/6486 variables, and 11 constraints, problems are : Problem set: 0 solved, 6322 unsolved in 30128 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/163 constraints, PredecessorRefiner: 6198/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73262ms problems are : Problem set: 0 solved, 6322 unsolved
Search for dead transitions found 0 dead transitions in 73298ms
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 6323/70165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97304 ms. Remains : 163/176 places, 6323/70165 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1106-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 4318 ms.
Stack based approach found an accepted trace after 172 steps with 0 reset with depth 173 and stack size 173 in 7 ms.
FORMULA ErlangenMainframeV0-PT-1106-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1106-LTLFireability-05 finished in 101865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 13 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 70165/70165 transitions.
Graph (trivial) has 103 edges and 176 vertex of which 4 / 176 are part of one of the 2 SCC in 5 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 173 transition count 70150
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 161 transition count 70150
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 161 transition count 70131
Deduced a syphon composed of 19 places in 95 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 63 place count 142 transition count 70131
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 123 transition count 46787
Ensure Unique test removed 11 places
Iterating global reduction 2 with 30 rules applied. Total rules applied 112 place count 112 transition count 46787
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 112 transition count 46785
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 120 place count 106 transition count 4225
Iterating global reduction 3 with 6 rules applied. Total rules applied 126 place count 106 transition count 4225
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 104 transition count 4221
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 104 transition count 4221
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 216 place count 61 transition count 4178
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 222 place count 58 transition count 4189
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 226 place count 58 transition count 4185
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 231 place count 58 transition count 4185
Applied a total of 231 rules in 23268 ms. Remains 58 /176 variables (removed 118) and now considering 4185/70165 (removed 65980) transitions.
[2026-05-27 23:16:50] [INFO ] Flow matrix only has 4163 transitions (discarded 22 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-470225556365190105.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8567827783522553497.kers'
[2026-05-27 23:16:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-470225556365190105.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8567827783522553497.kers]
Normalized transition count is 4162 out of 4163 initially.
Culled 0 columns in 18 ms.
// Phase 1: matrix 4162 rows 58 cols 102692 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-27 23:16:50] [INFO ] Computed 17 invariants in 61 ms
Computed 17 P flows in 62 ms.
Exported basis to /tmp/petrispot-output-8567827783522553497.kers
Total runtime 89 ms.
[2026-05-27 23:16:52] [INFO ] Implicit Places using invariants in 1911 ms returned []
[2026-05-27 23:16:52] [INFO ] Flow matrix only has 4163 transitions (discarded 22 similar events)
[2026-05-27 23:16:52] [INFO ] Invariant cache hit.
[2026-05-27 23:16:54] [INFO ] State equation strengthened by 2059 read => feed constraints.
[2026-05-27 23:16:57] [INFO ] Implicit Places using invariants and state equation in 5184 ms returned []
Implicit Place search using SMT with State Equation took 7102 ms to find 0 implicit places.
[2026-05-27 23:16:58] [INFO ] Redundant transitions in 988 ms returned []
Running 4183 sub problems to find dead transitions.
[2026-05-27 23:16:58] [INFO ] Flow matrix only has 4163 transitions (discarded 22 similar events)
[2026-05-27 23:16:58] [INFO ] Invariant cache hit.
[2026-05-27 23:16:58] [INFO ] State equation strengthened by 2059 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4183 unsolved
SMT process timed out in 37318ms, After SMT, problems are : Problem set: 0 solved, 4183 unsolved
Search for dead transitions found 0 dead transitions in 37338ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/176 places, 4185/70165 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68732 ms. Remains : 58/176 places, 4185/70165 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1106-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1106-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1106-LTLFireability-06 finished in 68851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 20 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 70165/70165 transitions.
Graph (trivial) has 96 edges and 176 vertex of which 4 / 176 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 173 transition count 70150
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 161 transition count 70150
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 161 transition count 70131
Deduced a syphon composed of 19 places in 107 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 63 place count 142 transition count 70131
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 123 transition count 46787
Ensure Unique test removed 11 places
Iterating global reduction 2 with 30 rules applied. Total rules applied 112 place count 112 transition count 46787
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 112 transition count 46785
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 111 transition count 31233
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 111 transition count 31233
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 110 transition count 31231
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 110 transition count 31231
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 17 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 192 place count 73 transition count 31194
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 17 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 196 place count 71 transition count 31205
Partial Post-agglomeration rule applied 13 times.
Drop transitions (Partial Post agglomeration) removed 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 209 place count 71 transition count 31205
Applied a total of 209 rules in 16478 ms. Remains 71 /176 variables (removed 105) and now considering 31205/70165 (removed 38960) transitions.
[2026-05-27 23:17:52] [INFO ] Flow matrix only has 31183 transitions (discarded 22 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10456847425107557882.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8980170707895244824.kers'
[2026-05-27 23:17:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10456847425107557882.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8980170707895244824.kers]
Normalized transition count is 31182 out of 31183 initially.
Culled 0 columns in 132 ms.
// Phase 1: matrix 31182 rows 71 cols 777938 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-27 23:17:53] [INFO ] Computed 17 invariants in 467 ms
Computed 17 P flows in 468 ms.
Exported basis to /tmp/petrispot-output-8980170707895244824.kers
Total runtime 585 ms.
[2026-05-27 23:18:01] [INFO ] Implicit Places using invariants in 9112 ms returned []
Implicit Place search using SMT only with invariants took 9114 ms to find 0 implicit places.
Running 31203 sub problems to find dead transitions.
[2026-05-27 23:18:02] [INFO ] Flow matrix only has 31183 transitions (discarded 22 similar events)
[2026-05-27 23:18:02] [INFO ] Invariant cache hit.
[2026-05-27 23:18:02] [INFO ] State equation strengthened by 15563 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 70/31254 variables, and 0 constraints, problems are : Problem set: 0 solved, 31203 unsolved in 30871 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, State Equation: 0/71 constraints, ReadFeed: 0/15563 constraints, PredecessorRefiner: 31203/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31203 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 70/31254 variables, and 0 constraints, problems are : Problem set: 0 solved, 31203 unsolved in 30885 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, State Equation: 0/71 constraints, ReadFeed: 0/15563 constraints, PredecessorRefiner: 31162/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 173738ms problems are : Problem set: 0 solved, 31203 unsolved
Search for dead transitions found 0 dead transitions in 173899ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/176 places, 31205/70165 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 199568 ms. Remains : 71/176 places, 31205/70165 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 130 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-1106-LTLFireability-07
Product exploration timeout after 21110 steps with 0 reset in 10004 ms.

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

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