fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r114-smll-177955740600492
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for ErlangenMainframeV0-PT-1104

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16064.575 3600000.00 4489356.00 8835.10 FFF?FF?FF?FFFFFF 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-177955740600492.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-1104, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740600492
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 40M
-rw-r--r-- 1 mcc users 6.2K Mar 7 04:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 7 04:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 04:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 04:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 09:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 04:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Mar 7 04:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 04:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 7 04:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:56 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 39M 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-1104-LTLFireability-00
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLFireability-01
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLFireability-02
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLFireability-03
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLFireability-04
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLFireability-05
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLFireability-06
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLFireability-07
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLFireability-08
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLFireability-09
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLFireability-10
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLFireability-11
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLFireability-12
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLFireability-13
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLFireability-14
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779908488496

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-1104
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 19:01:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 19:01:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 19:01:33] [INFO ] Load time of PNML (sax parser for PT used): 2189 ms
[2026-05-27 19:01:33] [INFO ] Transformed 281 places.
[2026-05-27 19:01:34] [INFO ] Transformed 31390 transitions.
[2026-05-27 19:01:34] [INFO ] Found NUPN structural information;
[2026-05-27 19:01:34] [INFO ] Parsed PT model containing 281 places and 31390 transitions and 788748 arcs in 3145 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ErlangenMainframeV0-PT-1104-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1104-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 31390/31390 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 69 place count 212 transition count 31321
Iterating global reduction 0 with 69 rules applied. Total rules applied 138 place count 212 transition count 31321
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 177 place count 173 transition count 31282
Iterating global reduction 0 with 39 rules applied. Total rules applied 216 place count 173 transition count 31282
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 219 place count 170 transition count 31279
Iterating global reduction 0 with 3 rules applied. Total rules applied 222 place count 170 transition count 31279
Applied a total of 222 rules in 1245 ms. Remains 170 /281 variables (removed 111) and now considering 31279/31390 (removed 111) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7482483991813888802.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14606271434896520928.kers'
[2026-05-27 19:01:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7482483991813888802.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14606271434896520928.kers]
Culled 0 columns in 131 ms.
// Phase 1: matrix 31279 rows 170 cols 788526 entries
Finished phase 1 with 139 SingleSign rule and 3 generalized
[2026-05-27 19:01:37] [INFO ] Computed 28 invariants in 566 ms
Computed 28 P flows in 568 ms.
Exported basis to /tmp/petrispot-output-14606271434896520928.kers
Total runtime 665 ms.
[2026-05-27 19:01:37] [INFO ] Implicit Places using invariants in 1326 ms returned []
Implicit Place search using SMT only with invariants took 1387 ms to find 0 implicit places.
Running 31278 sub problems to find dead transitions.
[2026-05-27 19:01:38] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 31278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 169/31449 variables, and 11 constraints, problems are : Problem set: 0 solved, 31278 unsolved in 30941 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 31278/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 31278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 169/31449 variables, and 11 constraints, problems are : Problem set: 0 solved, 31278 unsolved in 30727 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 31156/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 158204ms problems are : Problem set: 0 solved, 31278 unsolved
Search for dead transitions found 0 dead transitions in 158706ms
Starting structural reductions in LTL mode, iteration 1 : 170/281 places, 31279/31390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161645 ms. Remains : 170/281 places, 31279/31390 transitions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 31279/31279 transitions.
Applied a total of 0 rules in 180 ms. Remains 170 /170 variables (removed 0) and now considering 31279/31279 (removed 0) transitions.
[2026-05-27 19:04:16] [INFO ] Invariant cache hit.
[2026-05-27 19:04:16] [INFO ] Implicit Places using invariants in 113 ms returned []
Implicit Place search using SMT only with invariants took 114 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 298 ms. Remains : 170/170 places, 31279/31279 transitions.
Support contains 56 out of 170 places after structural reductions.
[2026-05-27 19:04:22] [INFO ] Flatten gal took : 4975 ms
[2026-05-27 19:04:27] [INFO ] Flatten gal took : 4563 ms
[2026-05-27 19:04:34] [INFO ] Input system was already deterministic with 31279 transitions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 40000 steps (8 resets) in 14807 ms. (2 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 74 ms. (53 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 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 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 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 71 ms. (55 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 85 ms. (46 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 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 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 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
Interrupted probabilistic random walk after 49109 steps, run timeout after 12002 ms. (steps per millisecond=4 ) properties seen :0 out of 32
Probabilistic random walk after 49109 steps, saw 33189 distinct states, run finished after 12009 ms. (steps per millisecond=4 ) properties seen :0
[2026-05-27 19:04:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 2 (OVERLAPS) 77/133 variables, 13/24 constraints. Problems are: Problem set: 3 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/31449 variables, and 24 constraints, problems are : Problem set: 3 solved, 29 unsolved in 5061 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 32/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 11/11 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 77/133 variables, 13/24 constraints. Problems are: Problem set: 3 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/31449 variables, and 24 constraints, problems are : Problem set: 3 solved, 29 unsolved in 5131 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 29/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10685ms problems are : Problem set: 3 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 56 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 31279/31279 transitions.
Graph (trivial) has 83 edges and 170 vertex of which 4 / 170 are part of one of the 2 SCC in 16 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 168 transition count 31262
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 155 transition count 31262
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 27 place count 155 transition count 31243
Deduced a syphon composed of 19 places in 40 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 65 place count 136 transition count 31243
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 134 transition count 31226
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 134 transition count 31226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 134 transition count 31224
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 12 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 137 place count 101 transition count 31191
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 28 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 99 transition count 31207
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 146 place count 99 transition count 31202
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 153 place count 94 transition count 31200
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 155 place count 94 transition count 31200
Partial Post-agglomeration rule applied 11 times.
Drop transitions (Partial Post agglomeration) removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 166 place count 94 transition count 31200
Applied a total of 166 rules in 6974 ms. Remains 94 /170 variables (removed 76) and now considering 31200/31279 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6976 ms. Remains : 94/170 places, 31200/31279 transitions.
RANDOM walk for 40000 steps (8 resets) in 23064 ms. (1 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 241 ms. (16 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 234 ms. (17 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 287 ms. (13 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 296 ms. (13 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 203 ms. (19 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 223 ms. (17 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 224 ms. (17 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 221 ms. (18 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 206 ms. (19 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 374 ms. (10 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 340 ms. (11 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 270 ms. (14 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 347 ms. (11 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 291 ms. (13 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 316 ms. (12 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 334 ms. (11 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 247 ms. (16 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 303 ms. (13 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 357 ms. (11 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 286 ms. (13 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 321 ms. (12 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 293 ms. (13 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 304 ms. (13 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 301 ms. (13 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 296 ms. (13 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 302 ms. (13 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 264 ms. (15 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 228 ms. (17 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 285 ms. (13 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 160827 steps, run timeout after 24001 ms. (steps per millisecond=6 ) properties seen :0 out of 29
Probabilistic random walk after 160827 steps, saw 24799 distinct states, run finished after 24002 ms. (steps per millisecond=6 ) properties seen :0
[2026-05-27 19:05:41] [INFO ] Flow matrix only has 31182 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-4474480220578932284.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3913206393610308380.kers'
[2026-05-27 19:05:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4474480220578932284.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3913206393610308380.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 227 ms.
// Phase 1: matrix 31182 rows 93 cols 788264 entries
Finished phase 1 with 63 SingleSign rule and 3 generalized
[2026-05-27 19:05:42] [INFO ] Computed 28 invariants in 672 ms
Computed 28 P flows in 673 ms.
Exported basis to /tmp/petrispot-output-3913206393610308380.kers
Total runtime 781 ms.
[2026-05-27 19:05:42] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 6/62 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 7/69 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 25/94 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31276/31276 variables, and 122 constraints, problems are : Problem set: 0 solved, 29 unsolved in 45012 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 94/94 constraints, ReadFeed: 0/33 constraints, PredecessorRefiner: 29/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 6/62 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 7/69 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 25/94 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 31182/31276 variables, 94/122 constraints. Problems are: Problem set: 0 solved, 29 unsolved
SMT process timed out in 91349ms, After SMT, problems are : Problem set: 0 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 56 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 31200/31200 transitions.
Applied a total of 0 rules in 816 ms. Remains 94 /94 variables (removed 0) and now considering 31200/31200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 816 ms. Remains : 94/94 places, 31200/31200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 31200/31200 transitions.
Applied a total of 0 rules in 824 ms. Remains 94 /94 variables (removed 0) and now considering 31200/31200 (removed 0) transitions.
[2026-05-27 19:07:14] [INFO ] Flow matrix only has 31182 transitions (discarded 18 similar events)
[2026-05-27 19:07:14] [INFO ] Invariant cache hit.
[2026-05-27 19:07:14] [INFO ] Implicit Places using invariants in 125 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 192 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 93/94 places, 31200/31200 transitions.
Applied a total of 0 rules in 1001 ms. Remains 93 /93 variables (removed 0) and now considering 31200/31200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2029 ms. Remains : 93/94 places, 31200/31200 transitions.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
Computed a total of 23 stabilizing places and 23 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 13 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 31279/31279 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 155 transition count 20912
Ensure Unique test removed 11 places
Iterating global reduction 0 with 26 rules applied. Total rules applied 41 place count 144 transition count 20912
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 45 place count 140 transition count 4272
Iterating global reduction 0 with 4 rules applied. Total rules applied 49 place count 140 transition count 4272
Applied a total of 49 rules in 3732 ms. Remains 140 /170 variables (removed 30) and now considering 4272/31279 (removed 27007) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7938679633177591201.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1186804698532974314.kers'
[2026-05-27 19:07:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7938679633177591201.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1186804698532974314.kers]
Culled 0 columns in 10 ms.
// Phase 1: matrix 4272 rows 140 cols 62011 entries
Finished phase 1 with 123 SingleSign rule and 0 generalized
[2026-05-27 19:07:19] [INFO ] Computed 17 invariants in 49 ms
Computed 17 P flows in 49 ms.
Exported basis to /tmp/petrispot-output-1186804698532974314.kers
Total runtime 59 ms.
[2026-05-27 19:07:22] [INFO ] Implicit Places using invariants in 2645 ms returned []
[2026-05-27 19:07:22] [INFO ] Invariant cache hit.
[2026-05-27 19:07:25] [INFO ] Implicit Places using invariants and state equation in 3402 ms returned []
Implicit Place search using SMT with State Equation took 6049 ms to find 0 implicit places.
Running 4271 sub problems to find dead transitions.
[2026-05-27 19:07:25] [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 139/4412 variables, and 0 constraints, problems are : Problem set: 0 solved, 4271 unsolved in 30122 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, State Equation: 0/140 constraints, PredecessorRefiner: 4271/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4271 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 139/4412 variables, and 0 constraints, problems are : Problem set: 0 solved, 4271 unsolved in 30124 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, State Equation: 0/140 constraints, PredecessorRefiner: 4137/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68290ms problems are : Problem set: 0 solved, 4271 unsolved
Search for dead transitions found 0 dead transitions in 68320ms
Starting structural reductions in LTL mode, iteration 1 : 140/170 places, 4272/31279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78130 ms. Remains : 140/170 places, 4272/31279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Stuttering acceptance computed with spot in 471 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLFireability-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 4 ms.
FORMULA ErlangenMainframeV0-PT-1104-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1104-LTLFireability-00 finished in 78744 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(p0))&&F(p1))))'
Support contains 25 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 31279/31279 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 166 transition count 22959
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 166 transition count 22959
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 165 transition count 16047
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 165 transition count 16047
Applied a total of 10 rules in 1244 ms. Remains 165 /170 variables (removed 5) and now considering 16047/31279 (removed 15232) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14089896484738455242.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16843167698037964417.kers'
[2026-05-27 19:08:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14089896484738455242.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16843167698037964417.kers]
Culled 0 columns in 68 ms.
// Phase 1: matrix 16047 rows 165 cols 409134 entries
Finished phase 1 with 135 SingleSign rule and 2 generalized
[2026-05-27 19:08:36] [INFO ] Computed 28 invariants in 255 ms
Computed 28 P flows in 256 ms.
Exported basis to /tmp/petrispot-output-16843167698037964417.kers
Total runtime 312 ms.
[2026-05-27 19:08:46] [INFO ] Implicit Places using invariants in 10396 ms returned []
Implicit Place search using SMT only with invariants took 10397 ms to find 0 implicit places.
Running 16046 sub problems to find dead transitions.
[2026-05-27 19:08:46] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16046 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 164/16212 variables, and 11 constraints, problems are : Problem set: 0 solved, 16046 unsolved in 30445 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/165 constraints, PredecessorRefiner: 16046/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16046 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16046 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 164/16212 variables, and 11 constraints, problems are : Problem set: 0 solved, 16046 unsolved in 30391 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/165 constraints, PredecessorRefiner: 15924/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 98527ms problems are : Problem set: 0 solved, 16046 unsolved
Search for dead transitions found 0 dead transitions in 98623ms
Starting structural reductions in LTL mode, iteration 1 : 165/170 places, 16047/31279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110315 ms. Remains : 165/170 places, 16047/31279 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(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLFireability-01
Product exploration timeout after 61940 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 112 steps with 0 reset with depth 113 and stack size 113 in 11 ms.
FORMULA ErlangenMainframeV0-PT-1104-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1104-LTLFireability-01 finished in 120738 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 13 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 31279/31279 transitions.
Graph (trivial) has 99 edges and 170 vertex of which 4 / 170 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 167 transition count 31264
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 155 transition count 31264
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 25 place count 155 transition count 31245
Deduced a syphon composed of 19 places in 44 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 63 place count 136 transition count 31245
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 80 place count 119 transition count 20861
Ensure Unique test removed 11 places
Iterating global reduction 2 with 28 rules applied. Total rules applied 108 place count 108 transition count 20861
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 108 transition count 20859
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 114 place count 104 transition count 4219
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 104 transition count 4219
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 102 transition count 4215
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 102 transition count 4215
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 198 place count 64 transition count 4177
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 204 place count 61 transition count 4188
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 61 transition count 4186
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 214 place count 61 transition count 4186
Applied a total of 214 rules in 8797 ms. Remains 61 /170 variables (removed 109) and now considering 4186/31279 (removed 27093) transitions.
[2026-05-27 19:10:44] [INFO ] Flow matrix only has 4166 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-6894881150437666043.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-211623632032225182.kers'
[2026-05-27 19:10:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6894881150437666043.kers, --Pflows, --basisKERS=/tmp/petrispot-output-211623632032225182.kers]
Normalized transition count is 4165 out of 4166 initially.
Culled 0 columns in 17 ms.
// Phase 1: matrix 4165 rows 61 cols 102698 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-27 19:10:44] [INFO ] Computed 17 invariants in 52 ms
Computed 17 P flows in 53 ms.
Exported basis to /tmp/petrispot-output-211623632032225182.kers
Total runtime 69 ms.
[2026-05-27 19:10:46] [INFO ] Implicit Places using invariants in 2160 ms returned []
[2026-05-27 19:10:46] [INFO ] Flow matrix only has 4166 transitions (discarded 20 similar events)
[2026-05-27 19:10:46] [INFO ] Invariant cache hit.
[2026-05-27 19:10:48] [INFO ] State equation strengthened by 2059 read => feed constraints.
[2026-05-27 19:10:51] [INFO ] Implicit Places using invariants and state equation in 4475 ms returned []
Implicit Place search using SMT with State Equation took 6637 ms to find 0 implicit places.
[2026-05-27 19:10:52] [INFO ] Redundant transitions in 1467 ms returned []
Running 4184 sub problems to find dead transitions.
[2026-05-27 19:10:52] [INFO ] Flow matrix only has 4166 transitions (discarded 20 similar events)
[2026-05-27 19:10:52] [INFO ] Invariant cache hit.
[2026-05-27 19:10:52] [INFO ] State equation strengthened by 2059 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 60/4227 variables, and 0 constraints, problems are : Problem set: 0 solved, 4184 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, State Equation: 0/61 constraints, ReadFeed: 0/2059 constraints, PredecessorRefiner: 4184/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4184 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 60/4227 variables, and 0 constraints, problems are : Problem set: 0 solved, 4184 unsolved in 30120 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, State Equation: 0/61 constraints, ReadFeed: 0/2059 constraints, PredecessorRefiner: 4148/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66741ms problems are : Problem set: 0 solved, 4184 unsolved
Search for dead transitions found 0 dead transitions in 66762ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/170 places, 4186/31279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83685 ms. Remains : 61/170 places, 4186/31279 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 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 8718 ms.
Product exploration explored 100000 steps with 0 reset in 8126 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 3 factoid took 62 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 4187 ms. (9 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 538 ms. (74 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 115254 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 1
Probabilistic random walk after 115254 steps, saw 24117 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
[2026-05-27 19:12:20] [INFO ] Flow matrix only has 4166 transitions (discarded 20 similar events)
[2026-05-27 19:12:20] [INFO ] Invariant cache hit.
[2026-05-27 19:12:20] [INFO ] State equation strengthened by 2059 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/49 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/61 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4165/4226 variables, 61/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/4226 variables, 2058/2136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4226 variables, 0/2136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/4227 variables, 1/2137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4227 variables, 0/2137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/4227 variables, 0/2137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4227/4227 variables, and 2137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2542 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 61/61 constraints, ReadFeed: 2059/2059 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/49 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/61 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4165/4226 variables, 61/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4226 variables, 2058/2136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4226 variables, 0/2136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/4227 variables, 1/2137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4227 variables, 0/2137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/4227 variables, 0/2137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4227/4227 variables, and 2137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2872 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 61/61 constraints, ReadFeed: 2059/2059 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5477ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 41 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 19 ms.
Knowledge based reduction with 3 factoid took 88 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 101 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 10137 ms.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Support contains 13 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 4186/4186 transitions.
Applied a total of 0 rules in 840 ms. Remains 61 /61 variables (removed 0) and now considering 4186/4186 (removed 0) transitions.
[2026-05-27 19:12:27] [INFO ] Flow matrix only has 4166 transitions (discarded 20 similar events)
[2026-05-27 19:12:27] [INFO ] Invariant cache hit.
[2026-05-27 19:12:29] [INFO ] Implicit Places using invariants in 1690 ms returned []
[2026-05-27 19:12:29] [INFO ] Flow matrix only has 4166 transitions (discarded 20 similar events)
[2026-05-27 19:12:29] [INFO ] Invariant cache hit.
[2026-05-27 19:12:30] [INFO ] State equation strengthened by 2059 read => feed constraints.
[2026-05-27 19:12:32] [INFO ] Implicit Places using invariants and state equation in 3899 ms returned []
Implicit Place search using SMT with State Equation took 5591 ms to find 0 implicit places.
[2026-05-27 19:12:34] [INFO ] Redundant transitions in 1253 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7691 ms. Remains : 61/61 places, 4186/4186 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 49 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 3874 ms. (10 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 402 ms. (99 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 122634 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 1
Probabilistic random walk after 122634 steps, saw 25047 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2026-05-27 19:12:38] [INFO ] Flow matrix only has 4166 transitions (discarded 20 similar events)
[2026-05-27 19:12:38] [INFO ] Invariant cache hit.
[2026-05-27 19:12:38] [INFO ] State equation strengthened by 2059 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/49 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/61 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4226/4227 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2091 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 61/61 constraints, ReadFeed: 0/2059 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/49 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/61 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4226/4227 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2175 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 61/61 constraints, ReadFeed: 0/2059 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4315ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 44 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 5 ms.
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 8665 ms.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 8236 ms.
Product exploration explored 100000 steps with 0 reset in 7817 ms.
Built C files in :
/tmp/ltsmin9183520242432952065
[2026-05-27 19:12:59] [INFO ] Too many transitions (4186) to apply POR reductions. Disabling POR matrices.
[2026-05-27 19:12:59] [INFO ] Built C files in 196ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9183520242432952065
Running compilation step : cd /tmp/ltsmin9183520242432952065;'/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/ltsmin9183520242432952065;'/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/ltsmin9183520242432952065;'/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 13 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 4186/4186 transitions.
Applied a total of 0 rules in 810 ms. Remains 61 /61 variables (removed 0) and now considering 4186/4186 (removed 0) transitions.
[2026-05-27 19:13:03] [INFO ] Flow matrix only has 4166 transitions (discarded 20 similar events)
[2026-05-27 19:13:03] [INFO ] Invariant cache hit.
[2026-05-27 19:13:05] [INFO ] Implicit Places using invariants in 2135 ms returned []
[2026-05-27 19:13:05] [INFO ] Flow matrix only has 4166 transitions (discarded 20 similar events)
[2026-05-27 19:13:05] [INFO ] Invariant cache hit.
[2026-05-27 19:13:07] [INFO ] State equation strengthened by 2059 read => feed constraints.
[2026-05-27 19:13:09] [INFO ] Implicit Places using invariants and state equation in 4531 ms returned []
Implicit Place search using SMT with State Equation took 6670 ms to find 0 implicit places.
[2026-05-27 19:13:10] [INFO ] Redundant transitions in 1141 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8630 ms. Remains : 61/61 places, 4186/4186 transitions.
Built C files in :
/tmp/ltsmin8193228019070012039
[2026-05-27 19:13:10] [INFO ] Too many transitions (4186) to apply POR reductions. Disabling POR matrices.
[2026-05-27 19:13:11] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8193228019070012039
Running compilation step : cd /tmp/ltsmin8193228019070012039;'/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/ltsmin8193228019070012039;'/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/ltsmin8193228019070012039;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-27 19:13:18] [INFO ] Flatten gal took : 1050 ms
[2026-05-27 19:13:19] [INFO ] Flatten gal took : 707 ms
[2026-05-27 19:13:19] [INFO ] Time to serialize gal into /tmp/LTL15339455734264008028.gal : 174 ms
[2026-05-27 19:13:19] [INFO ] Time to serialize properties into /tmp/LTL12842074043307765221.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15339455734264008028.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15649653584539336466.hoa' '-atoms' '/tmp/LTL12842074043307765221.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...320
Loading property file /tmp/LTL12842074043307765221.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15649653584539336466.hoa
Detected timeout of ITS tools.
[2026-05-27 19:13:38] [INFO ] Flatten gal took : 922 ms
[2026-05-27 19:13:39] [INFO ] Flatten gal took : 702 ms
[2026-05-27 19:13:39] [INFO ] Time to serialize gal into /tmp/LTL1896194023628337159.gal : 99 ms
[2026-05-27 19:13:39] [INFO ] Time to serialize properties into /tmp/LTL10176814995762627048.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1896194023628337159.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10176814995762627048.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((p22!=1)||(p35!=1))||((p48!=1)||(p57!=1)))||(((p74!=1)||(p87!=1))||((p100!=1)||(p119!=1))))||((((p132!=1)||(p147!=1))||((p...193
Formula 0 simplified : FG!"(((((p22!=1)||(p35!=1))||((p48!=1)||(p57!=1)))||(((p74!=1)||(p87!=1))||((p100!=1)||(p119!=1))))||((((p132!=1)||(p147!=1))||((p16...187
Detected timeout of ITS tools.
[2026-05-27 19:13:55] [INFO ] Flatten gal took : 823 ms
[2026-05-27 19:13:55] [INFO ] Applying decomposition
[2026-05-27 19:13:56] [INFO ] Flatten gal took : 744 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/graph9506113253649202527.txt' '-o' '/tmp/graph9506113253649202527.bin' '-w' '/tmp/graph9506113253649202527.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9506113253649202527.bin' '-l' '-1' '-v' '-w' '/tmp/graph9506113253649202527.weights' '-q' '0' '-e' '0.001'
[2026-05-27 19:13:58] [INFO ] Decomposing Gal with order
[2026-05-27 19:13:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 19:14:00] [INFO ] Removed a total of 53342 redundant transitions.
[2026-05-27 19:14:01] [INFO ] Flatten gal took : 1701 ms
[2026-05-27 19:14:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 1025 ms.
[2026-05-27 19:14:02] [INFO ] Time to serialize gal into /tmp/LTL16070010658625720340.gal : 94 ms
[2026-05-27 19:14:02] [INFO ] Time to serialize properties into /tmp/LTL5694437377357132112.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/LTL16070010658625720340.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5694437377357132112.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((i0.u1.p22!=1)||(i1.u9.p35!=1))||((i0.u3.p48!=1)||(i0.u2.p57!=1)))||(((i0.u6.p74!=1)||(i0.u13.p87!=1))||((i0.u7.p100!=1)||...275
Formula 0 simplified : FG!"(((((i0.u1.p22!=1)||(i1.u9.p35!=1))||((i0.u3.p48!=1)||(i0.u2.p57!=1)))||(((i0.u6.p74!=1)||(i0.u13.p87!=1))||((i0.u7.p100!=1)||(i...269
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
345 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.42237,86996,1,0,51839,602,79994,64889,370,1427,196873
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV0-PT-1104-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ErlangenMainframeV0-PT-1104-LTLFireability-02 finished in 213640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(X((!p1&&X(!p2)))))))'
Support contains 34 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 31279/31279 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 166 transition count 22959
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 166 transition count 22959
Applied a total of 8 rules in 725 ms. Remains 166 /170 variables (removed 4) and now considering 22959/31279 (removed 8320) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13802209443182836467.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15484484339636331652.kers'
[2026-05-27 19:14:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13802209443182836467.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15484484339636331652.kers]
Culled 0 columns in 97 ms.
// Phase 1: matrix 22959 rows 166 cols 588846 entries
Finished phase 1 with 136 SingleSign rule and 2 generalized
[2026-05-27 19:14:10] [INFO ] Computed 28 invariants in 374 ms
Computed 28 P flows in 375 ms.
Exported basis to /tmp/petrispot-output-15484484339636331652.kers
Total runtime 449 ms.
[2026-05-27 19:14:15] [INFO ] Implicit Places using invariants in 5635 ms returned []
Implicit Place search using SMT only with invariants took 5636 ms to find 0 implicit places.
Running 22958 sub problems to find dead transitions.
[2026-05-27 19:14:15] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 22958 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 165/23125 variables, and 11 constraints, problems are : Problem set: 0 solved, 22958 unsolved in 30418 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/166 constraints, PredecessorRefiner: 22958/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 22958 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 165/23125 variables, and 11 constraints, problems are : Problem set: 0 solved, 22958 unsolved in 30632 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/166 constraints, PredecessorRefiner: 22836/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 122903ms problems are : Problem set: 0 solved, 22958 unsolved
Search for dead transitions found 0 dead transitions in 123033ms
Starting structural reductions in LTL mode, iteration 1 : 166/170 places, 22959/31279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129463 ms. Remains : 166/170 places, 22959/31279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(X((!p1&&X(!p2)))))))'
Stuttering acceptance computed with spot in 633 ms :[(OR p1 p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLFireability-03
Product exploration explored 100000 steps with 22252 reset in 1442 ms.
Product exploration explored 100000 steps with 22252 reset in 1345 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge based reduction with 6 factoid took 103 ms. Reduced automaton from 11 states, 24 edges and 3 AP (stutter sensitive) to 11 states, 24 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 12807 ms. (3 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1084 ms. (36 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 708 ms. (56 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 654 ms. (61 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 730 ms. (54 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 649 ms. (61 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 644 ms. (62 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 731 ms. (54 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 667 ms. (59 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 620 ms. (64 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 73860 steps, run timeout after 15001 ms. (steps per millisecond=4 ) properties seen :0 out of 9
Probabilistic random walk after 73860 steps, saw 50068 distinct states, run finished after 15001 ms. (steps per millisecond=4 ) properties seen :0
[2026-05-27 19:16:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf4 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 85/119 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 1/14 constraints. Problems are: Problem set: 2 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 37/156 variables, 4/18 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 10/166 variables, 10/28 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 7 unsolved
SMT process timed out in 5229ms, After SMT, problems are : Problem set: 2 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 34 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 22959/22959 transitions.
Graph (trivial) has 90 edges and 166 vertex of which 4 / 166 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 164 transition count 22942
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 151 transition count 22942
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 27 place count 151 transition count 22923
Deduced a syphon composed of 19 places in 29 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 65 place count 132 transition count 22923
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 130 transition count 22906
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 130 transition count 22906
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 130 transition count 22904
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 9 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 147 place count 92 transition count 22866
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 151 place count 90 transition count 22885
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 158 place count 90 transition count 22878
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 167 place count 83 transition count 22876
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 169 place count 83 transition count 22876
Partial Post-agglomeration rule applied 9 times.
Drop transitions (Partial Post agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 178 place count 83 transition count 22876
Applied a total of 178 rules in 5538 ms. Remains 83 /166 variables (removed 83) and now considering 22876/22959 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5539 ms. Remains : 83/166 places, 22876/22959 transitions.
RANDOM walk for 40000 steps (8 resets) in 17416 ms. (2 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2714 ms. (14 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2626 ms. (15 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2792 ms. (14 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2639 ms. (15 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2670 ms. (14 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2740 ms. (14 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2657 ms. (15 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 203440 steps, run timeout after 27001 ms. (steps per millisecond=7 ) properties seen :0 out of 7
Probabilistic random walk after 203440 steps, saw 30022 distinct states, run finished after 27001 ms. (steps per millisecond=7 ) properties seen :0
[2026-05-27 19:17:30] [INFO ] Flow matrix only has 22853 transitions (discarded 23 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3710056047309743541.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11113949763564871203.kers'
[2026-05-27 19:17:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3710056047309743541.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11113949763564871203.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 103 ms.
// Phase 1: matrix 22853 rows 82 cols 588568 entries
Finished phase 1 with 53 SingleSign rule and 2 generalized
[2026-05-27 19:17:30] [INFO ] Computed 28 invariants in 426 ms
Computed 28 P flows in 426 ms.
Exported basis to /tmp/petrispot-output-11113949763564871203.kers
Total runtime 513 ms.
[2026-05-27 19:17:31] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 32/66 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 7/73 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 10/83 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 22853/22936 variables, 83/111 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/22936 variables, 34/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/22936 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/22936 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22936/22936 variables, and 145 constraints, problems are : Problem set: 0 solved, 7 unsolved in 34504 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 83/83 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 32/66 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 7/73 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 10/83 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 22853/22936 variables, 83/111 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22936 variables, 34/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/22936 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 22936/22936 variables, and 145 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 83/83 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 80345ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 22876/22876 transitions.
Applied a total of 0 rules in 726 ms. Remains 83 /83 variables (removed 0) and now considering 22876/22876 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 726 ms. Remains : 83/83 places, 22876/22876 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 22876/22876 transitions.
Applied a total of 0 rules in 670 ms. Remains 83 /83 variables (removed 0) and now considering 22876/22876 (removed 0) transitions.
[2026-05-27 19:18:52] [INFO ] Flow matrix only has 22853 transitions (discarded 23 similar events)
[2026-05-27 19:18:52] [INFO ] Invariant cache hit.
[2026-05-27 19:18:56] [INFO ] Implicit Places using invariants in 4908 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4946 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/83 places, 22876/22876 transitions.
Applied a total of 0 rules in 637 ms. Remains 82 /82 variables (removed 0) and now considering 22876/22876 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6261 ms. Remains : 82/83 places, 22876/22876 transitions.
Found 2 invariant AP formulas.
Knowledge based reduction with 8 factoid took 103 ms. Reduced automaton from 11 states, 24 edges and 3 AP (stutter sensitive) to 11 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 410 ms :[(OR p1 p2), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR p1 p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Knowledge-based reduction took 155891 ms.
Stuttering acceptance computed with spot in 448 ms :[(OR p1 p2), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR p1 p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Support contains 34 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 22959/22959 transitions.
Applied a total of 0 rules in 176 ms. Remains 166 /166 variables (removed 0) and now considering 22959/22959 (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-8139352532932505249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1291035119740354027.kers'
[2026-05-27 19:18:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8139352532932505249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1291035119740354027.kers]
Culled 0 columns in 97 ms.
// Phase 1: matrix 22959 rows 166 cols 588846 entries
Finished phase 1 with 136 SingleSign rule and 2 generalized
[2026-05-27 19:18:59] [INFO ] Computed 28 invariants in 385 ms
Computed 28 P flows in 386 ms.
Exported basis to /tmp/petrispot-output-1291035119740354027.kers
Total runtime 468 ms.
[2026-05-27 19:19:04] [INFO ] Implicit Places using invariants in 6137 ms returned []
Implicit Place search using SMT only with invariants took 6138 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 6316 ms. Remains : 166/166 places, 22959/22959 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge based reduction with 6 factoid took 82 ms. Reduced automaton from 11 states, 20 edges and 3 AP (stutter sensitive) to 11 states, 20 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 10752 ms. (3 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 671 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 710 ms. (56 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 692 ms. (57 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 724 ms. (55 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 716 ms. (55 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 662 ms. (60 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 41117 steps, run timeout after 9001 ms. (steps per millisecond=4 ) properties seen :0 out of 6
Probabilistic random walk after 41117 steps, saw 28178 distinct states, run finished after 9001 ms. (steps per millisecond=4 ) properties seen :0
[2026-05-27 19:19:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 85/119 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 37/156 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 10/166 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 17190ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 22959/22959 transitions.
Graph (trivial) has 90 edges and 166 vertex of which 4 / 166 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 164 transition count 22942
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 151 transition count 22942
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 27 place count 151 transition count 22923
Deduced a syphon composed of 19 places in 20 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 65 place count 132 transition count 22923
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 130 transition count 22906
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 130 transition count 22906
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 130 transition count 22904
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 8 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 147 place count 92 transition count 22866
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 151 place count 90 transition count 22885
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 158 place count 90 transition count 22878
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 167 place count 83 transition count 22876
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 169 place count 83 transition count 22876
Partial Post-agglomeration rule applied 9 times.
Drop transitions (Partial Post agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 178 place count 83 transition count 22876
Applied a total of 178 rules in 5520 ms. Remains 83 /166 variables (removed 83) and now considering 22876/22959 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5522 ms. Remains : 83/166 places, 22876/22959 transitions.
RANDOM walk for 40000 steps (8 resets) in 17530 ms. (2 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2626 ms. (15 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2676 ms. (14 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2622 ms. (15 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2614 ms. (15 steps per ms) remains 4/4 properties
[2026-05-27 19:19:48] [INFO ] Flow matrix only has 22853 transitions (discarded 23 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1355750218808323349.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13961262982589259575.kers'
[2026-05-27 19:19:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1355750218808323349.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13961262982589259575.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 99 ms.
// Phase 1: matrix 22853 rows 82 cols 588568 entries
Finished phase 1 with 53 SingleSign rule and 2 generalized
[2026-05-27 19:19:49] [INFO ] Computed 28 invariants in 385 ms
Computed 28 P flows in 385 ms.
Exported basis to /tmp/petrispot-output-13961262982589259575.kers
Total runtime 468 ms.
[2026-05-27 19:19:49] [INFO ] State equation strengthened by 34 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 32/66 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 7/73 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/83 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 22853/22936 variables, 83/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22936 variables, 34/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/22936 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/22936 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22936/22936 variables, and 145 constraints, problems are : Problem set: 0 solved, 4 unsolved in 32324 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 83/83 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 32/66 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 7/73 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/83 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 22853/22936 variables, 83/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22936 variables, 34/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/22936 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/22936 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
Error getting values : (error "Timeout of Z3 solver reached")
After SMT solving in domain Int declared 22936/22936 variables, and 145 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45004 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 83/83 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 78185ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6685 ms.
Support contains 34 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 22876/22876 transitions.
Applied a total of 0 rules in 640 ms. Remains 83 /83 variables (removed 0) and now considering 22876/22876 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 640 ms. Remains : 83/83 places, 22876/22876 transitions.
Knowledge based reduction with 6 factoid took 111 ms. Reduced automaton from 11 states, 20 edges and 3 AP (stutter sensitive) to 11 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 450 ms :[(OR p1 p2), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR p1 p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Knowledge-based reduction took 129580 ms.
Stuttering acceptance computed with spot in 600 ms :[(OR p1 p2), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR p1 p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 591 ms :[(OR p1 p2), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR p1 p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Product exploration explored 100000 steps with 22231 reset in 1205 ms.
Product exploration explored 100000 steps with 22196 reset in 1052 ms.
Spot run failed in 110 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/ltsmin9087668098123346362
[2026-05-27 19:21:18] [INFO ] Built C files in 653ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9087668098123346362
Running compilation step : cd /tmp/ltsmin9087668098123346362;'/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/ltsmin9087668098123346362;'/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/ltsmin9087668098123346362;'/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 34 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 22959/22959 transitions.
Applied a total of 0 rules in 114 ms. Remains 166 /166 variables (removed 0) and now considering 22959/22959 (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-13110748514772192190.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15459256073665932106.kers'
[2026-05-27 19:21:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13110748514772192190.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15459256073665932106.kers]
Culled 0 columns in 99 ms.
// Phase 1: matrix 22959 rows 166 cols 588846 entries
Finished phase 1 with 136 SingleSign rule and 2 generalized
[2026-05-27 19:21:22] [INFO ] Computed 28 invariants in 440 ms
Computed 28 P flows in 440 ms.
Exported basis to /tmp/petrispot-output-15459256073665932106.kers
Total runtime 516 ms.
[2026-05-27 19:21:28] [INFO ] Implicit Places using invariants in 6534 ms returned []
Implicit Place search using SMT only with invariants took 6535 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 6650 ms. Remains : 166/166 places, 22959/22959 transitions.
Built C files in :
/tmp/ltsmin5137732281147801257
[2026-05-27 19:21:29] [INFO ] Built C files in 568ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5137732281147801257
Running compilation step : cd /tmp/ltsmin5137732281147801257;'/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/ltsmin5137732281147801257;'/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/ltsmin5137732281147801257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-27 19:21:38] [INFO ] Flatten gal took : 3654 ms
[2026-05-27 19:21:42] [INFO ] Flatten gal took : 3234 ms
[2026-05-27 19:21:42] [INFO ] Time to serialize gal into /tmp/LTL1125143118758857863.gal : 508 ms
[2026-05-27 19:21:42] [INFO ] Time to serialize properties into /tmp/LTL2487669360050941416.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1125143118758857863.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18445786239451344865.hoa' '-atoms' '/tmp/LTL2487669360050941416.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-27 19:22:05] [INFO ] Flatten gal took : 3690 ms
[2026-05-27 19:22:08] [INFO ] Flatten gal took : 3129 ms
[2026-05-27 19:22:09] [INFO ] Time to serialize gal into /tmp/LTL5187042265826682498.gal : 572 ms
[2026-05-27 19:22:09] [INFO ] Time to serialize properties into /tmp/LTL8760807561658974628.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/LTL5187042265826682498.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8760807561658974628.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Detected timeout of ITS tools.
[2026-05-27 19:22:28] [INFO ] Flatten gal took : 3171 ms
[2026-05-27 19:22:28] [INFO ] Applying decomposition
[2026-05-27 19:22:31] [INFO ] Flatten gal took : 3068 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/graph15242610489715608328.txt' '-o' '/tmp/graph15242610489715608328.bin' '-w' '/tmp/graph15242610489715608328.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15242610489715608328.bin' '-l' '-1' '-v' '-w' '/tmp/graph15242610489715608328.weights' '-q' '0' '-e' '0.001'
[2026-05-27 19:22:41] [INFO ] Decomposing Gal with order
[2026-05-27 19:22:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 19:22:48] [INFO ] Removed a total of 305275 redundant transitions.
[2026-05-27 19:22:49] [INFO ] Flatten gal took : 5416 ms
[2026-05-27 19:22:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 1711 ms.
[2026-05-27 19:22:51] [INFO ] Time to serialize gal into /tmp/LTL11411020216851898687.gal : 70 ms
[2026-05-27 19:22:51] [INFO ] Time to serialize properties into /tmp/LTL10635985278726513238.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/LTL11411020216851898687.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10635985278726513238.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...256
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((i2.u6.p18==1)&&(i1.u10.p35==1))&&((i2.u13.p48==1)&&(i2.u14.p57==1)))&&(((i2.u19.p74==1)&&(i1.u20.p83==1))&&((i2.u24.p96=...1045
Formula 0 simplified : F(G!"(((((i2.u6.p18==1)&&(i1.u10.p35==1))&&((i2.u13.p48==1)&&(i2.u14.p57==1)))&&(((i2.u19.p74==1)&&(i1.u20.p83==1))&&((i2.u24.p96==1...1026
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-1104-LTLFireability-03 finished in 537735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 13 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 31279/31279 transitions.
Graph (trivial) has 99 edges and 170 vertex of which 4 / 170 are part of one of the 2 SCC in 1 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 167 transition count 31264
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 155 transition count 31264
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 25 place count 155 transition count 31245
Deduced a syphon composed of 19 places in 43 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 63 place count 136 transition count 31245
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 80 place count 119 transition count 20861
Ensure Unique test removed 11 places
Iterating global reduction 2 with 28 rules applied. Total rules applied 108 place count 108 transition count 20861
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 108 transition count 20859
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 114 place count 104 transition count 4219
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 104 transition count 4219
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 103 transition count 4217
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 103 transition count 4217
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 206 place count 60 transition count 4174
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 210 place count 58 transition count 4185
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 213 place count 58 transition count 4182
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 218 place count 58 transition count 4182
Applied a total of 218 rules in 7726 ms. Remains 58 /170 variables (removed 112) and now considering 4182/31279 (removed 27097) transitions.
[2026-05-27 19:23:14] [INFO ] Flow matrix only has 4162 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-16045323318291314880.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7853587282141380342.kers'
[2026-05-27 19:23:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16045323318291314880.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7853587282141380342.kers]
Normalized transition count is 4161 out of 4162 initially.
Culled 0 columns in 17 ms.
// Phase 1: matrix 4161 rows 58 cols 102686 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-27 19:23:14] [INFO ] Computed 17 invariants in 49 ms
Computed 17 P flows in 50 ms.
Exported basis to /tmp/petrispot-output-7853587282141380342.kers
Total runtime 63 ms.
[2026-05-27 19:23:16] [INFO ] Implicit Places using invariants in 2311 ms returned []
[2026-05-27 19:23:16] [INFO ] Flow matrix only has 4162 transitions (discarded 20 similar events)
[2026-05-27 19:23:16] [INFO ] Invariant cache hit.
[2026-05-27 19:23:19] [INFO ] State equation strengthened by 2059 read => feed constraints.
[2026-05-27 19:23:21] [INFO ] Implicit Places using invariants and state equation in 4951 ms returned []
Implicit Place search using SMT with State Equation took 7264 ms to find 0 implicit places.
[2026-05-27 19:23:23] [INFO ] Redundant transitions in 1227 ms returned []
Running 4180 sub problems to find dead transitions.
[2026-05-27 19:23:23] [INFO ] Flow matrix only has 4162 transitions (discarded 20 similar events)
[2026-05-27 19:23:23] [INFO ] Invariant cache hit.
[2026-05-27 19:23:23] [INFO ] State equation strengthened by 2059 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4180 unsolved
SMT process timed out in 37036ms, After SMT, problems are : Problem set: 0 solved, 4180 unsolved
Search for dead transitions found 0 dead transitions in 37054ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/170 places, 4182/31279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53285 ms. Remains : 58/170 places, 4182/31279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 7973 ms.
Product exploration explored 100000 steps with 0 reset in 7949 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 3 factoid took 48 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 4376 ms. (9 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 821 ms. (48 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 109470 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 1
Probabilistic random walk after 109470 steps, saw 24806 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
[2026-05-27 19:24:20] [INFO ] Flow matrix only has 4162 transitions (discarded 20 similar events)
[2026-05-27 19:24:20] [INFO ] Invariant cache hit.
[2026-05-27 19:24:20] [INFO ] State equation strengthened by 2059 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/46 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/58 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4219/4220 variables, and 75 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2109 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 58/58 constraints, ReadFeed: 0/2059 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/46 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/58 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4219/4220 variables, and 75 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1793 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 58/58 constraints, ReadFeed: 0/2059 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3952ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1188 steps, including 42 resets, run visited all 1 properties in 108 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 110 ms.
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 3 factoid took 30 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 8738 ms.
FORMULA ErlangenMainframeV0-PT-1104-LTLFireability-05 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1104-LTLFireability-05 finished in 78053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 25 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 31279/31279 transitions.
Graph (trivial) has 99 edges and 170 vertex of which 4 / 170 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 167 transition count 31264
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 155 transition count 31264
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 25 place count 155 transition count 31245
Deduced a syphon composed of 19 places in 33 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 63 place count 136 transition count 31245
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 69 place count 130 transition count 22908
Iterating global reduction 2 with 6 rules applied. Total rules applied 75 place count 130 transition count 22908
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 130 transition count 22906
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 79 place count 128 transition count 11386
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 128 transition count 11386
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 127 transition count 11384
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 127 transition count 11384
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 4 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 167 place count 85 transition count 11342
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 171 place count 83 transition count 11353
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 172 place count 83 transition count 11352
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 177 place count 83 transition count 11352
Applied a total of 177 rules in 26137 ms. Remains 83 /170 variables (removed 87) and now considering 11352/31279 (removed 19927) transitions.
[2026-05-27 19:24:51] [INFO ] Flow matrix only has 11332 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-5772555187380622405.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7544304499076306287.kers'
[2026-05-27 19:24:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5772555187380622405.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7544304499076306287.kers]
Normalized transition count is 11331 out of 11332 initially.
Culled 0 columns in 47 ms.
// Phase 1: matrix 11331 rows 83 cols 279850 entries
Finished phase 1 with 53 SingleSign rule and 2 generalized
[2026-05-27 19:24:51] [INFO ] Computed 28 invariants in 174 ms
Computed 28 P flows in 175 ms.
Exported basis to /tmp/petrispot-output-7544304499076306287.kers
Total runtime 212 ms.
[2026-05-27 19:24:57] [INFO ] Implicit Places using invariants in 6444 ms returned []
Implicit Place search using SMT only with invariants took 6447 ms to find 0 implicit places.
Running 11350 sub problems to find dead transitions.
[2026-05-27 19:24:58] [INFO ] Flow matrix only has 11332 transitions (discarded 20 similar events)
[2026-05-27 19:24:58] [INFO ] Invariant cache hit.
[2026-05-27 19:24:58] [INFO ] State equation strengthened by 4619 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 82/11415 variables, and 11 constraints, problems are : Problem set: 0 solved, 11350 unsolved in 30397 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/83 constraints, ReadFeed: 0/4619 constraints, PredecessorRefiner: 11350/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11350 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 82/11415 variables, and 11 constraints, problems are : Problem set: 0 solved, 11350 unsolved in 30315 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/83 constraints, ReadFeed: 0/4619 constraints, PredecessorRefiner: 11317/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 86124ms problems are : Problem set: 0 solved, 11350 unsolved
Search for dead transitions found 0 dead transitions in 86466ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/170 places, 11352/31279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119261 ms. Remains : 83/170 places, 11352/31279 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)||p1))))'
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLFireability-06
Product exploration timeout after 56270 steps with 0 reset in 10002 ms.
Product exploration timeout after 57270 steps with 0 reset in 10002 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 9 factoid took 61 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 11003 ms. (3 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 889 ms. (44 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 894 ms. (44 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 537 ms. (74 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1204 ms. (33 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 146267 steps, run timeout after 9001 ms. (steps per millisecond=16 ) properties seen :0 out of 4
Probabilistic random walk after 146267 steps, saw 27247 distinct states, run finished after 9001 ms. (steps per millisecond=16 ) properties seen :0
[2026-05-27 19:26:57] [INFO ] Flow matrix only has 11332 transitions (discarded 20 similar events)
[2026-05-27 19:26:57] [INFO ] Invariant cache hit.
[2026-05-27 19:26:58] [INFO ] State equation strengthened by 4619 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 18/43 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/55 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 28/83 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11414/11415 variables, and 111 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 83/83 constraints, ReadFeed: 0/4619 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 18/43 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/55 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 28/83 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11414/11415 variables, and 111 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 83/83 constraints, ReadFeed: 0/4619 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10325ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 11352/11352 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 83 transition count 11350
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
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 4 place count 82 transition count 11358
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 82 transition count 11357
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 15 place count 82 transition count 11347
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 1 with 12 rules applied. Total rules applied 27 place count 72 transition count 11345
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 2 with 29 rules applied. Total rules applied 56 place count 72 transition count 11316
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 72 transition count 11316
Applied a total of 57 rules in 41287 ms. Remains 72 /83 variables (removed 11) and now considering 11316/11352 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41295 ms. Remains : 72/83 places, 11316/11352 transitions.
RANDOM walk for 40000 steps (8 resets) in 11580 ms. (3 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 714 ms. (55 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 702 ms. (56 steps per ms) remains 2/2 properties
[2026-05-27 19:27:52] [INFO ] Flow matrix only has 11313 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5833621050447793504.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7981418650922155767.kers'
[2026-05-27 19:27:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5833621050447793504.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7981418650922155767.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 73 ms.
// Phase 1: matrix 11313 rows 71 cols 279740 entries
Finished phase 1 with 42 SingleSign rule and 2 generalized
[2026-05-27 19:27:53] [INFO ] Computed 28 invariants in 248 ms
Computed 28 P flows in 249 ms.
Exported basis to /tmp/petrispot-output-7981418650922155767.kers
Total runtime 308 ms.
[2026-05-27 19:27:53] [INFO ] State equation strengthened by 4636 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/55 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/62 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/72 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 11313/11385 variables, 72/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/11385 variables, 4636/4736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/11385 variables, 0/4736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/11385 variables, 0/4736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11385/11385 variables, and 4736 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6919 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 72/72 constraints, ReadFeed: 4636/4636 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/55 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/62 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/72 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 11313/11385 variables, 72/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/11385 variables, 4636/4736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/11385 variables, 0/4736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/11385 variables, 0/4736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11385/11385 variables, and 4736 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11751 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 72/72 constraints, ReadFeed: 4636/4636 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19211ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1063 steps, including 43 resets, run visited all 2 properties in 676 ms. (steps per millisecond=1 )
Parikh walk visited 2 properties in 684 ms.
Knowledge based reduction with 9 factoid took 142 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 88533 ms.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 25 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 11352/11352 transitions.
Applied a total of 0 rules in 8081 ms. Remains 83 /83 variables (removed 0) and now considering 11352/11352 (removed 0) transitions.
[2026-05-27 19:28:21] [INFO ] Flow matrix only has 11332 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-15013146075319584034.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12741368325476774831.kers'
[2026-05-27 19:28:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15013146075319584034.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12741368325476774831.kers]
Normalized transition count is 11331 out of 11332 initially.
Culled 0 columns in 46 ms.
// Phase 1: matrix 11331 rows 83 cols 279850 entries
Finished phase 1 with 53 SingleSign rule and 2 generalized
[2026-05-27 19:28:21] [INFO ] Computed 28 invariants in 189 ms
Computed 28 P flows in 190 ms.
Exported basis to /tmp/petrispot-output-12741368325476774831.kers
Total runtime 225 ms.
[2026-05-27 19:28:28] [INFO ] Implicit Places using invariants in 7044 ms returned []
Implicit Place search using SMT only with invariants took 7045 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15127 ms. Remains : 83/83 places, 11352/11352 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 9 factoid took 75 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 8939 ms. (4 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 523 ms. (76 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 816 ms. (48 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 634 ms. (62 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1537 ms. (26 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 150113 steps, run timeout after 9001 ms. (steps per millisecond=16 ) properties seen :0 out of 4
Probabilistic random walk after 150113 steps, saw 27659 distinct states, run finished after 9001 ms. (steps per millisecond=16 ) properties seen :0
[2026-05-27 19:28:41] [INFO ] Flow matrix only has 11332 transitions (discarded 20 similar events)
[2026-05-27 19:28:41] [INFO ] Invariant cache hit.
[2026-05-27 19:28:41] [INFO ] State equation strengthened by 4619 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 18/43 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/55 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 28/83 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11414/11415 variables, and 111 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 83/83 constraints, ReadFeed: 0/4619 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 18/43 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/55 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 28/83 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11414/11415 variables, and 111 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 83/83 constraints, ReadFeed: 0/4619 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10138ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 11352/11352 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 83 transition count 11350
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 82 transition count 11358
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 82 transition count 11357
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 15 place count 82 transition count 11347
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 1 with 12 rules applied. Total rules applied 27 place count 72 transition count 11345
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 2 with 29 rules applied. Total rules applied 56 place count 72 transition count 11316
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 72 transition count 11316
Applied a total of 57 rules in 38650 ms. Remains 72 /83 variables (removed 11) and now considering 11316/11352 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38650 ms. Remains : 72/83 places, 11316/11352 transitions.
RANDOM walk for 40000 steps (8 resets) in 9659 ms. (4 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 807 ms. (49 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 869 ms. (45 steps per ms) remains 2/2 properties
[2026-05-27 19:29:32] [INFO ] Flow matrix only has 11313 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17220663263280730004.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7173680721747476799.kers'
[2026-05-27 19:29:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17220663263280730004.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7173680721747476799.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 45 ms.
// Phase 1: matrix 11313 rows 71 cols 279740 entries
Finished phase 1 with 42 SingleSign rule and 2 generalized
[2026-05-27 19:29:33] [INFO ] Computed 28 invariants in 160 ms
Computed 28 P flows in 161 ms.
Exported basis to /tmp/petrispot-output-7173680721747476799.kers
Total runtime 198 ms.
[2026-05-27 19:29:33] [INFO ] State equation strengthened by 4636 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/55 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/62 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/72 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 11313/11385 variables, 72/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/11385 variables, 4636/4736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/11385 variables, 0/4736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/11385 variables, 0/4736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11385/11385 variables, and 4736 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7774 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 72/72 constraints, ReadFeed: 4636/4636 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/55 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/62 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/72 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 11313/11385 variables, 72/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/11385 variables, 4636/4736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/11385 variables, 0/4736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/11385 variables, 0/4736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11385/11385 variables, and 4736 constraints, problems are : Problem set: 0 solved, 2 unsolved in 12515 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 72/72 constraints, ReadFeed: 4636/4636 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20634ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2001 steps, including 82 resets, run visited all 2 properties in 994 ms. (steps per millisecond=2 )
Parikh walk visited 2 properties in 998 ms.
Knowledge based reduction with 9 factoid took 93 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 86244 ms.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 53970 steps with 0 reset in 10001 ms.
Product exploration timeout after 56770 steps with 0 reset in 10001 ms.
Built C files in :
/tmp/ltsmin13605742522410667227
[2026-05-27 19:30:14] [INFO ] Too many transitions (11352) to apply POR reductions. Disabling POR matrices.
[2026-05-27 19:30:15] [INFO ] Built C files in 532ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13605742522410667227
Running compilation step : cd /tmp/ltsmin13605742522410667227;'/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/ltsmin13605742522410667227;'/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/ltsmin13605742522410667227;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 25 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 11352/11352 transitions.
Applied a total of 0 rules in 7111 ms. Remains 83 /83 variables (removed 0) and now considering 11352/11352 (removed 0) transitions.
[2026-05-27 19:30:25] [INFO ] Flow matrix only has 11332 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-8816231312663061182.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12063178398420829410.kers'
[2026-05-27 19:30:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8816231312663061182.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12063178398420829410.kers]
Normalized transition count is 11331 out of 11332 initially.
Culled 0 columns in 45 ms.
// Phase 1: matrix 11331 rows 83 cols 279850 entries
Finished phase 1 with 53 SingleSign rule and 2 generalized
[2026-05-27 19:30:25] [INFO ] Computed 28 invariants in 158 ms
Computed 28 P flows in 159 ms.
Exported basis to /tmp/petrispot-output-12063178398420829410.kers
Total runtime 197 ms.
[2026-05-27 19:30:30] [INFO ] Implicit Places using invariants in 5272 ms returned []
Implicit Place search using SMT only with invariants took 5279 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12391 ms. Remains : 83/83 places, 11352/11352 transitions.
Built C files in :
/tmp/ltsmin13782732827683917112
[2026-05-27 19:30:30] [INFO ] Too many transitions (11352) to apply POR reductions. Disabling POR matrices.
[2026-05-27 19:30:31] [INFO ] Built C files in 349ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13782732827683917112
Running compilation step : cd /tmp/ltsmin13782732827683917112;'/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/ltsmin13782732827683917112;'/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/ltsmin13782732827683917112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-27 19:30:41] [INFO ] Flatten gal took : 3891 ms
[2026-05-27 19:30:43] [INFO ] Flatten gal took : 1976 ms
[2026-05-27 19:30:43] [INFO ] Time to serialize gal into /tmp/LTL16595561920424604680.gal : 383 ms
[2026-05-27 19:30:43] [INFO ] Time to serialize properties into /tmp/LTL5391219577898646544.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16595561920424604680.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12896631778177983717.hoa' '-atoms' '/tmp/LTL5391219577898646544.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5391219577898646544.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12896631778177983717.hoa
Detected timeout of ITS tools.
[2026-05-27 19:31:04] [INFO ] Flatten gal took : 2730 ms
[2026-05-27 19:31:06] [INFO ] Flatten gal took : 1981 ms
[2026-05-27 19:31:06] [INFO ] Time to serialize gal into /tmp/LTL1090292517377755168.gal : 249 ms
[2026-05-27 19:31:06] [INFO ] Time to serialize properties into /tmp/LTL4153160165067289748.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/LTL1090292517377755168.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4153160165067289748.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(((((p17==0)||(p34==0))||((p43==0)||(p60==0)))||(((p73==0)||(p86==0))||((p99==0)||(p118==0))))||(((p131==0)||(p156==0))||((...348
Formula 0 simplified : G(F!"(((((p17==0)||(p34==0))||((p43==0)||(p60==0)))||(((p73==0)||(p86==0))||((p99==0)||(p118==0))))||(((p131==0)||(p156==0))||((p165...341
Detected timeout of ITS tools.
[2026-05-27 19:31:23] [INFO ] Flatten gal took : 1996 ms
[2026-05-27 19:31:23] [INFO ] Applying decomposition
[2026-05-27 19:31:26] [INFO ] Flatten gal took : 2167 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/graph5587833880183652960.txt' '-o' '/tmp/graph5587833880183652960.bin' '-w' '/tmp/graph5587833880183652960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5587833880183652960.bin' '-l' '-1' '-v' '-w' '/tmp/graph5587833880183652960.weights' '-q' '0' '-e' '0.001'
[2026-05-27 19:31:32] [INFO ] Decomposing Gal with order
[2026-05-27 19:31:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 19:31:36] [INFO ] Removed a total of 154171 redundant transitions.
[2026-05-27 19:31:36] [INFO ] Flatten gal took : 2747 ms
[2026-05-27 19:31:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 1774 ms.
[2026-05-27 19:31:39] [INFO ] Time to serialize gal into /tmp/LTL14153575896562176100.gal : 192 ms
[2026-05-27 19:31:39] [INFO ] Time to serialize properties into /tmp/LTL4738849835044044818.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/LTL14153575896562176100.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4738849835044044818.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(((((i1.u0.p17==0)||(i2.u3.p34==0))||((i1.u4.p43==0)||(i1.u7.p60==0)))||(((i2.u9.p73==0)||(i2.u11.p86==0))||((i2.u13.p99==0...513
Formula 0 simplified : G(F!"(((((i1.u0.p17==0)||(i2.u3.p34==0))||((i1.u4.p43==0)||(i1.u7.p60==0)))||(((i2.u9.p73==0)||(i2.u11.p86==0))||((i2.u13.p99==0)||(...506
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-1104-LTLFireability-06 finished in 449263 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 13 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 31279/31279 transitions.
Graph (trivial) has 99 edges and 170 vertex of which 4 / 170 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 167 transition count 31264
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 155 transition count 31264
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 25 place count 155 transition count 31245
Deduced a syphon composed of 19 places in 41 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 63 place count 136 transition count 31245
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 80 place count 119 transition count 20861
Ensure Unique test removed 11 places
Iterating global reduction 2 with 28 rules applied. Total rules applied 108 place count 108 transition count 20861
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 108 transition count 20859
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 114 place count 104 transition count 4219
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 104 transition count 4219
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 204 place count 61 transition count 4176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 60 transition count 4187
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 210 place count 60 transition count 4183
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 217 place count 60 transition count 4183
Applied a total of 217 rules in 7469 ms. Remains 60 /170 variables (removed 110) and now considering 4183/31279 (removed 27096) transitions.
[2026-05-27 19:32:01] [INFO ] Flow matrix only has 4163 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-18024053267754898570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12077855927526762079.kers'
[2026-05-27 19:32:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18024053267754898570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12077855927526762079.kers]
Normalized transition count is 4162 out of 4163 initially.
Culled 0 columns in 16 ms.
// Phase 1: matrix 4162 rows 60 cols 102684 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-27 19:32:01] [INFO ] Computed 17 invariants in 49 ms
Computed 17 P flows in 49 ms.
Exported basis to /tmp/petrispot-output-12077855927526762079.kers
Total runtime 63 ms.
[2026-05-27 19:32:04] [INFO ] Implicit Places using invariants in 2282 ms returned []
[2026-05-27 19:32:04] [INFO ] Flow matrix only has 4163 transitions (discarded 20 similar events)
[2026-05-27 19:32:04] [INFO ] Invariant cache hit.
[2026-05-27 19:32:06] [INFO ] State equation strengthened by 2059 read => feed constraints.
[2026-05-27 19:32:08] [INFO ] Implicit Places using invariants and state equation in 4557 ms returned []
Implicit Place search using SMT with State Equation took 6842 ms to find 0 implicit places.
[2026-05-27 19:32:09] [INFO ] Redundant transitions in 1135 ms returned []
Running 4181 sub problems to find dead transitions.
[2026-05-27 19:32:09] [INFO ] Flow matrix only has 4163 transitions (discarded 20 similar events)
[2026-05-27 19:32:09] [INFO ] Invariant cache hit.
[2026-05-27 19:32:09] [INFO ] State equation strengthened by 2059 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 59/4223 variables, and 0 constraints, problems are : Problem set: 0 solved, 4181 unsolved in 30123 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, State Equation: 0/60 constraints, ReadFeed: 0/2059 constraints, PredecessorRefiner: 4181/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 59/4223 variables, and 0 constraints, problems are : Problem set: 0 solved, 4181 unsolved in 30120 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, State Equation: 0/60 constraints, ReadFeed: 0/2059 constraints, PredecessorRefiner: 4146/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67584ms problems are : Problem set: 0 solved, 4181 unsolved
Search for dead transitions found 0 dead transitions in 67617ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/170 places, 4183/31279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83080 ms. Remains : 60/170 places, 4183/31279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLFireability-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1104-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1104-LTLFireability-07 finished in 83193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))&&G((G(p1)||X(p2)))))'
Support contains 33 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 31279/31279 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 169 transition count 27823
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 27823
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 168 transition count 20911
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 168 transition count 20911
Applied a total of 4 rules in 1045 ms. Remains 168 /170 variables (removed 2) and now considering 20911/31279 (removed 10368) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12169424993864041191.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7221710523092952714.kers'
[2026-05-27 19:33:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12169424993864041191.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7221710523092952714.kers]
Culled 0 columns in 88 ms.
// Phase 1: matrix 20911 rows 168 cols 525870 entries
Finished phase 1 with 137 SingleSign rule and 3 generalized
[2026-05-27 19:33:18] [INFO ] Computed 28 invariants in 338 ms
Computed 28 P flows in 338 ms.
Exported basis to /tmp/petrispot-output-7221710523092952714.kers
Total runtime 406 ms.
[2026-05-27 19:33:27] [INFO ] Implicit Places using invariants in 9336 ms returned []
Implicit Place search using SMT only with invariants took 9338 ms to find 0 implicit places.
Running 20910 sub problems to find dead transitions.
[2026-05-27 19:33:28] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 20910 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 167/21079 variables, and 11 constraints, problems are : Problem set: 0 solved, 20910 unsolved in 30461 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 20910/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20910 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 20910 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 167/21079 variables, and 11 constraints, problems are : Problem set: 0 solved, 20910 unsolved in 30389 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 20788/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 121536ms problems are : Problem set: 0 solved, 20910 unsolved
Search for dead transitions found 0 dead transitions in 121671ms
Starting structural reductions in LTL mode, iteration 1 : 168/170 places, 20911/31279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132113 ms. Remains : 168/170 places, 20911/31279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))&&G((G(p1)||X(p2)))))'
Stuttering acceptance computed with spot in 437 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p1) p2)]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLFireability-08
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1104-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1104-LTLFireability-08 finished in 132709 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(p0))))'
Support contains 12 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 31279/31279 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 166 transition count 22959
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 166 transition count 22959
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 162 transition count 6319
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 162 transition count 6319
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 159 transition count 6313
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 159 transition count 6313
Applied a total of 22 rules in 2070 ms. Remains 159 /170 variables (removed 11) and now considering 6313/31279 (removed 24966) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8595770929100556153.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13050222884507802460.kers'
[2026-05-27 19:35:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8595770929100556153.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13050222884507802460.kers]
Culled 0 columns in 25 ms.
// Phase 1: matrix 6313 rows 159 cols 156194 entries
Finished phase 1 with 129 SingleSign rule and 2 generalized
[2026-05-27 19:35:32] [INFO ] Computed 28 invariants in 95 ms
Computed 28 P flows in 95 ms.
Exported basis to /tmp/petrispot-output-13050222884507802460.kers
Total runtime 115 ms.
[2026-05-27 19:35:37] [INFO ] Implicit Places using invariants in 5719 ms returned []
[2026-05-27 19:35:37] [INFO ] Invariant cache hit.
[2026-05-27 19:35:49] [INFO ] Implicit Places using invariants and state equation in 11348 ms returned []
Implicit Place search using SMT with State Equation took 17069 ms to find 0 implicit places.
Running 6312 sub problems to find dead transitions.
[2026-05-27 19:35:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/6472 variables, and 11 constraints, problems are : Problem set: 0 solved, 6312 unsolved in 30176 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/159 constraints, PredecessorRefiner: 6312/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6312 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 158/6472 variables, and 11 constraints, problems are : Problem set: 0 solved, 6312 unsolved in 30176 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/159 constraints, PredecessorRefiner: 6196/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72719ms problems are : Problem set: 0 solved, 6312 unsolved
Search for dead transitions found 0 dead transitions in 72755ms
Starting structural reductions in LTL mode, iteration 1 : 159/170 places, 6313/31279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91910 ms. Remains : 159/170 places, 6313/31279 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(p0))))'
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 5442 ms.
Product exploration explored 100000 steps with 0 reset in 5275 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge based reduction with 2 factoid took 45 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 3018 ms. (13 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 67299 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 67299 steps, saw 45481 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2026-05-27 19:37:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/99 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 50/149 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/159 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6472/6472 variables, and 187 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3072 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/99 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 50/149 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/159 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6472/6472 variables, and 187 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2891 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6011ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 6313/6313 transitions.
Graph (trivial) has 107 edges and 159 vertex of which 6 / 159 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 156 transition count 6294
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 143 transition count 6294
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 143 transition count 6273
Deduced a syphon composed of 21 places in 4 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 69 place count 122 transition count 6273
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 119 transition count 4204
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 119 transition count 4204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 78 place count 119 transition count 4201
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 162 place count 77 transition count 4159
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 172 place count 72 transition count 4175
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 173 place count 72 transition count 4174
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 175 place count 72 transition count 4172
Free-agglomeration rule applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 191 place count 72 transition count 4156
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 225 place count 56 transition count 4138
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 240 place count 56 transition count 4123
Graph (complete) has 886 edges and 56 vertex of which 54 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.21 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 241 place count 54 transition count 4123
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 246 place count 54 transition count 4118
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 247 place count 54 transition count 4117
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 7 with 5 rules applied. Total rules applied 252 place count 53 transition count 4113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 253 place count 52 transition count 4112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 255 place count 50 transition count 4112
Applied a total of 255 rules in 12137 ms. Remains 50 /159 variables (removed 109) and now considering 4112/6313 (removed 2201) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12137 ms. Remains : 50/159 places, 4112/6313 transitions.
RANDOM walk for 40000 steps (8 resets) in 7853 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 376 ms. (106 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 89277 steps, run visited all 1 properties in 2594 ms. (steps per millisecond=34 )
Probabilistic random walk after 89277 steps, saw 15215 distinct states, run finished after 2606 ms. (steps per millisecond=34 ) properties seen :1
Knowledge based reduction with 2 factoid took 56 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 26983 ms.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 12 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 6313/6313 transitions.
Applied a total of 0 rules in 57 ms. Remains 159 /159 variables (removed 0) and now considering 6313/6313 (removed 0) transitions.
[2026-05-27 19:37:40] [INFO ] Invariant cache hit.
[2026-05-27 19:37:45] [INFO ] Implicit Places using invariants in 5671 ms returned []
[2026-05-27 19:37:45] [INFO ] Invariant cache hit.
[2026-05-27 19:37:57] [INFO ] Implicit Places using invariants and state equation in 11662 ms returned []
Implicit Place search using SMT with State Equation took 17335 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 17392 ms. Remains : 159/159 places, 6313/6313 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge based reduction with 2 factoid took 61 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 3229 ms. (12 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 67246 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 67246 steps, saw 45440 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2026-05-27 19:38:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/99 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 50/149 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/159 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6472/6472 variables, and 187 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2647 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/99 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 50/149 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/159 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6472/6472 variables, and 187 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2736 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5429ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 6313/6313 transitions.
Graph (trivial) has 107 edges and 159 vertex of which 6 / 159 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 156 transition count 6294
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 143 transition count 6294
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 143 transition count 6273
Deduced a syphon composed of 21 places in 5 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 69 place count 122 transition count 6273
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 119 transition count 4204
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 119 transition count 4204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 78 place count 119 transition count 4201
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 162 place count 77 transition count 4159
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 172 place count 72 transition count 4175
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 173 place count 72 transition count 4174
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 175 place count 72 transition count 4172
Free-agglomeration rule applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 191 place count 72 transition count 4156
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 225 place count 56 transition count 4138
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 240 place count 56 transition count 4123
Graph (complete) has 886 edges and 56 vertex of which 54 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 241 place count 54 transition count 4123
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 246 place count 54 transition count 4118
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 247 place count 54 transition count 4117
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 7 with 5 rules applied. Total rules applied 252 place count 53 transition count 4113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 253 place count 52 transition count 4112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 255 place count 50 transition count 4112
Applied a total of 255 rules in 12615 ms. Remains 50 /159 variables (removed 109) and now considering 4112/6313 (removed 2201) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12615 ms. Remains : 50/159 places, 4112/6313 transitions.
RANDOM walk for 40000 steps (8 resets) in 7871 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 380 ms. (104 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 89277 steps, run visited all 1 properties in 2600 ms. (steps per millisecond=34 )
Probabilistic random walk after 89277 steps, saw 15215 distinct states, run finished after 2600 ms. (steps per millisecond=34 ) properties seen :1
Knowledge based reduction with 2 factoid took 53 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 27035 ms.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 5434 ms.
Product exploration explored 100000 steps with 0 reset in 5292 ms.
Spot run failed in 52 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/ltsmin14639671591242962603
[2026-05-27 19:38:35] [INFO ] Built C files in 119ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14639671591242962603
Running compilation step : cd /tmp/ltsmin14639671591242962603;'/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/ltsmin14639671591242962603;'/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/ltsmin14639671591242962603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 12 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 6313/6313 transitions.
Applied a total of 0 rules in 47 ms. Remains 159 /159 variables (removed 0) and now considering 6313/6313 (removed 0) transitions.
[2026-05-27 19:38:38] [INFO ] Invariant cache hit.
[2026-05-27 19:38:43] [INFO ] Implicit Places using invariants in 5057 ms returned []
[2026-05-27 19:38:43] [INFO ] Invariant cache hit.
[2026-05-27 19:38:54] [INFO ] Implicit Places using invariants and state equation in 10517 ms returned []
Implicit Place search using SMT with State Equation took 15583 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 15631 ms. Remains : 159/159 places, 6313/6313 transitions.
Built C files in :
/tmp/ltsmin11219298730966512744
[2026-05-27 19:38:54] [INFO ] Built C files in 192ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11219298730966512744
Running compilation step : cd /tmp/ltsmin11219298730966512744;'/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/ltsmin11219298730966512744;'/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/ltsmin11219298730966512744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-27 19:39:01] [INFO ] Flatten gal took : 1125 ms
[2026-05-27 19:39:01] [INFO ] Flatten gal took : 782 ms
[2026-05-27 19:39:02] [INFO ] Time to serialize gal into /tmp/LTL16909045246487529713.gal : 144 ms
[2026-05-27 19:39:02] [INFO ] Time to serialize properties into /tmp/LTL16873877430820984363.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/LTL16909045246487529713.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2660809115684574138.hoa' '-atoms' '/tmp/LTL16873877430820984363.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16873877430820984363.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2660809115684574138.hoa
Detected timeout of ITS tools.
[2026-05-27 19:39:21] [INFO ] Flatten gal took : 1053 ms
[2026-05-27 19:39:22] [INFO ] Flatten gal took : 918 ms
[2026-05-27 19:39:22] [INFO ] Time to serialize gal into /tmp/LTL4194462775980975579.gal : 142 ms
[2026-05-27 19:39:22] [INFO ] Time to serialize properties into /tmp/LTL2816613214000250689.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/LTL4194462775980975579.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2816613214000250689.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(((((p17==0)||(p34==0))||((p47==0)||(p56==0)))||(((p73==0)||(p82==0))||((p95==0)||(p118==0))))||(((p127==0)||(p146==0))||((p...182
Formula 0 simplified : XXF!"(((((p17==0)||(p34==0))||((p47==0)||(p56==0)))||(((p73==0)||(p82==0))||((p95==0)||(p118==0))))||(((p127==0)||(p146==0))||((p165...174
Detected timeout of ITS tools.
[2026-05-27 19:39:38] [INFO ] Flatten gal took : 983 ms
[2026-05-27 19:39:38] [INFO ] Applying decomposition
[2026-05-27 19:39:39] [INFO ] Flatten gal took : 815 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/graph7958514706865127745.txt' '-o' '/tmp/graph7958514706865127745.bin' '-w' '/tmp/graph7958514706865127745.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7958514706865127745.bin' '-l' '-1' '-v' '-w' '/tmp/graph7958514706865127745.weights' '-q' '0' '-e' '0.001'
[2026-05-27 19:39:41] [INFO ] Decomposing Gal with order
[2026-05-27 19:39:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 19:39:43] [INFO ] Removed a total of 89197 redundant transitions.
[2026-05-27 19:39:43] [INFO ] Flatten gal took : 1383 ms
[2026-05-27 19:39:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 1164 ms.
[2026-05-27 19:39:45] [INFO ] Time to serialize gal into /tmp/LTL15733900316174353205.gal : 52 ms
[2026-05-27 19:39:45] [INFO ] Time to serialize properties into /tmp/LTL6966508409962786549.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/LTL15733900316174353205.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6966508409962786549.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(((((i7.u8.p17==0)||(i5.u12.p34==0))||((i7.u15.p47==0)||(i5.u17.p56==0)))||(((i5.u21.p73==0)||(i5.u23.p82==0))||((i5.u26.p95...265
Formula 0 simplified : XXF!"(((((i7.u8.p17==0)||(i5.u12.p34==0))||((i7.u15.p47==0)||(i5.u17.p56==0)))||(((i5.u21.p73==0)||(i5.u23.p82==0))||((i5.u26.p95==0...257
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-1104-LTLFireability-09 finished in 270134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((p0 U p1))||G(p2)) U X(p3)))'
Support contains 37 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 31279/31279 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 166 transition count 22959
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 166 transition count 22959
Applied a total of 8 rules in 714 ms. Remains 166 /170 variables (removed 4) and now considering 22959/31279 (removed 8320) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11007632710525880419.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1111346617798659198.kers'
[2026-05-27 19:40:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11007632710525880419.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1111346617798659198.kers]
Culled 0 columns in 97 ms.
// Phase 1: matrix 22959 rows 166 cols 588846 entries
Finished phase 1 with 136 SingleSign rule and 2 generalized
[2026-05-27 19:40:01] [INFO ] Computed 28 invariants in 362 ms
Computed 28 P flows in 362 ms.
Exported basis to /tmp/petrispot-output-1111346617798659198.kers
Total runtime 433 ms.
[2026-05-27 19:40:05] [INFO ] Implicit Places using invariants in 4265 ms returned []
Implicit Place search using SMT only with invariants took 4266 ms to find 0 implicit places.
Running 22958 sub problems to find dead transitions.
[2026-05-27 19:40:05] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 22958 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 165/23125 variables, and 11 constraints, problems are : Problem set: 0 solved, 22958 unsolved in 30571 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/166 constraints, PredecessorRefiner: 22958/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 22958 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 165/23125 variables, and 11 constraints, problems are : Problem set: 0 solved, 22958 unsolved in 30566 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/166 constraints, PredecessorRefiner: 22836/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 125450ms problems are : Problem set: 0 solved, 22958 unsolved
Search for dead transitions found 0 dead transitions in 125596ms
Starting structural reductions in LTL mode, iteration 1 : 166/170 places, 22959/31279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130636 ms. Remains : 166/170 places, 22959/31279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((p0 U p1))||G(p2)) U X(p3)))'
Stuttering acceptance computed with spot in 278 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1104-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1104-LTLFireability-10 finished in 131047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 18 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 31279/31279 transitions.
Applied a total of 0 rules in 251 ms. Remains 170 /170 variables (removed 0) and now considering 31279/31279 (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-4617713001156077607.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12069671551019220741.kers'
[2026-05-27 19:42:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4617713001156077607.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12069671551019220741.kers]
Culled 0 columns in 228 ms.
// Phase 1: matrix 31279 rows 170 cols 788526 entries
Finished phase 1 with 139 SingleSign rule and 3 generalized
[2026-05-27 19:42:12] [INFO ] Computed 28 invariants in 721 ms
Computed 28 P flows in 721 ms.
Exported basis to /tmp/petrispot-output-12069671551019220741.kers
Total runtime 891 ms.
[2026-05-27 19:42:35] [INFO ] Implicit Places using invariants in 23539 ms returned []
Implicit Place search using SMT only with invariants took 23540 ms to find 0 implicit places.
Running 31278 sub problems to find dead transitions.
[2026-05-27 19:42:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 31278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 169/31449 variables, and 11 constraints, problems are : Problem set: 0 solved, 31278 unsolved in 30614 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 31278/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 31278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 169/31449 variables, and 11 constraints, problems are : Problem set: 0 solved, 31278 unsolved in 30761 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 31156/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 173622ms problems are : Problem set: 0 solved, 31278 unsolved
Search for dead transitions found 0 dead transitions in 173768ms
Finished structural reductions in LTL mode , in 1 iterations and 197618 ms. Remains : 170/170 places, 31279/31279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||p1)))'
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLFireability-11
Product exploration timeout after 39550 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 2 ms.
FORMULA ErlangenMainframeV0-PT-1104-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1104-LTLFireability-11 finished in 207861 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(((p1 U p2)&&p0)))'
Support contains 25 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 31279/31279 transitions.
Graph (trivial) has 99 edges and 170 vertex of which 4 / 170 are part of one of the 2 SCC in 1 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 167 transition count 31264
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 155 transition count 31264
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 25 place count 155 transition count 31245
Deduced a syphon composed of 19 places in 40 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 63 place count 136 transition count 31245
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 69 place count 130 transition count 22908
Iterating global reduction 2 with 6 rules applied. Total rules applied 75 place count 130 transition count 22908
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 130 transition count 22906
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 129 transition count 15994
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 129 transition count 15994
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 4 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 165 place count 86 transition count 15951
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 167 place count 85 transition count 15962
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 168 place count 85 transition count 15961
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 174 place count 85 transition count 15961
Applied a total of 174 rules in 36337 ms. Remains 85 /170 variables (removed 85) and now considering 15961/31279 (removed 15318) transitions.
[2026-05-27 19:46:15] [INFO ] Flow matrix only has 15941 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-3152406622635294988.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18418167433415286683.kers'
[2026-05-27 19:46:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3152406622635294988.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18418167433415286683.kers]
Normalized transition count is 15940 out of 15941 initially.
Culled 0 columns in 64 ms.
// Phase 1: matrix 15940 rows 85 cols 395052 entries
Finished phase 1 with 55 SingleSign rule and 2 generalized
[2026-05-27 19:46:15] [INFO ] Computed 28 invariants in 220 ms
Computed 28 P flows in 221 ms.
Exported basis to /tmp/petrispot-output-18418167433415286683.kers
Total runtime 269 ms.
[2026-05-27 19:46:24] [INFO ] Implicit Places using invariants in 8524 ms returned []
Implicit Place search using SMT only with invariants took 8525 ms to find 0 implicit places.
Running 15959 sub problems to find dead transitions.
[2026-05-27 19:46:24] [INFO ] Flow matrix only has 15941 transitions (discarded 20 similar events)
[2026-05-27 19:46:24] [INFO ] Invariant cache hit.
[2026-05-27 19:46:24] [INFO ] State equation strengthened by 6923 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/16026 variables, and 11 constraints, problems are : Problem set: 0 solved, 15959 unsolved in 30407 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/85 constraints, ReadFeed: 0/6923 constraints, PredecessorRefiner: 15959/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15959 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 84/16026 variables, and 11 constraints, problems are : Problem set: 0 solved, 15959 unsolved in 30252 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/85 constraints, ReadFeed: 0/6923 constraints, PredecessorRefiner: 15925/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 98070ms problems are : Problem set: 0 solved, 15959 unsolved
Search for dead transitions found 0 dead transitions in 98169ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/170 places, 15961/31279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143070 ms. Remains : 85/170 places, 15961/31279 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(((p1 U p2)&&p0)))'
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1104-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1104-LTLFireability-12 finished in 143209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U !(p0 U p1))&&X(X(G((p1 U X(p2)))))))'
Support contains 33 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 31279/31279 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 166 transition count 22959
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 166 transition count 22959
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 165 transition count 16047
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 165 transition count 16047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 164 transition count 16045
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 164 transition count 16045
Applied a total of 12 rules in 1193 ms. Remains 164 /170 variables (removed 6) and now considering 16045/31279 (removed 15234) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16334373752414491965.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14574580374041098371.kers'
[2026-05-27 19:48:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16334373752414491965.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14574580374041098371.kers]
Culled 0 columns in 66 ms.
// Phase 1: matrix 16045 rows 164 cols 409130 entries
Finished phase 1 with 134 SingleSign rule and 2 generalized
[2026-05-27 19:48:03] [INFO ] Computed 28 invariants in 237 ms
Computed 28 P flows in 238 ms.
Exported basis to /tmp/petrispot-output-14574580374041098371.kers
Total runtime 290 ms.
[2026-05-27 19:48:08] [INFO ] Implicit Places using invariants in 5177 ms returned []
Implicit Place search using SMT only with invariants took 5178 ms to find 0 implicit places.
Running 16044 sub problems to find dead transitions.
[2026-05-27 19:48:08] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16044 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 163/16209 variables, and 11 constraints, problems are : Problem set: 0 solved, 16044 unsolved in 30436 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/164 constraints, PredecessorRefiner: 16044/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16044 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16044 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 163/16209 variables, and 11 constraints, problems are : Problem set: 0 solved, 16044 unsolved in 30454 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/164 constraints, PredecessorRefiner: 15924/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 99020ms problems are : Problem set: 0 solved, 16044 unsolved
Search for dead transitions found 0 dead transitions in 99122ms
Starting structural reductions in LTL mode, iteration 1 : 164/170 places, 16045/31279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105531 ms. Remains : 164/170 places, 16045/31279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U !(p0 U p1))&&X(X(G((p1 U X(p2)))))))'
Stuttering acceptance computed with spot in 436 ms :[(OR (NOT p2) p1), (NOT p0), p1, (NOT p2), (AND p1 (NOT p0)), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLFireability-13
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1104-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1104-LTLFireability-13 finished in 106098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(p1))))'
Support contains 21 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 31279/31279 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 155 transition count 20912
Ensure Unique test removed 11 places
Iterating global reduction 0 with 26 rules applied. Total rules applied 41 place count 144 transition count 20912
Applied a total of 41 rules in 2063 ms. Remains 144 /170 variables (removed 26) and now considering 20912/31279 (removed 10367) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13251054556334968552.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3048435404455649969.kers'
[2026-05-27 19:49:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13251054556334968552.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3048435404455649969.kers]
Culled 0 columns in 53 ms.
// Phase 1: matrix 20912 rows 144 cols 311611 entries
Finished phase 1 with 127 SingleSign rule and 0 generalized
[2026-05-27 19:49:50] [INFO ] Computed 17 invariants in 285 ms
Computed 17 P flows in 287 ms.
Exported basis to /tmp/petrispot-output-3048435404455649969.kers
Total runtime 327 ms.
[2026-05-27 19:49:55] [INFO ] Implicit Places using invariants in 5294 ms returned []
Implicit Place search using SMT only with invariants took 5295 ms to find 0 implicit places.
Running 20911 sub problems to find dead transitions.
[2026-05-27 19:49:56] [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 143/21056 variables, and 0 constraints, problems are : Problem set: 0 solved, 20911 unsolved in 30520 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, State Equation: 0/144 constraints, PredecessorRefiner: 20911/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20911 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 143/21056 variables, and 0 constraints, problems are : Problem set: 0 solved, 20911 unsolved in 30379 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, State Equation: 0/144 constraints, PredecessorRefiner: 20777/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 123036ms problems are : Problem set: 0 solved, 20911 unsolved
Search for dead transitions found 0 dead transitions in 123140ms
Starting structural reductions in LTL mode, iteration 1 : 144/170 places, 20912/31279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130539 ms. Remains : 144/170 places, 20912/31279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(p1))))'
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1104-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1104-LTLFireability-15 finished in 130881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(X((!p1&&X(!p2)))))))'
Spot run failed in 84 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' '!(G(F((p0||G(p1)))))'
Spot run failed in 78 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(p0))))'
Spot run failed in 77 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-27 19:52:04] [INFO ] Flatten gal took : 4254 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17039033329092602952
[2026-05-27 19:52:06] [INFO ] Too many transitions (31279) to apply POR reductions. Disabling POR matrices.
[2026-05-27 19:52:07] [INFO ] Built C files in 588ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17039033329092602952
Running compilation step : cd /tmp/ltsmin17039033329092602952;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' '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-27 19:52:09] [INFO ] Applying decomposition
[2026-05-27 19:52:15] [INFO ] Flatten gal took : 5638 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/graph13699947305356703692.txt' '-o' '/tmp/graph13699947305356703692.bin' '-w' '/tmp/graph13699947305356703692.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13699947305356703692.bin' '-l' '-1' '-v' '-w' '/tmp/graph13699947305356703692.weights' '-q' '0' '-e' '0.001'
[2026-05-27 19:52:29] [INFO ] Decomposing Gal with order
[2026-05-27 19:52:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 19:52:40] [INFO ] Removed a total of 451130 redundant transitions.
[2026-05-27 19:52:41] [INFO ] Flatten gal took : 8571 ms
[2026-05-27 19:52:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 7795 ms.
[2026-05-27 19:52:49] [INFO ] Time to serialize gal into /tmp/LTLFireability14785501271296080998.gal : 257 ms
[2026-05-27 19:52:49] [INFO ] Time to serialize properties into /tmp/LTLFireability13823617061343349262.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/LTLFireability14785501271296080998.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13823617061343349262.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...278
Read 3 LTL properties
Checking formula 0 : !((G((F("(((((i3.u7.p18==1)&&(i3.u12.p35==1))&&((i4.u15.p48==1)&&(i4.u17.p57==1)))&&(((i3.u21.p74==1)&&(i3.u22.p83==1))&&((i5.u25.p96=...1045
Formula 0 simplified : F(G!"(((((i3.u7.p18==1)&&(i3.u12.p35==1))&&((i4.u15.p48==1)&&(i4.u17.p57==1)))&&(((i3.u21.p74==1)&&(i3.u22.p83==1))&&((i5.u25.p96==1...1026
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/ltsmin17039033329092602952;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' '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 240 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17039033329092602952;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' '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 240 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)

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

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

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