About the Execution of ITS-Tools for ErlangenMainframeV0-PT-1301
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14324.979 | 3600000.00 | 4231955.00 | 7797.60 | FFFFFFF?FTF?FFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r114-smll-177955740700548.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-1301, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740700548
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 54M
-rw-r--r-- 1 mcc users 7.3K Mar 7 05:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 7 05:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 7 05:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 05:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 15 09:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 09:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 7 05:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Mar 7 05:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 05:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 7 05:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:59 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 54M 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-1301-LTLFireability-00
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLFireability-01
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLFireability-02
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLFireability-03
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLFireability-04
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLFireability-05
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLFireability-06
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLFireability-07
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLFireability-08
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLFireability-09
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLFireability-10
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLFireability-11
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLFireability-12
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLFireability-13
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLFireability-14
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779955712023
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-1301
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-28 08:08:34] [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-28 08:08:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 08:08:38] [INFO ] Load time of PNML (sax parser for PT used): 3518 ms
[2026-05-28 08:08:38] [INFO ] Transformed 291 places.
[2026-05-28 08:08:38] [INFO ] Transformed 37156 transitions.
[2026-05-28 08:08:38] [INFO ] Found NUPN structural information;
[2026-05-28 08:08:38] [INFO ] Parsed PT model containing 291 places and 37156 transitions and 1082128 arcs in 4096 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ErlangenMainframeV0-PT-1301-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1301-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1301-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 37156/37156 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 69 place count 222 transition count 37087
Iterating global reduction 0 with 69 rules applied. Total rules applied 138 place count 222 transition count 37087
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 178 place count 182 transition count 37047
Iterating global reduction 0 with 40 rules applied. Total rules applied 218 place count 182 transition count 37047
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 221 place count 179 transition count 37044
Iterating global reduction 0 with 3 rules applied. Total rules applied 224 place count 179 transition count 37044
Applied a total of 224 rules in 1719 ms. Remains 179 /291 variables (removed 112) and now considering 37044/37156 (removed 112) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5887363921255899622.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16927925938585089783.kers'
[2026-05-28 08:08:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5887363921255899622.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16927925938585089783.kers]
Culled 0 columns in 314 ms.
// Phase 1: matrix 37044 rows 179 cols 1081904 entries
Finished phase 1 with 144 SingleSign rule and 3 generalized
[2026-05-28 08:08:43] [INFO ] Computed 32 invariants in 996 ms
Computed 32 P flows in 1000 ms.
Exported basis to /tmp/petrispot-output-16927925938585089783.kers
Total runtime 1216 ms.
[2026-05-28 08:08:43] [INFO ] Implicit Places using invariants in 2008 ms returned []
Implicit Place search using SMT only with invariants took 2428 ms to find 0 implicit places.
Running 37043 sub problems to find dead transitions.
[2026-05-28 08:08:44] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 37043 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 178/37223 variables, and 13 constraints, problems are : Problem set: 0 solved, 37043 unsolved in 31309 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/179 constraints, PredecessorRefiner: 37043/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37043 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 37043 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 178/37223 variables, and 13 constraints, problems are : Problem set: 0 solved, 37043 unsolved in 30607 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/179 constraints, PredecessorRefiner: 36917/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 209251ms problems are : Problem set: 0 solved, 37043 unsolved
Search for dead transitions found 0 dead transitions in 209667ms
Starting structural reductions in LTL mode, iteration 1 : 179/291 places, 37044/37156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214121 ms. Remains : 179/291 places, 37044/37156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 37044/37044 transitions.
Applied a total of 0 rules in 225 ms. Remains 179 /179 variables (removed 0) and now considering 37044/37044 (removed 0) transitions.
[2026-05-28 08:12:13] [INFO ] Invariant cache hit.
[2026-05-28 08:12:13] [INFO ] Implicit Places using invariants in 135 ms returned []
Implicit Place search using SMT only with invariants took 136 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 179/179 places, 37044/37044 transitions.
Support contains 59 out of 179 places after structural reductions.
[2026-05-28 08:12:21] [INFO ] Flatten gal took : 6807 ms
[2026-05-28 08:12:28] [INFO ] Flatten gal took : 6680 ms
[2026-05-28 08:12:37] [INFO ] Input system was already deterministic with 37044 transitions.
Reduction of identical properties reduced properties to check from 35 to 34
RANDOM walk for 40000 steps (8 resets) in 19665 ms. (2 steps per ms) remains 32/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 113 ms. (35 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 124 ms. (32 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 137 ms. (29 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 106 ms. (37 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 94 ms. (42 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 88 ms. (44 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 65548 steps, run timeout after 18002 ms. (steps per millisecond=3 ) properties seen :0 out of 32
Probabilistic random walk after 65548 steps, saw 47050 distinct states, run finished after 18008 ms. (steps per millisecond=3 ) properties seen :0
[2026-05-28 08:13:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 2 (OVERLAPS) 84/142 variables, 15/28 constraints. Problems are: Problem set: 1 solved, 31 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 142/37223 variables, and 28 constraints, problems are : Problem set: 1 solved, 31 unsolved in 5105 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/179 constraints, PredecessorRefiner: 32/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 84/142 variables, 15/28 constraints. Problems are: Problem set: 1 solved, 31 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 142/37223 variables, and 28 constraints, problems are : Problem set: 1 solved, 31 unsolved in 5090 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/179 constraints, PredecessorRefiner: 31/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10814ms problems are : Problem set: 1 solved, 31 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 58 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 37044/37044 transitions.
Graph (trivial) has 86 edges and 179 vertex of which 4 / 179 are part of one of the 2 SCC in 20 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 177 transition count 37027
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 164 transition count 37027
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 27 place count 164 transition count 37006
Deduced a syphon composed of 21 places in 49 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 69 place count 143 transition count 37006
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 141 transition count 36989
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 141 transition count 36989
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 141 transition count 36987
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 12 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 149 place count 104 transition count 36950
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 153 place count 102 transition count 36963
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 158 place count 102 transition count 36958
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 165 place count 97 transition count 36956
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 167 place count 97 transition count 36956
Partial Post-agglomeration rule applied 13 times.
Drop transitions (Partial Post agglomeration) removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 180 place count 97 transition count 36956
Applied a total of 180 rules in 9768 ms. Remains 97 /179 variables (removed 82) and now considering 36956/37044 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9770 ms. Remains : 97/179 places, 36956/37044 transitions.
RANDOM walk for 40000 steps (8 resets) in 32959 ms. (1 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 485 ms. (8 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 489 ms. (8 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 556 ms. (7 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 463 ms. (8 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 387 ms. (10 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 376 ms. (10 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 361 ms. (11 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 383 ms. (10 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 443 ms. (9 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 343 ms. (11 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 352 ms. (11 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 372 ms. (10 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 395 ms. (10 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 372 ms. (10 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 293 ms. (13 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 376 ms. (10 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 365 ms. (10 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 370 ms. (10 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 430 ms. (9 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 301 ms. (13 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 358 ms. (11 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 303 ms. (13 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 312 ms. (12 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 343 ms. (11 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 234 ms. (17 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 248 ms. (16 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 271 ms. (14 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 274 ms. (14 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 273 ms. (14 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 281 ms. (14 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 261 ms. (15 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 192723 steps, run timeout after 36002 ms. (steps per millisecond=5 ) properties seen :0 out of 31
Probabilistic random walk after 192723 steps, saw 30109 distinct states, run finished after 36003 ms. (steps per millisecond=5 ) properties seen :0
[2026-05-28 08:14:12] [INFO ] Flow matrix only has 36936 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16318774355087123238.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13491468703177370842.kers'
[2026-05-28 08:14:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16318774355087123238.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13491468703177370842.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 300 ms.
// Phase 1: matrix 36936 rows 96 cols 1081622 entries
Finished phase 1 with 62 SingleSign rule and 3 generalized
[2026-05-28 08:14:13] [INFO ] Computed 32 invariants in 889 ms
Computed 32 P flows in 890 ms.
Exported basis to /tmp/petrispot-output-13491468703177370842.kers
Total runtime 1021 ms.
[2026-05-28 08:14:13] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 6/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 7/71 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 26/97 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 37033/37033 variables, and 129 constraints, problems are : Problem set: 0 solved, 31 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 97/97 constraints, ReadFeed: 0/29 constraints, PredecessorRefiner: 31/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 6/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 7/71 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 26/97 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 37033/37033 variables, and 129 constraints, problems are : Problem set: 0 solved, 31 unsolved in 45014 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 97/97 constraints, ReadFeed: 0/29 constraints, PredecessorRefiner: 31/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 91902ms problems are : Problem set: 0 solved, 31 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 58 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 36956/36956 transitions.
Applied a total of 0 rules in 1300 ms. Remains 97 /97 variables (removed 0) and now considering 36956/36956 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1300 ms. Remains : 97/97 places, 36956/36956 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 36956/36956 transitions.
Applied a total of 0 rules in 1196 ms. Remains 97 /97 variables (removed 0) and now considering 36956/36956 (removed 0) transitions.
[2026-05-28 08:15:46] [INFO ] Flow matrix only has 36936 transitions (discarded 20 similar events)
[2026-05-28 08:15:46] [INFO ] Invariant cache hit.
[2026-05-28 08:15:46] [INFO ] Implicit Places using invariants in 171 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 250 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 96/97 places, 36956/36956 transitions.
Applied a total of 0 rules in 1323 ms. Remains 96 /96 variables (removed 0) and now considering 36956/36956 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2784 ms. Remains : 96/97 places, 36956/36956 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV0-PT-1301-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 25 stabilizing places and 25 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&F((p1||X(p2))))))))'
Support contains 35 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 37044/37044 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 178 transition count 32948
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 178 transition count 32948
Applied a total of 2 rules in 867 ms. Remains 178 /179 variables (removed 1) and now considering 32948/37044 (removed 4096) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8660748539302479963.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4434475961200752330.kers'
[2026-05-28 08:15:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8660748539302479963.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4434475961200752330.kers]
Culled 0 columns in 163 ms.
// Phase 1: matrix 32948 rows 178 cols 967216 entries
Finished phase 1 with 144 SingleSign rule and 2 generalized
[2026-05-28 08:15:51] [INFO ] Computed 32 invariants in 738 ms
Computed 32 P flows in 739 ms.
Exported basis to /tmp/petrispot-output-4434475961200752330.kers
Total runtime 859 ms.
[2026-05-28 08:16:04] [INFO ] Implicit Places using invariants in 13679 ms returned []
Implicit Place search using SMT only with invariants took 13682 ms to find 0 implicit places.
Running 32947 sub problems to find dead transitions.
[2026-05-28 08:16:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 32947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 177/33126 variables, and 13 constraints, problems are : Problem set: 0 solved, 32947 unsolved in 30852 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/178 constraints, PredecessorRefiner: 32947/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32947 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 32947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 177/33126 variables, and 13 constraints, problems are : Problem set: 0 solved, 32947 unsolved in 30761 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/178 constraints, PredecessorRefiner: 32821/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 180605ms problems are : Problem set: 0 solved, 32947 unsolved
Search for dead transitions found 0 dead transitions in 180888ms
Starting structural reductions in LTL mode, iteration 1 : 178/179 places, 32948/37044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195584 ms. Remains : 178/179 places, 32948/37044 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F((p0||X(p1)))&&p2)))))'
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLFireability-00
Product exploration timeout after 32480 steps with 0 reset in 10002 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 4 ms.
FORMULA ErlangenMainframeV0-PT-1301-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1301-LTLFireability-00 finished in 206211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||F(G(!p1))) U X(p2)))'
Support contains 33 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 37044/37044 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 178 transition count 32948
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 178 transition count 32948
Applied a total of 2 rules in 628 ms. Remains 178 /179 variables (removed 1) and now considering 32948/37044 (removed 4096) transitions.
[2026-05-28 08:19:16] [INFO ] Invariant cache hit.
[2026-05-28 08:19:30] [INFO ] Implicit Places using invariants in 14590 ms returned []
Implicit Place search using SMT only with invariants took 14592 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 178/179 places, 32948/37044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15222 ms. Remains : 178/179 places, 32948/37044 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||F(G(!p1))) U X(p2)))'
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p1), p1]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLFireability-01
Product exploration timeout after 32870 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 120 steps with 0 reset with depth 121 and stack size 121 in 17 ms.
FORMULA ErlangenMainframeV0-PT-1301-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1301-LTLFireability-01 finished in 25598 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)) U (F(p2)&&G(!p3)))))'
Support contains 26 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 37044/37044 transitions.
Graph (trivial) has 90 edges and 179 vertex of which 4 / 179 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 176 transition count 37029
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 164 transition count 37029
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 25 place count 164 transition count 37009
Deduced a syphon composed of 20 places in 53 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 65 place count 144 transition count 37009
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 81 place count 128 transition count 24705
Ensure Unique test removed 13 places
Iterating global reduction 2 with 29 rules applied. Total rules applied 110 place count 115 transition count 24705
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 112 place count 115 transition count 24703
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 14 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 196 place count 73 transition count 24661
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 198 place count 72 transition count 24672
Partial Post-agglomeration rule applied 11 times.
Drop transitions (Partial Post agglomeration) removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 209 place count 72 transition count 24672
Applied a total of 209 rules in 7122 ms. Remains 72 /179 variables (removed 107) and now considering 24672/37044 (removed 12372) transitions.
[2026-05-28 08:19:48] [INFO ] Flow matrix only has 24653 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11036353443185525440.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17173696860630925697.kers'
[2026-05-28 08:19:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11036353443185525440.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17173696860630925697.kers]
Normalized transition count is 24652 out of 24653 initially.
Culled 0 columns in 144 ms.
// Phase 1: matrix 24652 rows 72 cols 737596 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-28 08:19:49] [INFO ] Computed 19 invariants in 414 ms
Computed 19 P flows in 415 ms.
Exported basis to /tmp/petrispot-output-17173696860630925697.kers
Total runtime 505 ms.
[2026-05-28 08:19:52] [INFO ] Implicit Places using invariants in 4243 ms returned []
Implicit Place search using SMT only with invariants took 4244 ms to find 0 implicit places.
Running 24670 sub problems to find dead transitions.
[2026-05-28 08:19:52] [INFO ] Flow matrix only has 24653 transitions (discarded 19 similar events)
[2026-05-28 08:19:52] [INFO ] Invariant cache hit.
[2026-05-28 08:19:53] [INFO ] State equation strengthened by 11 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 71/24725 variables, and 0 constraints, problems are : Problem set: 0 solved, 24670 unsolved in 30540 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, State Equation: 0/72 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 24670/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24670 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 71/24725 variables, and 0 constraints, problems are : Problem set: 0 solved, 24670 unsolved in 30657 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, State Equation: 0/72 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 24639/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 138849ms problems are : Problem set: 0 solved, 24670 unsolved
Search for dead transitions found 0 dead transitions in 138983ms
Starting structural reductions in SI_LTL mode, iteration 1 : 72/179 places, 24672/37044 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150402 ms. Remains : 72/179 places, 24672/37044 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)) U (F(p2)&&G(!p3)))))'
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p2) p3), (OR (NOT p1) (NOT p0)), (OR (NOT p2) p3), (NOT p2), p3, (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLFireability-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1301-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1301-LTLFireability-02 finished in 150782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 15 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 37044/37044 transitions.
Graph (trivial) has 101 edges and 179 vertex of which 4 / 179 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 176 transition count 37029
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 164 transition count 37029
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 25 place count 164 transition count 37008
Deduced a syphon composed of 21 places in 55 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 67 place count 143 transition count 37008
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 83 place count 127 transition count 24704
Ensure Unique test removed 13 places
Iterating global reduction 2 with 29 rules applied. Total rules applied 112 place count 114 transition count 24704
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 114 transition count 24702
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 113 transition count 16510
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 113 transition count 16510
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 9 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 204 place count 69 transition count 16466
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 68 transition count 16477
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 68 transition count 16476
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 216 place count 68 transition count 16476
Applied a total of 216 rules in 31413 ms. Remains 68 /179 variables (removed 111) and now considering 16476/37044 (removed 20568) transitions.
[2026-05-28 08:22:43] [INFO ] Flow matrix only has 16457 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15401322162596376853.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12528744320537653193.kers'
[2026-05-28 08:22:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15401322162596376853.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12528744320537653193.kers]
Normalized transition count is 16456 out of 16457 initially.
Culled 0 columns in 93 ms.
// Phase 1: matrix 16456 rows 68 cols 475440 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-28 08:22:43] [INFO ] Computed 19 invariants in 289 ms
Computed 19 P flows in 289 ms.
Exported basis to /tmp/petrispot-output-12528744320537653193.kers
Total runtime 361 ms.
[2026-05-28 08:22:53] [INFO ] Implicit Places using invariants in 10313 ms returned []
Implicit Place search using SMT only with invariants took 10324 ms to find 0 implicit places.
Running 16474 sub problems to find dead transitions.
[2026-05-28 08:22:54] [INFO ] Flow matrix only has 16457 transitions (discarded 19 similar events)
[2026-05-28 08:22:54] [INFO ] Invariant cache hit.
[2026-05-28 08:22:54] [INFO ] State equation strengthened by 8203 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 67/16525 variables, and 0 constraints, problems are : Problem set: 0 solved, 16474 unsolved in 30365 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, State Equation: 0/68 constraints, ReadFeed: 0/8203 constraints, PredecessorRefiner: 16474/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16474 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 67/16525 variables, and 0 constraints, problems are : Problem set: 0 solved, 16474 unsolved in 30437 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, State Equation: 0/68 constraints, ReadFeed: 0/8203 constraints, PredecessorRefiner: 16437/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 100463ms problems are : Problem set: 0 solved, 16474 unsolved
Search for dead transitions found 0 dead transitions in 100603ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/179 places, 16476/37044 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142394 ms. Remains : 68/179 places, 16476/37044 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1301-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1301-LTLFireability-03 finished in 142560 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)&&(!p1 U (G(!p1)||(X(X(F(!p3)))&&p2)))) U X(p0)))'
Support contains 30 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 37044/37044 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 165 transition count 24757
Ensure Unique test removed 13 places
Iterating global reduction 0 with 27 rules applied. Total rules applied 41 place count 152 transition count 24757
Applied a total of 41 rules in 3305 ms. Remains 152 /179 variables (removed 27) and now considering 24757/37044 (removed 12287) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14219843444810598388.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8270318946420853457.kers'
[2026-05-28 08:24:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14219843444810598388.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8270318946420853457.kers]
Culled 0 columns in 74 ms.
// Phase 1: matrix 24757 rows 152 cols 418367 entries
Finished phase 1 with 133 SingleSign rule and 0 generalized
[2026-05-28 08:24:38] [INFO ] Computed 19 invariants in 381 ms
Computed 19 P flows in 383 ms.
Exported basis to /tmp/petrispot-output-8270318946420853457.kers
Total runtime 459 ms.
[2026-05-28 08:24:38] [INFO ] Implicit Places using invariants in 617 ms returned []
Implicit Place search using SMT only with invariants took 619 ms to find 0 implicit places.
Running 24756 sub problems to find dead transitions.
[2026-05-28 08:24:38] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 151/24909 variables, and 0 constraints, problems are : Problem set: 0 solved, 24756 unsolved in 30679 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, State Equation: 0/152 constraints, PredecessorRefiner: 24756/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24756 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 151/24909 variables, and 0 constraints, problems are : Problem set: 0 solved, 24756 unsolved in 30670 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, State Equation: 0/152 constraints, PredecessorRefiner: 24616/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 147896ms problems are : Problem set: 0 solved, 24756 unsolved
Search for dead transitions found 0 dead transitions in 148036ms
Starting structural reductions in LTL mode, iteration 1 : 152/179 places, 24757/37044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152014 ms. Remains : 152/179 places, 24757/37044 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)&&(!p1 U (G(!p1)||(X(X(F(!p3)))&&p2)))) U X(p0)))'
Stuttering acceptance computed with spot in 533 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3)), (NOT p0), (AND p3 p1 (NOT p0)), (AND (NOT p0) p3), true, p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (AND p3 p1), p3, (AND p3 p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLFireability-04
Product exploration timeout after 37580 steps with 0 reset in 10002 ms.
Stack based approach found an accepted trace after 139 steps with 0 reset with depth 140 and stack size 140 in 17 ms.
FORMULA ErlangenMainframeV0-PT-1301-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1301-LTLFireability-04 finished in 162750 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(p0))&&F(p1))))'
Support contains 29 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 37044/37044 transitions.
Graph (trivial) has 101 edges and 179 vertex of which 4 / 179 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 176 transition count 37029
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 164 transition count 37029
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 25 place count 164 transition count 37008
Deduced a syphon composed of 21 places in 55 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 67 place count 143 transition count 37008
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 140 transition count 32895
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 140 transition count 32895
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 140 transition count 32893
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 13 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 167 place count 94 transition count 32847
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 93 transition count 32858
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 175 place count 93 transition count 32858
Applied a total of 175 rules in 6787 ms. Remains 93 /179 variables (removed 86) and now considering 32858/37044 (removed 4186) transitions.
[2026-05-28 08:27:24] [INFO ] Flow matrix only has 32839 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18289775881800529612.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5319873381867067179.kers'
[2026-05-28 08:27:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18289775881800529612.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5319873381867067179.kers]
Normalized transition count is 32838 out of 32839 initially.
Culled 0 columns in 255 ms.
// Phase 1: matrix 32838 rows 93 cols 942384 entries
Finished phase 1 with 59 SingleSign rule and 2 generalized
[2026-05-28 08:27:25] [INFO ] Computed 32 invariants in 791 ms
Computed 32 P flows in 791 ms.
Exported basis to /tmp/petrispot-output-5319873381867067179.kers
Total runtime 916 ms.
[2026-05-28 08:27:44] [INFO ] Implicit Places using invariants in 20242 ms returned []
Implicit Place search using SMT only with invariants took 20243 ms to find 0 implicit places.
Running 32856 sub problems to find dead transitions.
[2026-05-28 08:27:44] [INFO ] Flow matrix only has 32839 transitions (discarded 19 similar events)
[2026-05-28 08:27:44] [INFO ] Invariant cache hit.
[2026-05-28 08:27:45] [INFO ] State equation strengthened by 12299 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 32856 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 92/32932 variables, and 13 constraints, problems are : Problem set: 0 solved, 32856 unsolved in 30690 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/93 constraints, ReadFeed: 0/12299 constraints, PredecessorRefiner: 32856/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 32856 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 92/32932 variables, and 13 constraints, problems are : Problem set: 0 solved, 32856 unsolved in 30576 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/93 constraints, ReadFeed: 0/12299 constraints, PredecessorRefiner: 32822/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 176184ms problems are : Problem set: 0 solved, 32856 unsolved
Search for dead transitions found 0 dead transitions in 176379ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/179 places, 32858/37044 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203470 ms. Remains : 93/179 places, 32858/37044 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(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1301-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1301-LTLFireability-06 finished in 203726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)&&F((!p1 U (p2||G(!p1))))))'
Support contains 29 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 37044/37044 transitions.
Graph (trivial) has 101 edges and 179 vertex of which 4 / 179 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 176 transition count 37029
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 164 transition count 37029
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 25 place count 164 transition count 37008
Deduced a syphon composed of 21 places in 53 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 67 place count 143 transition count 37008
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 140 transition count 32895
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 140 transition count 32895
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 140 transition count 32893
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 12 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 165 place count 95 transition count 32848
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 167 place count 94 transition count 32859
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 174 place count 94 transition count 32859
Applied a total of 174 rules in 8767 ms. Remains 94 /179 variables (removed 85) and now considering 32859/37044 (removed 4185) transitions.
[2026-05-28 08:30:49] [INFO ] Flow matrix only has 32840 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1984241899815985790.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14771830075536541533.kers'
[2026-05-28 08:30:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1984241899815985790.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14771830075536541533.kers]
Normalized transition count is 32839 out of 32840 initially.
Culled 0 columns in 248 ms.
// Phase 1: matrix 32839 rows 94 cols 942386 entries
Finished phase 1 with 60 SingleSign rule and 2 generalized
[2026-05-28 08:30:50] [INFO ] Computed 32 invariants in 764 ms
Computed 32 P flows in 764 ms.
Exported basis to /tmp/petrispot-output-14771830075536541533.kers
Total runtime 886 ms.
[2026-05-28 08:31:08] [INFO ] Implicit Places using invariants in 18877 ms returned []
Implicit Place search using SMT only with invariants took 18884 ms to find 0 implicit places.
Running 32857 sub problems to find dead transitions.
[2026-05-28 08:31:09] [INFO ] Flow matrix only has 32840 transitions (discarded 19 similar events)
[2026-05-28 08:31:09] [INFO ] Invariant cache hit.
[2026-05-28 08:31:09] [INFO ] State equation strengthened by 12299 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 32857 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 93/32934 variables, and 13 constraints, problems are : Problem set: 0 solved, 32857 unsolved in 30886 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/94 constraints, ReadFeed: 0/12299 constraints, PredecessorRefiner: 32857/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32857 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 32857 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 93/32934 variables, and 13 constraints, problems are : Problem set: 0 solved, 32857 unsolved in 30715 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/94 constraints, ReadFeed: 0/12299 constraints, PredecessorRefiner: 32822/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 179548ms problems are : Problem set: 0 solved, 32857 unsolved
Search for dead transitions found 0 dead transitions in 179722ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/179 places, 32859/37044 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 207434 ms. Remains : 94/179 places, 32859/37044 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)&&F((!p1 U (p2||G(!p1))))))'
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLFireability-07
Product exploration timeout after 17230 steps with 0 reset in 10002 ms.
Product exploration timeout after 18850 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 11 factoid took 61 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 28383 ms. (1 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2325 ms. (17 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 138813 steps, run timeout after 27002 ms. (steps per millisecond=5 ) properties seen :0 out of 1
Probabilistic random walk after 138813 steps, saw 20882 distinct states, run finished after 27002 ms. (steps per millisecond=5 ) properties seen :0
[2026-05-28 08:35:06] [INFO ] Flow matrix only has 32840 transitions (discarded 19 similar events)
[2026-05-28 08:35:06] [INFO ] Invariant cache hit.
[2026-05-28 08:35:06] [INFO ] State equation strengthened by 12299 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/31 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/48 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 46/94 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5340ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 32859/32859 transitions.
Graph (trivial) has 35 edges and 94 vertex of which 2 / 94 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 93 transition count 32847
Deduced a syphon composed of 8 places in 13 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 85 transition count 32847
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 19 place count 83 transition count 16455
Iterating global reduction 0 with 2 rules applied. Total rules applied 21 place count 83 transition count 16455
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 83 transition count 16454
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 82 transition count 16457
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 82 transition count 16456
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 82 transition count 16454
Free-agglomeration rule applied 18 times.
Iterating global reduction 2 with 18 rules applied. Total rules applied 45 place count 82 transition count 16436
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 1197 edges and 64 vertex of which 62 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.112 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 36 rules applied. Total rules applied 81 place count 62 transition count 16419
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 85 place count 62 transition count 16415
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 92 place count 62 transition count 16408
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 62 transition count 16407
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 98 place count 61 transition count 16403
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 99 place count 60 transition count 16402
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 101 place count 58 transition count 16402
Applied a total of 101 rules in 208871 ms. Remains 58 /94 variables (removed 36) and now considering 16402/32859 (removed 16457) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208872 ms. Remains : 58/94 places, 16402/32859 transitions.
Knowledge based reduction with 11 factoid took 60 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Knowledge-based reduction took 251537 ms.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Support contains 14 out of 94 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 32859/32859 transitions.
Applied a total of 0 rules in 1360 ms. Remains 94 /94 variables (removed 0) and now considering 32859/32859 (removed 0) transitions.
[2026-05-28 08:38:41] [INFO ] Flow matrix only has 32840 transitions (discarded 19 similar events)
[2026-05-28 08:38:41] [INFO ] Invariant cache hit.
[2026-05-28 08:39:00] [INFO ] Implicit Places using invariants in 18323 ms returned []
Implicit Place search using SMT only with invariants took 18324 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19687 ms. Remains : 94/94 places, 32859/32859 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 3 factoid took 50 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 27391 ms. (1 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1667 ms. (23 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 141451 steps, run timeout after 24001 ms. (steps per millisecond=5 ) properties seen :0 out of 1
Probabilistic random walk after 141451 steps, saw 21220 distinct states, run finished after 24001 ms. (steps per millisecond=5 ) properties seen :0
[2026-05-28 08:39:33] [INFO ] Flow matrix only has 32840 transitions (discarded 19 similar events)
[2026-05-28 08:39:33] [INFO ] Invariant cache hit.
[2026-05-28 08:39:34] [INFO ] State equation strengthened by 12299 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/31 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/48 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 46/94 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5325ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 32859/32859 transitions.
Graph (trivial) has 35 edges and 94 vertex of which 2 / 94 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 93 transition count 32847
Deduced a syphon composed of 8 places in 14 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 85 transition count 32847
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 19 place count 83 transition count 16455
Iterating global reduction 0 with 2 rules applied. Total rules applied 21 place count 83 transition count 16455
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 83 transition count 16454
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 82 transition count 16457
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 82 transition count 16456
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 82 transition count 16454
Free-agglomeration rule applied 18 times.
Iterating global reduction 2 with 18 rules applied. Total rules applied 45 place count 82 transition count 16436
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 1197 edges and 64 vertex of which 62 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.111 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 36 rules applied. Total rules applied 81 place count 62 transition count 16419
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 85 place count 62 transition count 16415
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 92 place count 62 transition count 16408
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 62 transition count 16407
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 98 place count 61 transition count 16403
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 99 place count 60 transition count 16402
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 101 place count 58 transition count 16402
Applied a total of 101 rules in 198857 ms. Remains 58 /94 variables (removed 36) and now considering 16402/32859 (removed 16457) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198857 ms. Remains : 58/94 places, 16402/32859 transitions.
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Knowledge-based reduction took 238015 ms.
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Product exploration timeout after 19610 steps with 0 reset in 10004 ms.
Product exploration timeout after 19930 steps with 0 reset in 10004 ms.
Built C files in :
/tmp/ltsmin17365437236796393633
[2026-05-28 08:43:18] [INFO ] Too many transitions (32859) to apply POR reductions. Disabling POR matrices.
[2026-05-28 08:43:19] [INFO ] Built C files in 1059ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17365437236796393633
Running compilation step : cd /tmp/ltsmin17365437236796393633;'/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/ltsmin17365437236796393633;'/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/ltsmin17365437236796393633;'/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 14 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 32859/32859 transitions.
Graph (trivial) has 35 edges and 94 vertex of which 2 / 94 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 93 transition count 32850
Deduced a syphon composed of 8 places in 13 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 85 transition count 32850
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 19 place count 83 transition count 16458
Iterating global reduction 0 with 2 rules applied. Total rules applied 21 place count 83 transition count 16458
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 83 transition count 16457
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 83 transition count 16456
Applied a total of 23 rules in 93612 ms. Remains 83 /94 variables (removed 11) and now considering 16456/32859 (removed 16403) transitions.
[2026-05-28 08:44:56] [INFO ] Flow matrix only has 16438 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-13137445113842349110.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15271062987161671779.kers'
[2026-05-28 08:44:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13137445113842349110.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15271062987161671779.kers]
Normalized transition count is 16437 out of 16438 initially.
Culled 0 columns in 76 ms.
// Phase 1: matrix 16437 rows 83 cols 458962 entries
Finished phase 1 with 49 SingleSign rule and 2 generalized
[2026-05-28 08:44:56] [INFO ] Computed 32 invariants in 325 ms
Computed 32 P flows in 326 ms.
Exported basis to /tmp/petrispot-output-15271062987161671779.kers
Total runtime 398 ms.
[2026-05-28 08:45:07] [INFO ] Implicit Places using invariants in 11870 ms returned []
Implicit Place search using SMT only with invariants took 11874 ms to find 0 implicit places.
Running 16454 sub problems to find dead transitions.
[2026-05-28 08:45:08] [INFO ] Flow matrix only has 16438 transitions (discarded 18 similar events)
[2026-05-28 08:45:08] [INFO ] Invariant cache hit.
[2026-05-28 08:45:08] [INFO ] State equation strengthened by 8214 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 16454 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 82/16521 variables, and 13 constraints, problems are : Problem set: 0 solved, 16454 unsolved in 30294 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/83 constraints, ReadFeed: 0/8214 constraints, PredecessorRefiner: 16454/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 16454 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 82/16521 variables, and 13 constraints, problems are : Problem set: 0 solved, 16454 unsolved in 30376 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/83 constraints, ReadFeed: 0/8214 constraints, PredecessorRefiner: 16427/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 101005ms problems are : Problem set: 0 solved, 16454 unsolved
Search for dead transitions found 0 dead transitions in 101094ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/94 places, 16456/32859 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 206614 ms. Remains : 83/94 places, 16456/32859 transitions.
Built C files in :
/tmp/ltsmin17986569725572858272
[2026-05-28 08:46:49] [INFO ] Too many transitions (16456) to apply POR reductions. Disabling POR matrices.
[2026-05-28 08:46:49] [INFO ] Built C files in 706ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17986569725572858272
Running compilation step : cd /tmp/ltsmin17986569725572858272;'/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/ltsmin17986569725572858272;'/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/ltsmin17986569725572858272;'/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-28 08:47:00] [INFO ] Flatten gal took : 3465 ms
[2026-05-28 08:47:03] [INFO ] Flatten gal took : 3450 ms
[2026-05-28 08:47:04] [INFO ] Time to serialize gal into /tmp/LTL4185203317754272601.gal : 607 ms
[2026-05-28 08:47:04] [INFO ] Time to serialize properties into /tmp/LTL14502946320140023615.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4185203317754272601.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8731939852914446805.hoa' '-atoms' '/tmp/LTL14502946320140023615.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Detected timeout of ITS tools.
[2026-05-28 08:47:30] [INFO ] Flatten gal took : 7398 ms
[2026-05-28 08:47:37] [INFO ] Flatten gal took : 6535 ms
[2026-05-28 08:47:38] [INFO ] Time to serialize gal into /tmp/LTL2095760946186884981.gal : 852 ms
[2026-05-28 08:47:38] [INFO ] Time to serialize properties into /tmp/LTL772309091597590209.ltl : 4 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/LTL2095760946186884981.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL772309091597590209.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...274
Read 1 LTL properties
Detected timeout of ITS tools.
[2026-05-28 08:48:01] [INFO ] Flatten gal took : 7311 ms
[2026-05-28 08:48:01] [INFO ] Applying decomposition
[2026-05-28 08:48:07] [INFO ] Flatten gal took : 6463 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/graph6243710156776871541.txt' '-o' '/tmp/graph6243710156776871541.bin' '-w' '/tmp/graph6243710156776871541.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6243710156776871541.bin' '-l' '-1' '-v' '-w' '/tmp/graph6243710156776871541.weights' '-q' '0' '-e' '0.001'
[2026-05-28 08:48:27] [INFO ] Decomposing Gal with order
[2026-05-28 08:48:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 08:48:40] [INFO ] Removed a total of 534585 redundant transitions.
[2026-05-28 08:48:42] [INFO ] Flatten gal took : 10824 ms
[2026-05-28 08:48:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 8865 ms.
[2026-05-28 08:48:52] [INFO ] Time to serialize gal into /tmp/LTL4783912099838398767.gal : 345 ms
[2026-05-28 08:48:52] [INFO ] Time to serialize properties into /tmp/LTL14967582468488107330.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/LTL4783912099838398767.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14967582468488107330.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
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-1301-LTLFireability-07 finished in 1106781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 14 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 37044/37044 transitions.
Graph (trivial) has 117 edges and 179 vertex of which 6 / 179 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 175 transition count 37028
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 163 transition count 37028
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 25 place count 163 transition count 37006
Deduced a syphon composed of 22 places in 95 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 69 place count 141 transition count 37006
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 137 transition count 20601
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 137 transition count 20601
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 137 transition count 20598
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 136 transition count 16502
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 136 transition count 16502
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 5 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 186 place count 84 transition count 16450
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 188 place count 83 transition count 16457
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 189 place count 83 transition count 16456
Applied a total of 189 rules in 88543 ms. Remains 83 /179 variables (removed 96) and now considering 16456/37044 (removed 20588) transitions.
[2026-05-28 08:50:36] [INFO ] Flow matrix only has 16438 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-6169225681026292269.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14348299408991524170.kers'
[2026-05-28 08:50:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6169225681026292269.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14348299408991524170.kers]
Normalized transition count is 16437 out of 16438 initially.
Culled 0 columns in 78 ms.
// Phase 1: matrix 16437 rows 83 cols 458962 entries
Finished phase 1 with 49 SingleSign rule and 2 generalized
[2026-05-28 08:50:36] [INFO ] Computed 32 invariants in 282 ms
Computed 32 P flows in 283 ms.
Exported basis to /tmp/petrispot-output-14348299408991524170.kers
Total runtime 341 ms.
[2026-05-28 08:50:48] [INFO ] Implicit Places using invariants in 11864 ms returned []
Implicit Place search using SMT only with invariants took 11865 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/179 places, 16456/37044 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100410 ms. Remains : 83/179 places, 16456/37044 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1301-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1301-LTLFireability-08 finished in 100567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X(p0))||G(p1))))))'
Support contains 29 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 37044/37044 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 178 transition count 32948
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 178 transition count 32948
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 177 transition count 24756
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 177 transition count 24756
Applied a total of 4 rules in 1163 ms. Remains 177 /179 variables (removed 2) and now considering 24756/37044 (removed 12288) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-262681702136156416.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8871271800926514884.kers'
[2026-05-28 08:50:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-262681702136156416.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8871271800926514884.kers]
Culled 0 columns in 121 ms.
// Phase 1: matrix 24756 rows 177 cols 721456 entries
Finished phase 1 with 143 SingleSign rule and 2 generalized
[2026-05-28 08:50:50] [INFO ] Computed 32 invariants in 511 ms
Computed 32 P flows in 512 ms.
Exported basis to /tmp/petrispot-output-8871271800926514884.kers
Total runtime 597 ms.
[2026-05-28 08:51:01] [INFO ] Implicit Places using invariants in 12076 ms returned []
Implicit Place search using SMT only with invariants took 12080 ms to find 0 implicit places.
Running 24755 sub problems to find dead transitions.
[2026-05-28 08:51:01] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 24755 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 176/24933 variables, and 13 constraints, problems are : Problem set: 0 solved, 24755 unsolved in 30577 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/177 constraints, PredecessorRefiner: 24755/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24755 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 24755 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 176/24933 variables, and 13 constraints, problems are : Problem set: 0 solved, 24755 unsolved in 30654 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/177 constraints, PredecessorRefiner: 24629/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 136758ms problems are : Problem set: 0 solved, 24755 unsolved
Search for dead transitions found 0 dead transitions in 136894ms
Starting structural reductions in LTL mode, iteration 1 : 177/179 places, 24756/37044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150185 ms. Remains : 177/179 places, 24756/37044 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X(p0))||G(p1))))))'
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLFireability-11
Product exploration explored 100000 steps with 16679 reset in 1528 ms.
Product exploration explored 100000 steps with 16664 reset in 1377 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge based reduction with 2 factoid took 55 ms. Reduced automaton from 9 states, 14 edges and 2 AP (stutter sensitive) to 9 states, 14 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 10945 ms. (3 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 609 ms. (65 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 791 ms. (50 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 595 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1376 ms. (29 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 628 ms. (63 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 644 ms. (62 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 65816 steps, run timeout after 12002 ms. (steps per millisecond=5 ) properties seen :0 out of 6
Probabilistic random walk after 65816 steps, saw 46874 distinct states, run finished after 12002 ms. (steps per millisecond=5 ) properties seen :0
[2026-05-28 08:53:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 99/128 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 37/165 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 12/177 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 5242ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 24756/24756 transitions.
Graph (trivial) has 101 edges and 177 vertex of which 4 / 177 are part of one of the 2 SCC in 1 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 175 transition count 24739
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 162 transition count 24739
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 27 place count 162 transition count 24717
Deduced a syphon composed of 22 places in 35 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 71 place count 140 transition count 24717
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 138 transition count 24700
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 138 transition count 24700
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 138 transition count 24698
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 10 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 167 place count 93 transition count 24653
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 171 place count 91 transition count 24666
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 181 place count 91 transition count 24656
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 193 place count 81 transition count 24654
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 194 place count 81 transition count 24654
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 199 place count 81 transition count 24654
Applied a total of 199 rules in 8123 ms. Remains 81 /177 variables (removed 96) and now considering 24654/24756 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8125 ms. Remains : 81/177 places, 24654/24756 transitions.
RANDOM walk for 40000 steps (8 resets) in 18669 ms. (2 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1154 ms. (34 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2869 ms. (13 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1180 ms. (33 steps per ms) remains 3/3 properties
[2026-05-28 08:53:58] [INFO ] Flow matrix only has 24634 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9092745395650983681.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16685344537237595856.kers'
[2026-05-28 08:53:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9092745395650983681.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16685344537237595856.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 116 ms.
// Phase 1: matrix 24634 rows 80 cols 704762 entries
Finished phase 1 with 47 SingleSign rule and 2 generalized
[2026-05-28 08:53:59] [INFO ] Computed 32 invariants in 539 ms
Computed 32 P flows in 540 ms.
Exported basis to /tmp/petrispot-output-16685344537237595856.kers
Total runtime 630 ms.
[2026-05-28 08:53:59] [INFO ] State equation strengthened by 8221 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/48 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/55 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 26/81 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 24634/24715 variables, 81/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24715 variables, 8221/8334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24715 variables, 0/8334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/24715 variables, 0/8334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24715/24715 variables, and 8334 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27338 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 81/81 constraints, ReadFeed: 8221/8221 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/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 19/48 variables, 15/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/55 variables, 4/19 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/81 variables, 13/32 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 24634/24715 variables, 81/113 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24715 variables, 8221/8334 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24715 variables, 0/8334 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/24715 variables, 0/8334 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24715/24715 variables, and 8334 constraints, problems are : Problem set: 1 solved, 2 unsolved in 34048 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 81/81 constraints, ReadFeed: 8221/8221 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62448ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 25 steps, including 0 resets, run visited all 2 properties in 32 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 55 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 9 states, 14 edges and 2 AP (stutter sensitive) to 9 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 406 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Knowledge-based reduction took 99752 ms.
Stuttering acceptance computed with spot in 420 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 29 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 24756/24756 transitions.
Applied a total of 0 rules in 240 ms. Remains 177 /177 variables (removed 0) and now considering 24756/24756 (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-12767228508014598827.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6983190865964190533.kers'
[2026-05-28 08:55:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12767228508014598827.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6983190865964190533.kers]
Culled 0 columns in 208 ms.
// Phase 1: matrix 24756 rows 177 cols 721456 entries
Finished phase 1 with 143 SingleSign rule and 2 generalized
[2026-05-28 08:55:03] [INFO ] Computed 32 invariants in 734 ms
Computed 32 P flows in 735 ms.
Exported basis to /tmp/petrispot-output-6983190865964190533.kers
Total runtime 881 ms.
[2026-05-28 08:55:17] [INFO ] Implicit Places using invariants in 15268 ms returned []
Implicit Place search using SMT only with invariants took 15270 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 15517 ms. Remains : 177/177 places, 24756/24756 transitions.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 9 states, 13 edges and 2 AP (stutter sensitive) to 9 states, 13 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 10233 ms. (3 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 515 ms. (77 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 779 ms. (51 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 709 ms. (56 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 51485 steps, run timeout after 9001 ms. (steps per millisecond=5 ) properties seen :0 out of 3
Probabilistic random walk after 51485 steps, saw 37193 distinct states, run finished after 9001 ms. (steps per millisecond=5 ) properties seen :0
[2026-05-28 08:55:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 99/128 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 37/165 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 12/177 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 5208ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 24756/24756 transitions.
Graph (trivial) has 101 edges and 177 vertex of which 4 / 177 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 175 transition count 24739
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 162 transition count 24739
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 27 place count 162 transition count 24717
Deduced a syphon composed of 22 places in 35 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 71 place count 140 transition count 24717
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 138 transition count 24700
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 138 transition count 24700
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 138 transition count 24698
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 9 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 167 place count 93 transition count 24653
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
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 171 place count 91 transition count 24666
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 181 place count 91 transition count 24656
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 193 place count 81 transition count 24654
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 194 place count 81 transition count 24654
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 199 place count 81 transition count 24654
Applied a total of 199 rules in 7774 ms. Remains 81 /177 variables (removed 96) and now considering 24654/24756 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7775 ms. Remains : 81/177 places, 24654/24756 transitions.
RANDOM walk for 40000 steps (8 resets) in 17469 ms. (2 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1122 ms. (35 steps per ms) remains 1/1 properties
[2026-05-28 08:55:48] [INFO ] Flow matrix only has 24634 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13387606514468193849.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1874396262236644071.kers'
[2026-05-28 08:55:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13387606514468193849.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1874396262236644071.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 119 ms.
// Phase 1: matrix 24634 rows 80 cols 704762 entries
Finished phase 1 with 47 SingleSign rule and 2 generalized
[2026-05-28 08:55:49] [INFO ] Computed 32 invariants in 593 ms
Computed 32 P flows in 594 ms.
Exported basis to /tmp/petrispot-output-1874396262236644071.kers
Total runtime 681 ms.
[2026-05-28 08:55:49] [INFO ] State equation strengthened by 8221 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/31 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/42 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/81 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 24715/24715 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 17922 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 81/81 constraints, ReadFeed: 0/8221 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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/31 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/42 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/81 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 24715/24715 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18085 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 81/81 constraints, ReadFeed: 0/8221 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37104ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=1 )
Parikh walk visited 1 properties in 31 ms.
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 9 states, 13 edges and 2 AP (stutter sensitive) to 9 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 413 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Knowledge-based reduction took 68727 ms.
Stuttering acceptance computed with spot in 433 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 430 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 16704 reset in 1161 ms.
Product exploration explored 100000 steps with 16691 reset in 1074 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/ltsmin17142877182146709785
[2026-05-28 08:56:30] [INFO ] Built C files in 886ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17142877182146709785
Running compilation step : cd /tmp/ltsmin17142877182146709785;'/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/ltsmin17142877182146709785;'/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/ltsmin17142877182146709785;'/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 29 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 24756/24756 transitions.
Applied a total of 0 rules in 157 ms. Remains 177 /177 variables (removed 0) and now considering 24756/24756 (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-12273460637087309817.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16917425662620923772.kers'
[2026-05-28 08:56:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12273460637087309817.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16917425662620923772.kers]
Culled 0 columns in 210 ms.
// Phase 1: matrix 24756 rows 177 cols 721456 entries
Finished phase 1 with 143 SingleSign rule and 2 generalized
[2026-05-28 08:56:34] [INFO ] Computed 32 invariants in 681 ms
Computed 32 P flows in 682 ms.
Exported basis to /tmp/petrispot-output-16917425662620923772.kers
Total runtime 769 ms.
[2026-05-28 08:56:49] [INFO ] Implicit Places using invariants in 15238 ms returned []
Implicit Place search using SMT only with invariants took 15241 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 15400 ms. Remains : 177/177 places, 24756/24756 transitions.
Built C files in :
/tmp/ltsmin8743900943652853223
[2026-05-28 08:56:49] [INFO ] Built C files in 635ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8743900943652853223
Running compilation step : cd /tmp/ltsmin8743900943652853223;'/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/ltsmin8743900943652853223;'/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/ltsmin8743900943652853223;'/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-28 08:57:01] [INFO ] Flatten gal took : 4857 ms
[2026-05-28 08:57:05] [INFO ] Flatten gal took : 3912 ms
[2026-05-28 08:57:06] [INFO ] Time to serialize gal into /tmp/LTL12207702876109131782.gal : 657 ms
[2026-05-28 08:57:06] [INFO ] Time to serialize properties into /tmp/LTL7478575261843711581.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/LTL12207702876109131782.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12017207568899245581.hoa' '-atoms' '/tmp/LTL7478575261843711581.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Detected timeout of ITS tools.
[2026-05-28 08:57:30] [INFO ] Flatten gal took : 4891 ms
[2026-05-28 08:57:34] [INFO ] Flatten gal took : 4075 ms
[2026-05-28 08:57:35] [INFO ] Time to serialize gal into /tmp/LTL9751711351415180934.gal : 693 ms
[2026-05-28 08:57:35] [INFO ] Time to serialize properties into /tmp/LTL16007464452579771524.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/LTL9751711351415180934.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16007464452579771524.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-28 08:57:55] [INFO ] Flatten gal took : 4399 ms
[2026-05-28 08:57:55] [INFO ] Applying decomposition
[2026-05-28 08:57:59] [INFO ] Flatten gal took : 4506 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/graph9361181136413009421.txt' '-o' '/tmp/graph9361181136413009421.bin' '-w' '/tmp/graph9361181136413009421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9361181136413009421.bin' '-l' '-1' '-v' '-w' '/tmp/graph9361181136413009421.weights' '-q' '0' '-e' '0.001'
[2026-05-28 08:58:13] [INFO ] Decomposing Gal with order
[2026-05-28 08:58:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 08:58:23] [INFO ] Removed a total of 413830 redundant transitions.
[2026-05-28 08:58:24] [INFO ] Flatten gal took : 7993 ms
[2026-05-28 08:58:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 6516 ms.
[2026-05-28 08:58:31] [INFO ] Time to serialize gal into /tmp/LTL1217911504667588344.gal : 249 ms
[2026-05-28 08:58:31] [INFO ] Time to serialize properties into /tmp/LTL3892500959321854382.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/LTL1217911504667588344.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3892500959321854382.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
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-1301-LTLFireability-11 finished in 478432 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(p1)))))'
Support contains 29 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 37044/37044 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 178 transition count 32948
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 178 transition count 32948
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 177 transition count 24756
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 177 transition count 24756
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 176 transition count 24754
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 176 transition count 24754
Applied a total of 6 rules in 1542 ms. Remains 176 /179 variables (removed 3) and now considering 24754/37044 (removed 12290) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7317503927592533041.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12585393517042015466.kers'
[2026-05-28 08:58:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7317503927592533041.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12585393517042015466.kers]
Culled 0 columns in 121 ms.
// Phase 1: matrix 24754 rows 176 cols 721452 entries
Finished phase 1 with 142 SingleSign rule and 2 generalized
[2026-05-28 08:58:49] [INFO ] Computed 32 invariants in 495 ms
Computed 32 P flows in 496 ms.
Exported basis to /tmp/petrispot-output-12585393517042015466.kers
Total runtime 585 ms.
[2026-05-28 08:59:00] [INFO ] Implicit Places using invariants in 12345 ms returned []
Implicit Place search using SMT only with invariants took 12355 ms to find 0 implicit places.
Running 24753 sub problems to find dead transitions.
[2026-05-28 08:59:01] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 24753 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 175/24930 variables, and 13 constraints, problems are : Problem set: 0 solved, 24753 unsolved in 30727 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/176 constraints, PredecessorRefiner: 24753/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24753 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 24753 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 175/24930 variables, and 13 constraints, problems are : Problem set: 0 solved, 24753 unsolved in 30711 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/176 constraints, PredecessorRefiner: 24629/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 147174ms problems are : Problem set: 0 solved, 24753 unsolved
Search for dead transitions found 0 dead transitions in 147308ms
Starting structural reductions in LTL mode, iteration 1 : 176/179 places, 24754/37044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161289 ms. Remains : 176/179 places, 24754/37044 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(p0)&&p1))))'
Stuttering acceptance computed with spot in 136 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA ErlangenMainframeV0-PT-1301-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1301-LTLFireability-12 finished in 161574 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)&&(G(F(p1))||(F(p1)&&F(!p2))))))'
Support contains 35 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 37044/37044 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 178 transition count 32948
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 178 transition count 32948
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 177 transition count 24756
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 177 transition count 24756
Applied a total of 4 rules in 2297 ms. Remains 177 /179 variables (removed 2) and now considering 24756/37044 (removed 12288) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18045502562627510641.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-401959815105157948.kers'
[2026-05-28 09:01:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18045502562627510641.kers, --Pflows, --basisKERS=/tmp/petrispot-output-401959815105157948.kers]
Culled 0 columns in 119 ms.
// Phase 1: matrix 24756 rows 177 cols 721456 entries
Finished phase 1 with 143 SingleSign rule and 2 generalized
[2026-05-28 09:01:31] [INFO ] Computed 32 invariants in 492 ms
Computed 32 P flows in 493 ms.
Exported basis to /tmp/petrispot-output-401959815105157948.kers
Total runtime 579 ms.
[2026-05-28 09:01:40] [INFO ] Implicit Places using invariants in 9922 ms returned []
Implicit Place search using SMT only with invariants took 9924 ms to find 0 implicit places.
Running 24755 sub problems to find dead transitions.
[2026-05-28 09:01:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 24755 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 176/24933 variables, and 13 constraints, problems are : Problem set: 0 solved, 24755 unsolved in 30438 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/177 constraints, PredecessorRefiner: 24755/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24755 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 24755 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 176/24933 variables, and 13 constraints, problems are : Problem set: 0 solved, 24755 unsolved in 30474 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/177 constraints, PredecessorRefiner: 24629/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 144020ms problems are : Problem set: 0 solved, 24755 unsolved
Search for dead transitions found 0 dead transitions in 144344ms
Starting structural reductions in LTL mode, iteration 1 : 177/179 places, 24756/37044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156636 ms. Remains : 177/179 places, 24756/37044 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)&&(G(F(p1))||(F(p1)&&F(p2))))))'
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLFireability-13
Product exploration timeout after 63380 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 44 steps with 0 reset with depth 45 and stack size 45 in 3 ms.
FORMULA ErlangenMainframeV0-PT-1301-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1301-LTLFireability-13 finished in 167075 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) U X((X(!p1)||(F(p1) U p2)))))'
Support contains 39 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 37044/37044 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 178 transition count 32948
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 178 transition count 32948
Applied a total of 2 rules in 641 ms. Remains 178 /179 variables (removed 1) and now considering 32948/37044 (removed 4096) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17213001758919566127.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15500451367176536327.kers'
[2026-05-28 09:04:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17213001758919566127.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15500451367176536327.kers]
Culled 0 columns in 262 ms.
// Phase 1: matrix 32948 rows 178 cols 967216 entries
Finished phase 1 with 144 SingleSign rule and 2 generalized
[2026-05-28 09:04:17] [INFO ] Computed 32 invariants in 879 ms
Computed 32 P flows in 879 ms.
Exported basis to /tmp/petrispot-output-15500451367176536327.kers
Total runtime 1016 ms.
[2026-05-28 09:04:26] [INFO ] Implicit Places using invariants in 10032 ms returned []
Implicit Place search using SMT only with invariants took 10034 ms to find 0 implicit places.
Running 32947 sub problems to find dead transitions.
[2026-05-28 09:04:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 32947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 177/33126 variables, and 13 constraints, problems are : Problem set: 0 solved, 32947 unsolved in 30710 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/178 constraints, PredecessorRefiner: 32947/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32947 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 32947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 177/33126 variables, and 13 constraints, problems are : Problem set: 0 solved, 32947 unsolved in 30559 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/178 constraints, PredecessorRefiner: 32821/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 191587ms problems are : Problem set: 0 solved, 32947 unsolved
Search for dead transitions found 0 dead transitions in 191895ms
Starting structural reductions in LTL mode, iteration 1 : 178/179 places, 32948/37044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202677 ms. Remains : 178/179 places, 32948/37044 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X((X(!p1)||(F(p1) U p2)))))'
Stuttering acceptance computed with spot in 357 ms :[(AND p1 (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 2374 ms.
Product exploration explored 100000 steps with 33333 reset in 1936 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 12 ms. Proved property starting from automaton with 8 states, 12 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 1456 ms.
FORMULA ErlangenMainframeV0-PT-1301-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1301-LTLFireability-15 finished in 209495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)&&F((!p1 U (p2||G(!p1))))))'
Spot run failed in 60 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X(p0))||G(p1))))))'
Spot run failed in 58 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-28 09:07:53] [INFO ] Flatten gal took : 7016 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6913359608277114505
[2026-05-28 09:07:56] [INFO ] Too many transitions (37044) to apply POR reductions. Disabling POR matrices.
[2026-05-28 09:07:57] [INFO ] Built C files in 1321ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6913359608277114505
Running compilation step : cd /tmp/ltsmin6913359608277114505;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-28 09:08:00] [INFO ] Applying decomposition
[2026-05-28 09:08:08] [INFO ] Flatten gal took : 8885 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/graph6441348107738130940.txt' '-o' '/tmp/graph6441348107738130940.bin' '-w' '/tmp/graph6441348107738130940.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6441348107738130940.bin' '-l' '-1' '-v' '-w' '/tmp/graph6441348107738130940.weights' '-q' '0' '-e' '0.001'
[2026-05-28 09:08:29] [INFO ] Decomposing Gal with order
[2026-05-28 09:08:29] [INFO ] Rewriting arrays to variables to allow decomposition.
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-1301"
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-1301, 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-177955740700548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV0-PT-1301.tgz
mv ErlangenMainframeV0-PT-1301 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;