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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9248.071 3600000.00 4502995.00 8221.10 FFF?T?FFF????TFF 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-177955740700532.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-1203, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740700532
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 57M
-rw-r--r-- 1 mcc users 7.0K Mar 7 05:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 7 05:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 05:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 05:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 09:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Mar 7 05:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 7 05:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 7 05:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K Mar 7 05:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:58 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 57M 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-1203-LTLFireability-00
FORMULA_NAME ErlangenMainframeV0-PT-1203-LTLFireability-01
FORMULA_NAME ErlangenMainframeV0-PT-1203-LTLFireability-02
FORMULA_NAME ErlangenMainframeV0-PT-1203-LTLFireability-03
FORMULA_NAME ErlangenMainframeV0-PT-1203-LTLFireability-04
FORMULA_NAME ErlangenMainframeV0-PT-1203-LTLFireability-05
FORMULA_NAME ErlangenMainframeV0-PT-1203-LTLFireability-06
FORMULA_NAME ErlangenMainframeV0-PT-1203-LTLFireability-07
FORMULA_NAME ErlangenMainframeV0-PT-1203-LTLFireability-08
FORMULA_NAME ErlangenMainframeV0-PT-1203-LTLFireability-09
FORMULA_NAME ErlangenMainframeV0-PT-1203-LTLFireability-10
FORMULA_NAME ErlangenMainframeV0-PT-1203-LTLFireability-11
FORMULA_NAME ErlangenMainframeV0-PT-1203-LTLFireability-12
FORMULA_NAME ErlangenMainframeV0-PT-1203-LTLFireability-13
FORMULA_NAME ErlangenMainframeV0-PT-1203-LTLFireability-14
FORMULA_NAME ErlangenMainframeV0-PT-1203-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779940534703

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-1203
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-28 03:55:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-28 03:55:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 03:55:40] [INFO ] Load time of PNML (sax parser for PT used): 3113 ms
[2026-05-28 03:55:40] [INFO ] Transformed 289 places.
[2026-05-28 03:55:40] [INFO ] Transformed 41764 transitions.
[2026-05-28 03:55:40] [INFO ] Found NUPN structural information;
[2026-05-28 03:55:40] [INFO ] Parsed PT model containing 289 places and 41764 transitions and 1134359 arcs in 3695 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 100 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ErlangenMainframeV0-PT-1203-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1203-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1203-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1203-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 41764/41764 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 219 transition count 41694
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 219 transition count 41694
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 180 place count 179 transition count 41654
Iterating global reduction 0 with 40 rules applied. Total rules applied 220 place count 179 transition count 41654
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 223 place count 176 transition count 41651
Iterating global reduction 0 with 3 rules applied. Total rules applied 226 place count 176 transition count 41651
Applied a total of 226 rules in 1583 ms. Remains 176 /289 variables (removed 113) and now considering 41651/41764 (removed 113) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7373531021195007783.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1339770718311804464.kers'
[2026-05-28 03:55:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7373531021195007783.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1339770718311804464.kers]
Culled 0 columns in 199 ms.
// Phase 1: matrix 41651 rows 176 cols 1134133 entries
Finished phase 1 with 143 SingleSign rule and 3 generalized
[2026-05-28 03:55:44] [INFO ] Computed 30 invariants in 843 ms
Computed 30 P flows in 844 ms.
Exported basis to /tmp/petrispot-output-1339770718311804464.kers
Total runtime 996 ms.
[2026-05-28 03:55:44] [INFO ] Implicit Places using invariants in 1860 ms returned []
Implicit Place search using SMT only with invariants took 1913 ms to find 0 implicit places.
Running 41650 sub problems to find dead transitions.
[2026-05-28 03:55:45] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 41650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 175/41827 variables, and 12 constraints, problems are : Problem set: 0 solved, 41650 unsolved in 31105 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/176 constraints, PredecessorRefiner: 41650/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 41650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 175/41827 variables, and 12 constraints, problems are : Problem set: 0 solved, 41650 unsolved in 31021 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/176 constraints, PredecessorRefiner: 41525/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 230580ms problems are : Problem set: 0 solved, 41650 unsolved
Search for dead transitions found 0 dead transitions in 231087ms
Starting structural reductions in LTL mode, iteration 1 : 176/289 places, 41651/41764 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234978 ms. Remains : 176/289 places, 41651/41764 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 41651/41651 transitions.
Applied a total of 0 rules in 235 ms. Remains 176 /176 variables (removed 0) and now considering 41651/41651 (removed 0) transitions.
[2026-05-28 03:59:36] [INFO ] Invariant cache hit.
[2026-05-28 03:59:36] [INFO ] Implicit Places using invariants in 139 ms returned []
Implicit Place search using SMT only with invariants took 140 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 386 ms. Remains : 176/176 places, 41651/41651 transitions.
Support contains 58 out of 176 places after structural reductions.
[2026-05-28 03:59:45] [INFO ] Flatten gal took : 7276 ms
[2026-05-28 03:59:51] [INFO ] Flatten gal took : 6068 ms
[2026-05-28 04:00:01] [INFO ] Input system was already deterministic with 41651 transitions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 40000 steps (8 resets) in 25395 ms. (1 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 88 ms. (44 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 83 ms. (47 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 88 ms. (44 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 53393 steps, run timeout after 24001 ms. (steps per millisecond=2 ) properties seen :0 out of 29
Probabilistic random walk after 53393 steps, saw 37192 distinct states, run finished after 24012 ms. (steps per millisecond=2 ) properties seen :0
[2026-05-28 04:00:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 81/139 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 139/41827 variables, and 26 constraints, problems are : Problem set: 0 solved, 29 unsolved in 5039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/176 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/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 81/139 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 139/41827 variables, and 26 constraints, problems are : Problem set: 0 solved, 29 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/176 constraints, PredecessorRefiner: 29/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10731ms problems are : Problem set: 0 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 58 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 41651/41651 transitions.
Graph (trivial) has 85 edges and 176 vertex of which 4 / 176 are part of one of the 2 SCC in 26 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 174 transition count 41634
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 161 transition count 41634
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 27 place count 161 transition count 41614
Deduced a syphon composed of 20 places in 78 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 67 place count 141 transition count 41614
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 139 transition count 41597
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 139 transition count 41597
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 139 transition count 41595
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 17 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 143 place count 104 transition count 41560
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 2 places in 17 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 102 transition count 41575
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 152 place count 102 transition count 41570
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 159 place count 97 transition count 41568
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 161 place count 97 transition count 41568
Partial Post-agglomeration rule applied 12 times.
Drop transitions (Partial Post agglomeration) removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 173 place count 97 transition count 41568
Applied a total of 173 rules in 10659 ms. Remains 97 /176 variables (removed 79) and now considering 41568/41651 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10663 ms. Remains : 97/176 places, 41568/41651 transitions.
RANDOM walk for 40000 steps (8 resets) in 41350 ms. (0 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 594 ms. (6 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 475 ms. (8 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 501 ms. (7 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 670 ms. (5 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 383 ms. (10 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 496 ms. (8 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 440 ms. (9 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 426 ms. (9 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 366 ms. (10 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 361 ms. (11 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 421 ms. (9 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 396 ms. (10 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 344 ms. (11 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 428 ms. (9 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 404 ms. (9 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 441 ms. (9 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 392 ms. (10 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 4002 steps (8 resets) in 384 ms. (10 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 415 ms. (9 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 397 ms. (10 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 472 ms. (8 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 413 ms. (9 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 500 ms. (7 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 506 ms. (7 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 386 ms. (10 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 412 ms. (9 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 495 ms. (8 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 450 ms. (8 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 188530 steps, run timeout after 42001 ms. (steps per millisecond=4 ) properties seen :0 out of 29
Probabilistic random walk after 188530 steps, saw 28986 distinct states, run finished after 42002 ms. (steps per millisecond=4 ) properties seen :0
[2026-05-28 04:01:52] [INFO ] Flow matrix only has 41549 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9921564236095106725.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12938747832769331244.kers'
[2026-05-28 04:01:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9921564236095106725.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12938747832769331244.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 317 ms.
// Phase 1: matrix 41549 rows 96 cols 1133862 entries
Finished phase 1 with 64 SingleSign rule and 3 generalized
[2026-05-28 04:01:54] [INFO ] Computed 30 invariants in 1048 ms
Computed 30 P flows in 1049 ms.
Exported basis to /tmp/petrispot-output-12938747832769331244.kers
Total runtime 1220 ms.
[2026-05-28 04:01:54] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 6/64 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 7/71 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 26/97 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 41646/41646 variables, and 127 constraints, problems are : Problem set: 0 solved, 29 unsolved in 45020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 97/97 constraints, ReadFeed: 0/32 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/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 6/64 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 7/71 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 26/97 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 41646/41646 variables, and 127 constraints, problems are : Problem set: 0 solved, 29 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 97/97 constraints, ReadFeed: 0/32 constraints, PredecessorRefiner: 29/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 92059ms problems are : Problem set: 0 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 58 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 41568/41568 transitions.
Applied a total of 0 rules in 1409 ms. Remains 97 /97 variables (removed 0) and now considering 41568/41568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1409 ms. Remains : 97/97 places, 41568/41568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 41568/41568 transitions.
Applied a total of 0 rules in 1134 ms. Remains 97 /97 variables (removed 0) and now considering 41568/41568 (removed 0) transitions.
[2026-05-28 04:03:27] [INFO ] Flow matrix only has 41549 transitions (discarded 19 similar events)
[2026-05-28 04:03:27] [INFO ] Invariant cache hit.
[2026-05-28 04:03:27] [INFO ] Implicit Places using invariants in 175 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 280 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 96/97 places, 41568/41568 transitions.
Applied a total of 0 rules in 1531 ms. Remains 96 /96 variables (removed 0) and now considering 41568/41568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2961 ms. Remains : 96/97 places, 41568/41568 transitions.
Computed a total of 24 stabilizing places and 24 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' '!((G(p0) U X((X(!p2)&&p1))))'
Support contains 30 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 41651/41651 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 173 transition count 31923
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 173 transition count 31923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 172 transition count 22707
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 172 transition count 22707
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 171 transition count 22705
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 171 transition count 22705
Applied a total of 10 rules in 1676 ms. Remains 171 /176 variables (removed 5) and now considering 22705/41651 (removed 18946) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12852686906679241064.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11164964138431502117.kers'
[2026-05-28 04:03:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12852686906679241064.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11164964138431502117.kers]
Culled 0 columns in 180 ms.
// Phase 1: matrix 22705 rows 171 cols 623153 entries
Finished phase 1 with 139 SingleSign rule and 2 generalized
[2026-05-28 04:03:32] [INFO ] Computed 30 invariants in 605 ms
Computed 30 P flows in 606 ms.
Exported basis to /tmp/petrispot-output-11164964138431502117.kers
Total runtime 741 ms.
[2026-05-28 04:03:42] [INFO ] Implicit Places using invariants in 10568 ms returned []
Implicit Place search using SMT only with invariants took 10570 ms to find 0 implicit places.
Running 22704 sub problems to find dead transitions.
[2026-05-28 04:03:42] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 22704 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/22876 variables, and 12 constraints, problems are : Problem set: 0 solved, 22704 unsolved in 30403 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/171 constraints, PredecessorRefiner: 22704/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22704 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 22704 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/22876 variables, and 12 constraints, problems are : Problem set: 0 solved, 22704 unsolved in 30395 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/171 constraints, PredecessorRefiner: 22581/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 122684ms problems are : Problem set: 0 solved, 22704 unsolved
Search for dead transitions found 0 dead transitions in 122880ms
Starting structural reductions in LTL mode, iteration 1 : 171/176 places, 22705/41651 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135258 ms. Remains : 171/176 places, 22705/41651 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((X(!p2)&&p1))))'
Stuttering acceptance computed with spot in 629 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), true, p2, (NOT p0), p2]
Running random walk in product with property : ErlangenMainframeV0-PT-1203-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA ErlangenMainframeV0-PT-1203-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1203-LTLFireability-00 finished in 136122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 27 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 41651/41651 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 173 transition count 31923
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 173 transition count 31923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 172 transition count 22707
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 172 transition count 22707
Applied a total of 8 rules in 1620 ms. Remains 172 /176 variables (removed 4) and now considering 22707/41651 (removed 18944) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17980969860320354256.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18357957265820191921.kers'
[2026-05-28 04:05:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17980969860320354256.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18357957265820191921.kers]
Culled 0 columns in 105 ms.
// Phase 1: matrix 22707 rows 172 cols 623157 entries
Finished phase 1 with 140 SingleSign rule and 2 generalized
[2026-05-28 04:05:48] [INFO ] Computed 30 invariants in 407 ms
Computed 30 P flows in 408 ms.
Exported basis to /tmp/petrispot-output-18357957265820191921.kers
Total runtime 547 ms.
[2026-05-28 04:06:01] [INFO ] Implicit Places using invariants in 13631 ms returned []
Implicit Place search using SMT only with invariants took 13638 ms to find 0 implicit places.
Running 22706 sub problems to find dead transitions.
[2026-05-28 04:06:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 22706 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/22879 variables, and 12 constraints, problems are : Problem set: 0 solved, 22706 unsolved in 30595 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/172 constraints, PredecessorRefiner: 22706/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22706 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 22706 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/22879 variables, and 12 constraints, problems are : Problem set: 0 solved, 22706 unsolved in 30461 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/172 constraints, PredecessorRefiner: 22581/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 124506ms problems are : Problem set: 0 solved, 22706 unsolved
Search for dead transitions found 0 dead transitions in 124655ms
Starting structural reductions in LTL mode, iteration 1 : 172/176 places, 22707/41651 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139994 ms. Remains : 172/176 places, 22707/41651 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Stuttering acceptance computed with spot in 186 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-1203-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ErlangenMainframeV0-PT-1203-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1203-LTLFireability-01 finished in 140371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 14 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 41651/41651 transitions.
Graph (trivial) has 101 edges and 176 vertex of which 4 / 176 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 173 transition count 41636
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 161 transition count 41636
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 25 place count 161 transition count 41616
Deduced a syphon composed of 20 places in 65 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 65 place count 141 transition count 41616
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 82 place count 124 transition count 27776
Ensure Unique test removed 12 places
Iterating global reduction 2 with 29 rules applied. Total rules applied 111 place count 112 transition count 27776
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 112 transition count 27774
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 116 place count 109 transition count 8318
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 109 transition count 8318
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 122 place count 106 transition count 8312
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 106 transition count 8312
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 205 place count 66 transition count 8272
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 213 place count 62 transition count 8283
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 219 place count 62 transition count 8283
Applied a total of 219 rules in 13035 ms. Remains 62 /176 variables (removed 114) and now considering 8283/41651 (removed 33368) transitions.
[2026-05-28 04:08:19] [INFO ] Flow matrix only has 8263 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-3310416601621541174.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13363461966650289007.kers'
[2026-05-28 04:08:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3310416601621541174.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13363461966650289007.kers]
Normalized transition count is 8262 out of 8263 initially.
Culled 0 columns in 36 ms.
// Phase 1: matrix 8262 rows 62 cols 221494 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-28 04:08:19] [INFO ] Computed 18 invariants in 125 ms
Computed 18 P flows in 126 ms.
Exported basis to /tmp/petrispot-output-13363461966650289007.kers
Total runtime 161 ms.
[2026-05-28 04:08:24] [INFO ] Implicit Places using invariants in 4972 ms returned []
[2026-05-28 04:08:24] [INFO ] Flow matrix only has 8263 transitions (discarded 20 similar events)
[2026-05-28 04:08:24] [INFO ] Invariant cache hit.
[2026-05-28 04:08:28] [INFO ] State equation strengthened by 4107 read => feed constraints.
[2026-05-28 04:08:36] [INFO ] Implicit Places using invariants and state equation in 11555 ms returned []
Implicit Place search using SMT with State Equation took 16540 ms to find 0 implicit places.
[2026-05-28 04:08:40] [INFO ] Redundant transitions in 4558 ms returned []
Running 8281 sub problems to find dead transitions.
[2026-05-28 04:08:40] [INFO ] Flow matrix only has 8263 transitions (discarded 20 similar events)
[2026-05-28 04:08:40] [INFO ] Invariant cache hit.
[2026-05-28 04:08:41] [INFO ] State equation strengthened by 4107 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 61/8325 variables, and 0 constraints, problems are : Problem set: 0 solved, 8281 unsolved in 30247 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/62 constraints, ReadFeed: 0/4107 constraints, PredecessorRefiner: 8281/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8281 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 61/8325 variables, and 0 constraints, problems are : Problem set: 0 solved, 8281 unsolved in 30154 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/62 constraints, ReadFeed: 0/4107 constraints, PredecessorRefiner: 8247/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 75591ms problems are : Problem set: 0 solved, 8281 unsolved
Search for dead transitions found 0 dead transitions in 75629ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/176 places, 8283/41651 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109802 ms. Remains : 62/176 places, 8283/41651 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1203-LTLFireability-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1203-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1203-LTLFireability-02 finished in 109939 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((X(X(!p0))||F(!p1))) U G(!p2)))'
Support contains 34 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 41651/41651 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 37043
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 37043
Applied a total of 2 rules in 906 ms. Remains 175 /176 variables (removed 1) and now considering 37043/41651 (removed 4608) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17413854409979699502.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9357917577765809477.kers'
[2026-05-28 04:09:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17413854409979699502.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9357917577765809477.kers]
Culled 0 columns in 215 ms.
// Phase 1: matrix 37043 rows 175 cols 1014325 entries
Finished phase 1 with 142 SingleSign rule and 3 generalized
[2026-05-28 04:09:58] [INFO ] Computed 30 invariants in 811 ms
Computed 30 P flows in 812 ms.
Exported basis to /tmp/petrispot-output-9357917577765809477.kers
Total runtime 957 ms.
[2026-05-28 04:10:14] [INFO ] Implicit Places using invariants in 16868 ms returned []
Implicit Place search using SMT only with invariants took 16872 ms to find 0 implicit places.
Running 37042 sub problems to find dead transitions.
[2026-05-28 04:10:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 37042 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 174/37218 variables, and 12 constraints, problems are : Problem set: 0 solved, 37042 unsolved in 31059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/175 constraints, PredecessorRefiner: 37042/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37042 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 37042 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 174/37218 variables, and 12 constraints, problems are : Problem set: 0 solved, 37042 unsolved in 30970 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/175 constraints, PredecessorRefiner: 36917/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 206907ms problems are : Problem set: 0 solved, 37042 unsolved
Search for dead transitions found 0 dead transitions in 207128ms
Starting structural reductions in LTL mode, iteration 1 : 175/176 places, 37043/41651 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225023 ms. Remains : 175/176 places, 37043/41651 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((X(X(!p0))||F(!p1))) U G(!p2)))'
Stuttering acceptance computed with spot in 298 ms :[p2, (AND (NOT p2) p1 p0), (AND p1 p0 p2), (AND p1 p0), (AND p1 p2 p0), (AND p1 p0), p1, (AND p1 p2 (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-1203-LTLFireability-03
Product exploration timeout after 30450 steps with 0 reset in 10001 ms.
Product exploration timeout after 28920 steps with 0 reset in 10001 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge based reduction with 13 factoid took 85 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 21079 ms. (1 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1413 ms. (28 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1630 ms. (24 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1406 ms. (28 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1264 ms. (31 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1233 ms. (32 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1094 ms. (36 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1147 ms. (34 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1130 ms. (35 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1047 ms. (38 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1029 ms. (38 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 87876 steps, run timeout after 27001 ms. (steps per millisecond=3 ) properties seen :0 out of 10
Probabilistic random walk after 87876 steps, saw 60420 distinct states, run finished after 27002 ms. (steps per millisecond=3 ) properties seen :0
[2026-05-28 04:14:39] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem apf1 is UNSAT
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 2 (OVERLAPS) 97/131 variables, 14/19 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/19 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 37/168 variables, 4/23 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/23 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 7/175 variables, 7/30 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/30 constraints. Problems are: Problem set: 5 solved, 5 unsolved
SMT process timed out in 5354ms, After SMT, problems are : Problem set: 5 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 34 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 37043/37043 transitions.
Graph (trivial) has 101 edges and 175 vertex of which 4 / 175 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 173 transition count 37026
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 160 transition count 37026
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 160 transition count 37005
Deduced a syphon composed of 21 places in 55 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 69 place count 139 transition count 37005
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 137 transition count 36988
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 137 transition count 36988
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 137 transition count 36986
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 13 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 165 place count 92 transition count 36941
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 169 place count 90 transition count 36958
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 179 place count 90 transition count 36948
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 191 place count 80 transition count 36946
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 192 place count 80 transition count 36946
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 196 place count 80 transition count 36946
Applied a total of 196 rules in 11702 ms. Remains 80 /175 variables (removed 95) and now considering 36946/37043 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11705 ms. Remains : 80/175 places, 36946/37043 transitions.
RANDOM walk for 40000 steps (8 resets) in 36817 ms. (1 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2559 ms. (15 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2269 ms. (17 steps per ms) remains 2/2 properties
[2026-05-28 04:15:07] [INFO ] Flow matrix only has 36924 transitions (discarded 22 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12324462451162811363.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5067731006630211845.kers'
[2026-05-28 04:15:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12324462451162811363.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5067731006630211845.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 169 ms.
// Phase 1: matrix 36924 rows 79 cols 986374 entries
Finished phase 1 with 47 SingleSign rule and 3 generalized
[2026-05-28 04:15:09] [INFO ] Computed 30 invariants in 820 ms
Computed 30 P flows in 821 ms.
Exported basis to /tmp/petrispot-output-5067731006630211845.kers
Total runtime 972 ms.
[2026-05-28 04:15:09] [INFO ] State equation strengthened by 13857 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 42/62 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 11/73 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/80 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 37004/37004 variables, and 110 constraints, problems are : Problem set: 0 solved, 2 unsolved in 32597 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 80/80 constraints, ReadFeed: 0/13857 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/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 42/62 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 11/73 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/80 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 37004/37004 variables, and 110 constraints, problems are : Problem set: 0 solved, 2 unsolved in 32859 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 80/80 constraints, ReadFeed: 0/13857 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67047ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 36946/36946 transitions.
Graph (trivial) has 19 edges and 80 vertex of which 2 / 80 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 79 transition count 36924
Deduced a syphon composed of 4 places in 15 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 75 transition count 36924
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 74 transition count 27708
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 74 transition count 27708
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 73 transition count 27707
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 72 transition count 18483
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 72 transition count 18483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 72 transition count 18482
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 71 transition count 18482
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 71 transition count 18481
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 30 place count 71 transition count 18470
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 37 place count 71 transition count 18463
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 44 place count 64 transition count 18463
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 63 transition count 18462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 62 transition count 18462
Applied a total of 46 rules in 161983 ms. Remains 62 /80 variables (removed 18) and now considering 18462/36946 (removed 18484) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161983 ms. Remains : 62/80 places, 18462/36946 transitions.
Found 5 invariant AP formulas.
Knowledge based reduction with 18 factoid took 123 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[p2]
Knowledge-based reduction took 295005 ms.
Stuttering acceptance computed with spot in 43 ms :[p2]
Support contains 13 out of 175 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 37043/37043 transitions.
Graph (trivial) has 101 edges and 175 vertex of which 4 / 175 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 172 transition count 37028
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 160 transition count 37028
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 25 place count 160 transition count 37008
Deduced a syphon composed of 20 places in 53 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 65 place count 140 transition count 37008
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 138 transition count 36991
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 138 transition count 36991
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 138 transition count 36989
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 18 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 163 place count 92 transition count 36943
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 165 place count 91 transition count 36954
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 170 place count 91 transition count 36954
Applied a total of 170 rules in 6798 ms. Remains 91 /175 variables (removed 84) and now considering 36954/37043 (removed 89) transitions.
[2026-05-28 04:19:04] [INFO ] Flow matrix only has 36934 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-16518895876192886426.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10510644597802995859.kers'
[2026-05-28 04:19:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16518895876192886426.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10510644597802995859.kers]
Normalized transition count is 36933 out of 36934 initially.
Culled 0 columns in 170 ms.
// Phase 1: matrix 36933 rows 91 cols 986420 entries
Finished phase 1 with 58 SingleSign rule and 3 generalized
[2026-05-28 04:19:05] [INFO ] Computed 30 invariants in 814 ms
Computed 30 P flows in 815 ms.
Exported basis to /tmp/petrispot-output-10510644597802995859.kers
Total runtime 974 ms.
[2026-05-28 04:19:21] [INFO ] Implicit Places using invariants in 17684 ms returned []
Implicit Place search using SMT only with invariants took 17686 ms to find 0 implicit places.
Running 36952 sub problems to find dead transitions.
[2026-05-28 04:19:21] [INFO ] Flow matrix only has 36934 transitions (discarded 20 similar events)
[2026-05-28 04:19:21] [INFO ] Invariant cache hit.
[2026-05-28 04:19:22] [INFO ] State equation strengthened by 13835 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 36952 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 90/37025 variables, and 12 constraints, problems are : Problem set: 0 solved, 36952 unsolved in 30948 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/91 constraints, ReadFeed: 0/13835 constraints, PredecessorRefiner: 36952/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36952 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 36952 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 90/37025 variables, and 12 constraints, problems are : Problem set: 0 solved, 36952 unsolved in 30781 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/91 constraints, ReadFeed: 0/13835 constraints, PredecessorRefiner: 36919/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 203517ms problems are : Problem set: 0 solved, 36952 unsolved
Search for dead transitions found 0 dead transitions in 203677ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/175 places, 36954/37043 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 228231 ms. Remains : 91/175 places, 36954/37043 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 62 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 34947 ms. (1 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2039 ms. (19 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 125468 steps, run timeout after 27001 ms. (steps per millisecond=4 ) properties seen :0 out of 1
Probabilistic random walk after 125468 steps, saw 23519 distinct states, run finished after 27005 ms. (steps per millisecond=4 ) properties seen :0
[2026-05-28 04:23:22] [INFO ] Flow matrix only has 36934 transitions (discarded 20 similar events)
[2026-05-28 04:23:22] [INFO ] Invariant cache hit.
[2026-05-28 04:23:23] [INFO ] State equation strengthened by 13835 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) 48/61 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 17/78 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/91 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5486ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 36954/36954 transitions.
Graph (trivial) has 32 edges and 91 vertex of which 2 / 91 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 90 transition count 36944
Deduced a syphon composed of 6 places in 16 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 84 transition count 36944
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 17 place count 80 transition count 13384
Iterating global reduction 0 with 4 rules applied. Total rules applied 21 place count 80 transition count 13384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 80 transition count 13383
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 78 transition count 8263
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 78 transition count 8263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 77 transition count 8270
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 77 transition count 8269
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 35 place count 77 transition count 8263
Free-agglomeration rule applied 17 times.
Iterating global reduction 2 with 17 rules applied. Total rules applied 52 place count 77 transition count 8246
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 1038 edges and 60 vertex of which 58 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.55 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 36 rules applied. Total rules applied 88 place count 58 transition count 8228
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 94 place count 58 transition count 8222
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 101 place count 58 transition count 8215
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 58 transition count 8214
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 107 place count 57 transition count 8210
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 108 place count 56 transition count 8209
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 110 place count 54 transition count 8209
Applied a total of 110 rules in 57782 ms. Remains 54 /91 variables (removed 37) and now considering 8209/36954 (removed 28745) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57782 ms. Remains : 54/91 places, 8209/36954 transitions.
RANDOM walk for 40000 steps (8 resets) in 16483 ms. (2 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 729 ms. (54 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 34732 steps, run visited all 1 properties in 2227 ms. (steps per millisecond=15 )
Probabilistic random walk after 34732 steps, saw 6387 distinct states, run finished after 2235 ms. (steps per millisecond=15 ) properties seen :1
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[p2]
Knowledge-based reduction took 107359 ms.
Stuttering acceptance computed with spot in 37 ms :[p2]
Stuttering acceptance computed with spot in 36 ms :[p2]
Product exploration timeout after 16700 steps with 0 reset in 10005 ms.
Product exploration timeout after 18250 steps with 0 reset in 10003 ms.
Built C files in :
/tmp/ltsmin16827775668371891527
[2026-05-28 04:24:53] [INFO ] Too many transitions (36954) to apply POR reductions. Disabling POR matrices.
[2026-05-28 04:24:54] [INFO ] Built C files in 1210ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16827775668371891527
Running compilation step : cd /tmp/ltsmin16827775668371891527;'/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/ltsmin16827775668371891527;'/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/ltsmin16827775668371891527;'/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 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 36954/36954 transitions.
Graph (trivial) has 32 edges and 91 vertex of which 2 / 91 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 90 transition count 36947
Deduced a syphon composed of 6 places in 18 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 84 transition count 36947
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 17 place count 80 transition count 13387
Iterating global reduction 0 with 4 rules applied. Total rules applied 21 place count 80 transition count 13387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 80 transition count 13386
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 78 transition count 8266
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 78 transition count 8266
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 78 transition count 8263
Applied a total of 29 rules in 30474 ms. Remains 78 /91 variables (removed 13) and now considering 8263/36954 (removed 28691) transitions.
[2026-05-28 04:25:27] [INFO ] Flow matrix only has 8244 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3350061402944915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11402332378421809018.kers'
[2026-05-28 04:25:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3350061402944915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11402332378421809018.kers]
Normalized transition count is 8243 out of 8244 initially.
Culled 0 columns in 56 ms.
// Phase 1: matrix 8243 rows 78 cols 213194 entries
Finished phase 1 with 46 SingleSign rule and 2 generalized
[2026-05-28 04:25:28] [INFO ] Computed 30 invariants in 203 ms
Computed 30 P flows in 203 ms.
Exported basis to /tmp/petrispot-output-11402332378421809018.kers
Total runtime 254 ms.
[2026-05-28 04:25:34] [INFO ] Implicit Places using invariants in 6542 ms returned []
[2026-05-28 04:25:34] [INFO ] Flow matrix only has 8244 transitions (discarded 19 similar events)
[2026-05-28 04:25:34] [INFO ] Invariant cache hit.
[2026-05-28 04:25:38] [INFO ] State equation strengthened by 4117 read => feed constraints.
[2026-05-28 04:25:51] [INFO ] Implicit Places using invariants and state equation in 17337 ms returned []
Implicit Place search using SMT with State Equation took 23907 ms to find 0 implicit places.
[2026-05-28 04:25:54] [INFO ] Redundant transitions in 2948 ms returned []
Running 8261 sub problems to find dead transitions.
[2026-05-28 04:25:54] [INFO ] Flow matrix only has 8244 transitions (discarded 19 similar events)
[2026-05-28 04:25:54] [INFO ] Invariant cache hit.
[2026-05-28 04:25:54] [INFO ] State equation strengthened by 4117 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 8261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 77/8322 variables, and 12 constraints, problems are : Problem set: 0 solved, 8261 unsolved in 30197 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/78 constraints, ReadFeed: 0/4117 constraints, PredecessorRefiner: 8261/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 8261 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 77/8322 variables, and 12 constraints, problems are : Problem set: 0 solved, 8261 unsolved in 30156 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/78 constraints, ReadFeed: 0/4117 constraints, PredecessorRefiner: 8234/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74647ms problems are : Problem set: 0 solved, 8261 unsolved
Search for dead transitions found 0 dead transitions in 74681ms
Starting structural reductions in SI_LTL mode, iteration 1 : 78/91 places, 8263/36954 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132035 ms. Remains : 78/91 places, 8263/36954 transitions.
Built C files in :
/tmp/ltsmin15883944901468148758
[2026-05-28 04:27:09] [INFO ] Too many transitions (8263) to apply POR reductions. Disabling POR matrices.
[2026-05-28 04:27:09] [INFO ] Built C files in 231ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15883944901468148758
Running compilation step : cd /tmp/ltsmin15883944901468148758;'/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/ltsmin15883944901468148758;'/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/ltsmin15883944901468148758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-28 04:27:18] [INFO ] Flatten gal took : 1356 ms
[2026-05-28 04:27:19] [INFO ] Flatten gal took : 1472 ms
[2026-05-28 04:27:20] [INFO ] Time to serialize gal into /tmp/LTL6880514194281146610.gal : 278 ms
[2026-05-28 04:27:20] [INFO ] Time to serialize properties into /tmp/LTL14060589620698718994.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/LTL6880514194281146610.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1649049054818035021.hoa' '-atoms' '/tmp/LTL14060589620698718994.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14060589620698718994.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1649049054818035021.hoa
Detected timeout of ITS tools.
[2026-05-28 04:27:47] [INFO ] Flatten gal took : 9027 ms
[2026-05-28 04:27:54] [INFO ] Flatten gal took : 6852 ms
[2026-05-28 04:27:55] [INFO ] Time to serialize gal into /tmp/LTL17229841736006141177.gal : 956 ms
[2026-05-28 04:27:55] [INFO ] Time to serialize properties into /tmp/LTL10861642051569965609.ltl : 5 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/LTL17229841736006141177.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10861642051569965609.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...277
Read 1 LTL properties
Detected timeout of ITS tools.
[2026-05-28 04:28:18] [INFO ] Flatten gal took : 7282 ms
[2026-05-28 04:28:18] [INFO ] Applying decomposition
[2026-05-28 04:28:25] [INFO ] Flatten gal took : 7191 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/graph9579661894859205692.txt' '-o' '/tmp/graph9579661894859205692.bin' '-w' '/tmp/graph9579661894859205692.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9579661894859205692.bin' '-l' '-1' '-v' '-w' '/tmp/graph9579661894859205692.weights' '-q' '0' '-e' '0.001'
[2026-05-28 04:28:44] [INFO ] Decomposing Gal with order
[2026-05-28 04:28:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 04:29:03] [INFO ] Removed a total of 553036 redundant transitions.
[2026-05-28 04:29:04] [INFO ] Flatten gal took : 14362 ms
[2026-05-28 04:29:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 8195 ms.
[2026-05-28 04:29:14] [INFO ] Time to serialize gal into /tmp/LTL610094525765197407.gal : 432 ms
[2026-05-28 04:29:14] [INFO ] Time to serialize properties into /tmp/LTL5821394291111208136.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/LTL610094525765197407.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5821394291111208136.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...253
Read 1 LTL properties
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-1203-LTLFireability-03 finished in 1173076 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(p1) U p2)||(X(X(!p1)) U ((!p1&&X(X(!p1)))||X(X(G(!p1))))))))'
Support contains 34 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 41651/41651 transitions.
Applied a total of 0 rules in 912 ms. Remains 176 /176 variables (removed 0) and now considering 41651/41651 (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-1928633199635074645.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17561928824877861416.kers'
[2026-05-28 04:29:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1928633199635074645.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17561928824877861416.kers]
Culled 0 columns in 336 ms.
// Phase 1: matrix 41651 rows 176 cols 1134133 entries
Finished phase 1 with 143 SingleSign rule and 3 generalized
[2026-05-28 04:29:32] [INFO ] Computed 30 invariants in 1094 ms
Computed 30 P flows in 1094 ms.
Exported basis to /tmp/petrispot-output-17561928824877861416.kers
Total runtime 1255 ms.
[2026-05-28 04:29:51] [INFO ] Implicit Places using invariants in 21042 ms returned []
Implicit Place search using SMT only with invariants took 21054 ms to find 0 implicit places.
Running 41650 sub problems to find dead transitions.
[2026-05-28 04:29:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 41650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 175/41827 variables, and 12 constraints, problems are : Problem set: 0 solved, 41650 unsolved in 31269 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/176 constraints, PredecessorRefiner: 41650/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 41650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 175/41827 variables, and 12 constraints, problems are : Problem set: 0 solved, 41650 unsolved in 30811 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/176 constraints, PredecessorRefiner: 41525/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 256067ms problems are : Problem set: 0 solved, 41650 unsolved
Search for dead transitions found 0 dead transitions in 256478ms
Finished structural reductions in LTL mode , in 1 iterations and 278833 ms. Remains : 176/176 places, 41651/41651 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)&&((F(p1) U p2)||(X(X(!p1)) U ((!p1&&X(X(!p1)))||X(X(G(!p1))))))))'
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1), (AND (NOT p2) p1), true, (AND (NOT p2) p1), (NOT p2), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1203-LTLFireability-04
Product exploration explored 100000 steps with 39967 reset in 3358 ms.
Product exploration explored 100000 steps with 40021 reset in 2903 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 14 ms. Proved property starting from automaton with 8 states, 12 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 1521 ms.
FORMULA ErlangenMainframeV0-PT-1203-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1203-LTLFireability-04 finished in 287455 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(((!p0 U (G(!p0)||(!p0&&G(!p1))))||X((X(!p2) U ((!p2&&X(!p2))||X(G(!p2)))))))))'
Support contains 32 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 41651/41651 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 173 transition count 31923
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 173 transition count 31923
Applied a total of 6 rules in 1360 ms. Remains 173 /176 variables (removed 3) and now considering 31923/41651 (removed 9728) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4066180127672525713.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-35629476172810857.kers'
[2026-05-28 04:34:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4066180127672525713.kers, --Pflows, --basisKERS=/tmp/petrispot-output-35629476172810857.kers]
Culled 0 columns in 149 ms.
// Phase 1: matrix 31923 rows 173 cols 881205 entries
Finished phase 1 with 141 SingleSign rule and 2 generalized
[2026-05-28 04:34:19] [INFO ] Computed 30 invariants in 646 ms
Computed 30 P flows in 646 ms.
Exported basis to /tmp/petrispot-output-35629476172810857.kers
Total runtime 777 ms.
[2026-05-28 04:34:31] [INFO ] Implicit Places using invariants in 13369 ms returned []
Implicit Place search using SMT only with invariants took 13386 ms to find 0 implicit places.
Running 31922 sub problems to find dead transitions.
[2026-05-28 04:34:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 31922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 172/32096 variables, and 12 constraints, problems are : Problem set: 0 solved, 31922 unsolved in 30782 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/173 constraints, PredecessorRefiner: 31922/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 31922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 172/32096 variables, and 12 constraints, problems are : Problem set: 0 solved, 31922 unsolved in 30713 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/173 constraints, PredecessorRefiner: 31797/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 185890ms problems are : Problem set: 0 solved, 31922 unsolved
Search for dead transitions found 0 dead transitions in 186115ms
Starting structural reductions in LTL mode, iteration 1 : 173/176 places, 31923/41651 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201108 ms. Remains : 173/176 places, 31923/41651 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(((!p0 U (G(!p0)||(!p0&&G(!p1))))||X((X(!p2) U ((!p2&&X(!p2))||X(G(!p2)))))))))'
Stuttering acceptance computed with spot in 688 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), p2, (AND p2 p0 p1), (AND p0 p2), p2, (AND p0 p1 p2), (AND p1 p2), (AND p2 p1), (AND p0 p2), true, p1, p0, (AND p1 p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1203-LTLFireability-05
Product exploration explored 100000 steps with 20000 reset in 2102 ms.
Product exploration explored 100000 steps with 20000 reset in 1805 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 15 states, 45 edges and 3 AP (stutter sensitive) to 15 states, 43 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 17031 ms. (2 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1242 ms. (32 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 715 ms. (55 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (8 resets) in 623 ms. (64 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (8 resets) in 758 ms. (52 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 642 ms. (62 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1097 ms. (36 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 851 ms. (46 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 889 ms. (44 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 958 ms. (41 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 811 ms. (49 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 842 ms. (47 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 935 ms. (42 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 870 ms. (45 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 924 ms. (43 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 126859 steps, run timeout after 24002 ms. (steps per millisecond=5 ) properties seen :0 out of 14
Probabilistic random walk after 126859 steps, saw 85156 distinct states, run finished after 24002 ms. (steps per millisecond=5 ) properties seen :0
[2026-05-28 04:38:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf10 is UNSAT
Problem apf11 is UNSAT
At refinement iteration 1 (OVERLAPS) 93/125 variables, 14/14 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/15 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/15 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 37/162 variables, 4/19 constraints. Problems are: Problem set: 6 solved, 8 unsolved
SMT process timed out in 17745ms, After SMT, problems are : Problem set: 6 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 31923/31923 transitions.
Graph (trivial) has 96 edges and 173 vertex of which 4 / 173 are part of one of the 2 SCC in 15 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 171 transition count 31906
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 158 transition count 31906
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 158 transition count 31885
Deduced a syphon composed of 21 places in 58 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 69 place count 137 transition count 31885
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 135 transition count 31868
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 135 transition count 31868
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 135 transition count 31866
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 16 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 155 place count 95 transition count 31826
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 159 place count 93 transition count 31842
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 169 place count 93 transition count 31832
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 181 place count 83 transition count 31830
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 182 place count 83 transition count 31830
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 190 place count 83 transition count 31830
Applied a total of 190 rules in 13094 ms. Remains 83 /173 variables (removed 90) and now considering 31830/31923 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13122 ms. Remains : 83/173 places, 31830/31923 transitions.
RANDOM walk for 40000 steps (8 resets) in 22400 ms. (1 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2985 ms. (13 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2242 ms. (17 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 3111 ms. (12 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3192 ms. (12 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1980 ms. (20 steps per ms) remains 5/5 properties
[2026-05-28 04:38:57] [INFO ] Flow matrix only has 31810 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-11660045362843486126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9594099474079577763.kers'
[2026-05-28 04:38:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11660045362843486126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9594099474079577763.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 145 ms.
// Phase 1: matrix 31810 rows 82 cols 853266 entries
Finished phase 1 with 51 SingleSign rule and 2 generalized
[2026-05-28 04:38:58] [INFO ] Computed 30 invariants in 612 ms
Computed 30 P flows in 613 ms.
Exported basis to /tmp/petrispot-output-9594099474079577763.kers
Total runtime 742 ms.
[2026-05-28 04:38:58] [INFO ] State equation strengthened by 13857 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 33/65 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 7/72 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 11/83 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31893/31893 variables, and 113 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 83/83 constraints, ReadFeed: 0/13857 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 33/65 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 7/72 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 11/83 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 31810/31893 variables, 83/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 31893/31893 variables, and 13970 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45035 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 83/83 constraints, ReadFeed: 13857/13857 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 91319ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 31830/31830 transitions.
Applied a total of 0 rules in 987 ms. Remains 83 /83 variables (removed 0) and now considering 31830/31830 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 987 ms. Remains : 83/83 places, 31830/31830 transitions.
Found 6 invariant AP formulas.
Knowledge based reduction with 11 factoid took 158 ms. Reduced automaton from 15 states, 43 edges and 3 AP (stutter sensitive) to 10 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 435 ms :[(AND p2 p0 p1), (AND p2 p0 p1), (AND p2 p0 p1), (AND p2 p0 p1), (AND p2 p1 p0), (AND p2 p1), true, p1, p0, (AND p1 p0)]
Knowledge-based reduction took 166754 ms.
Stuttering acceptance computed with spot in 462 ms :[(AND p2 p0 p1), (AND p2 p0 p1), (AND p2 p0 p1), (AND p2 p0 p1), (AND p2 p1 p0), (AND p2 p1), true, p1, p0, (AND p1 p0)]
Support contains 32 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 31923/31923 transitions.
Applied a total of 0 rules in 185 ms. Remains 173 /173 variables (removed 0) and now considering 31923/31923 (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-1156641835769758960.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6041064854127815302.kers'
[2026-05-28 04:40:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1156641835769758960.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6041064854127815302.kers]
Culled 0 columns in 149 ms.
// Phase 1: matrix 31923 rows 173 cols 881205 entries
Finished phase 1 with 141 SingleSign rule and 2 generalized
[2026-05-28 04:40:31] [INFO ] Computed 30 invariants in 622 ms
Computed 30 P flows in 623 ms.
Exported basis to /tmp/petrispot-output-6041064854127815302.kers
Total runtime 811 ms.
[2026-05-28 04:40:44] [INFO ] Implicit Places using invariants in 13547 ms returned []
Implicit Place search using SMT only with invariants took 13551 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 13739 ms. Remains : 173/173 places, 31923/31923 transitions.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 10 states, 17 edges and 3 AP (stutter sensitive) to 10 states, 17 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 14025 ms. (2 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 780 ms. (51 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 804 ms. (49 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 783 ms. (51 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 676 ms. (59 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 795 ms. (50 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 51045 steps, run timeout after 12001 ms. (steps per millisecond=4 ) properties seen :0 out of 5
Probabilistic random walk after 51045 steps, saw 35376 distinct states, run finished after 12001 ms. (steps per millisecond=4 ) properties seen :0
[2026-05-28 04:41:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 93/125 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 37/162 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 11/173 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SMT process timed out in 5284ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 32 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 31923/31923 transitions.
Graph (trivial) has 96 edges and 173 vertex of which 4 / 173 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 171 transition count 31906
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 158 transition count 31906
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 158 transition count 31885
Deduced a syphon composed of 21 places in 54 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 69 place count 137 transition count 31885
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 135 transition count 31868
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 135 transition count 31868
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 135 transition count 31866
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 16 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 155 place count 95 transition count 31826
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 159 place count 93 transition count 31842
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 169 place count 93 transition count 31832
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 181 place count 83 transition count 31830
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 182 place count 83 transition count 31830
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 190 place count 83 transition count 31830
Applied a total of 190 rules in 12610 ms. Remains 83 /173 variables (removed 90) and now considering 31830/31923 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12611 ms. Remains : 83/173 places, 31830/31923 transitions.
RANDOM walk for 40000 steps (8 resets) in 26494 ms. (1 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3860 ms. (10 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2290 ms. (17 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2472 ms. (16 steps per ms) remains 3/3 properties
[2026-05-28 04:41:30] [INFO ] Flow matrix only has 31810 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-6503019614551830338.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3742244571719016041.kers'
[2026-05-28 04:41:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6503019614551830338.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3742244571719016041.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 151 ms.
// Phase 1: matrix 31810 rows 82 cols 853266 entries
Finished phase 1 with 51 SingleSign rule and 2 generalized
[2026-05-28 04:41:31] [INFO ] Computed 30 invariants in 675 ms
Computed 30 P flows in 675 ms.
Exported basis to /tmp/petrispot-output-3742244571719016041.kers
Total runtime 800 ms.
[2026-05-28 04:41:31] [INFO ] State equation strengthened by 13857 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/65 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7/72 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/83 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31893/31893 variables, and 113 constraints, problems are : Problem set: 0 solved, 3 unsolved in 37396 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 83/83 constraints, ReadFeed: 0/13857 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/65 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7/72 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/83 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 31893/31893 variables, and 113 constraints, problems are : Problem set: 0 solved, 3 unsolved in 39761 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 83/83 constraints, ReadFeed: 0/13857 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 78384ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 31830/31830 transitions.
Applied a total of 0 rules in 1158 ms. Remains 83 /83 variables (removed 0) and now considering 31830/31830 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1159 ms. Remains : 83/83 places, 31830/31830 transitions.
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 10 states, 17 edges and 3 AP (stutter sensitive) to 10 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 398 ms :[(AND p2 p0 p1), (AND p2 p0 p1), (AND p2 p0 p1), (AND p2 p0 p1), (AND p2 p1 p0), (AND p2 p1), true, p1, p0, (AND p1 p0)]
Knowledge-based reduction took 126115 ms.
Stuttering acceptance computed with spot in 468 ms :[(AND p2 p0 p1), (AND p2 p0 p1), (AND p2 p0 p1), (AND p2 p0 p1), (AND p2 p1 p0), (AND p2 p1), true, p1, p0, (AND p1 p0)]
Stuttering acceptance computed with spot in 469 ms :[(AND p2 p0 p1), (AND p2 p0 p1), (AND p2 p0 p1), (AND p2 p0 p1), (AND p2 p1 p0), (AND p2 p1), true, p1, p0, (AND p1 p0)]
Product exploration explored 100000 steps with 20000 reset in 1608 ms.
Product exploration explored 100000 steps with 20000 reset in 1501 ms.
Spot run failed in 118 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/ltsmin4721428339946978450
[2026-05-28 04:42:56] [INFO ] Built C files in 974ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4721428339946978450
Running compilation step : cd /tmp/ltsmin4721428339946978450;'/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/ltsmin4721428339946978450;'/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/ltsmin4721428339946978450;'/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 32 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 31923/31923 transitions.
Applied a total of 0 rules in 266 ms. Remains 173 /173 variables (removed 0) and now considering 31923/31923 (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-12172896057370257421.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13107906905750217405.kers'
[2026-05-28 04:42:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12172896057370257421.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13107906905750217405.kers]
Culled 0 columns in 156 ms.
// Phase 1: matrix 31923 rows 173 cols 881205 entries
Finished phase 1 with 141 SingleSign rule and 2 generalized
[2026-05-28 04:43:00] [INFO ] Computed 30 invariants in 643 ms
Computed 30 P flows in 644 ms.
Exported basis to /tmp/petrispot-output-13107906905750217405.kers
Total runtime 801 ms.
[2026-05-28 04:43:12] [INFO ] Implicit Places using invariants in 13257 ms returned []
Implicit Place search using SMT only with invariants took 13259 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 13527 ms. Remains : 173/173 places, 31923/31923 transitions.
Built C files in :
/tmp/ltsmin17619448898733911791
[2026-05-28 04:43:13] [INFO ] Built C files in 998ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17619448898733911791
Running compilation step : cd /tmp/ltsmin17619448898733911791;'/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/ltsmin17619448898733911791;'/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/ltsmin17619448898733911791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-28 04:43:28] [INFO ] Flatten gal took : 7163 ms
[2026-05-28 04:43:33] [INFO ] Flatten gal took : 5004 ms
[2026-05-28 04:43:34] [INFO ] Time to serialize gal into /tmp/LTL7769295502629221515.gal : 903 ms
[2026-05-28 04:43:34] [INFO ] Time to serialize properties into /tmp/LTL14447126274468512009.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/LTL7769295502629221515.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12629309247913547937.hoa' '-atoms' '/tmp/LTL14447126274468512009.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Detected timeout of ITS tools.
[2026-05-28 04:43:59] [INFO ] Flatten gal took : 5987 ms
[2026-05-28 04:44:04] [INFO ] Flatten gal took : 4743 ms
[2026-05-28 04:44:05] [INFO ] Time to serialize gal into /tmp/LTL12964982012658666077.gal : 824 ms
[2026-05-28 04:44:05] [INFO ] Time to serialize properties into /tmp/LTL15654981764667670244.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/LTL12964982012658666077.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15654981764667670244.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...277
Read 1 LTL properties
Detected timeout of ITS tools.
[2026-05-28 04:44:25] [INFO ] Flatten gal took : 4937 ms
[2026-05-28 04:44:25] [INFO ] Applying decomposition
[2026-05-28 04:44:30] [INFO ] Flatten gal took : 4515 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/graph12360511813198969075.txt' '-o' '/tmp/graph12360511813198969075.bin' '-w' '/tmp/graph12360511813198969075.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12360511813198969075.bin' '-l' '-1' '-v' '-w' '/tmp/graph12360511813198969075.weights' '-q' '0' '-e' '0.001'
[2026-05-28 04:44:49] [INFO ] Decomposing Gal with order
[2026-05-28 04:44:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 04:45:06] [INFO ] Removed a total of 460415 redundant transitions.
[2026-05-28 04:45:07] [INFO ] Flatten gal took : 13436 ms
[2026-05-28 04:45:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 4904 ms.
[2026-05-28 04:45:13] [INFO ] Time to serialize gal into /tmp/LTL17682847451459815946.gal : 298 ms
[2026-05-28 04:45:13] [INFO ] Time to serialize properties into /tmp/LTL5309119523405649325.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/LTL17682847451459815946.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5309119523405649325.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(((!("(((((i9.u7.p19==1)&&(i8.u12.p36==1))&&((i9.u15.p49==1)&&(i9.u17.p58==1)))&&(((i9.u21.p75==1)&&(i9.u24.p88==1))&&((i9.u25.p...2264
Formula 0 simplified : XX(X(X"(((((i9.u7.p19==1)&&(i8.u12.p36==1))&&((i9.u15.p49==1)&&(i8.u18.p62==1)))&&(((i9.u21.p75==1)&&(i9.u24.p88==1))&&((i8.u26.p101...1663
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-1203-LTLFireability-05 finished in 671601 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(p0)&&F((G(p2)||p1)))))'
Support contains 13 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 41651/41651 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 173 transition count 31923
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 173 transition count 31923
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 170 transition count 12467
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 170 transition count 12467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 169 transition count 12465
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 169 transition count 12465
Applied a total of 14 rules in 2926 ms. Remains 169 /176 variables (removed 7) and now considering 12465/41651 (removed 29186) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5920247562175310202.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1329940978643370815.kers'
[2026-05-28 04:45:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5920247562175310202.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1329940978643370815.kers]
Culled 0 columns in 59 ms.
// Phase 1: matrix 12465 rows 169 cols 336433 entries
Finished phase 1 with 137 SingleSign rule and 2 generalized
[2026-05-28 04:45:32] [INFO ] Computed 30 invariants in 237 ms
Computed 30 P flows in 238 ms.
Exported basis to /tmp/petrispot-output-1329940978643370815.kers
Total runtime 305 ms.
[2026-05-28 04:45:44] [INFO ] Implicit Places using invariants in 12414 ms returned []
Implicit Place search using SMT only with invariants took 12420 ms to find 0 implicit places.
Running 12464 sub problems to find dead transitions.
[2026-05-28 04:45:44] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 168/12634 variables, and 12 constraints, problems are : Problem set: 0 solved, 12464 unsolved in 30335 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/169 constraints, PredecessorRefiner: 12464/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12464 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 168/12634 variables, and 12 constraints, problems are : Problem set: 0 solved, 12464 unsolved in 30338 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/169 constraints, PredecessorRefiner: 12341/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90837ms problems are : Problem set: 0 solved, 12464 unsolved
Search for dead transitions found 0 dead transitions in 90944ms
Starting structural reductions in LTL mode, iteration 1 : 169/176 places, 12465/41651 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106358 ms. Remains : 169/176 places, 12465/41651 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(p0)&&F((G(p2)||p1)))))'
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : ErlangenMainframeV0-PT-1203-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1203-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1203-LTLFireability-06 finished in 106741 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))&&X((F(G(p2)) U p3))))'
Support contains 39 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 41651/41651 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 173 transition count 31923
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 173 transition count 31923
Applied a total of 6 rules in 1069 ms. Remains 173 /176 variables (removed 3) and now considering 31923/41651 (removed 9728) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11593614185970407206.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7455804113583234758.kers'
[2026-05-28 04:47:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11593614185970407206.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7455804113583234758.kers]
Culled 0 columns in 220 ms.
// Phase 1: matrix 31923 rows 173 cols 881205 entries
Finished phase 1 with 141 SingleSign rule and 2 generalized
[2026-05-28 04:47:17] [INFO ] Computed 30 invariants in 786 ms
Computed 30 P flows in 787 ms.
Exported basis to /tmp/petrispot-output-7455804113583234758.kers
Total runtime 950 ms.
[2026-05-28 04:47:22] [INFO ] Implicit Places using invariants in 6166 ms returned []
Implicit Place search using SMT only with invariants took 6168 ms to find 0 implicit places.
Running 31922 sub problems to find dead transitions.
[2026-05-28 04:47:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 31922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 172/32096 variables, and 12 constraints, problems are : Problem set: 0 solved, 31922 unsolved in 30568 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/173 constraints, PredecessorRefiner: 31922/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 31922 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 172/32096 variables, and 12 constraints, problems are : Problem set: 0 solved, 31922 unsolved in 30596 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/173 constraints, PredecessorRefiner: 31797/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 193995ms problems are : Problem set: 0 solved, 31922 unsolved
Search for dead transitions found 0 dead transitions in 194151ms
Starting structural reductions in LTL mode, iteration 1 : 173/176 places, 31923/41651 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201461 ms. Remains : 173/176 places, 31923/41651 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))&&X((F(G(p2)) U p3))))'
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2)), (NOT p3), (NOT p2), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV0-PT-1203-LTLFireability-08
Product exploration timeout after 27040 steps with 0 reset in 10002 ms.
Stack based approach found an accepted trace after 90 steps with 0 reset with depth 91 and stack size 91 in 22 ms.
FORMULA ErlangenMainframeV0-PT-1203-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1203-LTLFireability-08 finished in 211987 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&&(!p1 U (p2||G(!p1)))))))'
Support contains 31 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 41651/41651 transitions.
Graph (trivial) has 97 edges and 176 vertex of which 4 / 176 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 173 transition count 41636
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 161 transition count 41636
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 25 place count 161 transition count 41617
Deduced a syphon composed of 19 places in 92 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 63 place count 142 transition count 41617
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 68 place count 137 transition count 31872
Iterating global reduction 2 with 5 rules applied. Total rules applied 73 place count 137 transition count 31872
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 137 transition count 31870
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 136 transition count 22654
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 136 transition count 22654
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 13 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 159 place count 95 transition count 22613
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 94 transition count 22624
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 171 place count 94 transition count 22624
Applied a total of 171 rules in 7382 ms. Remains 94 /176 variables (removed 82) and now considering 22624/41651 (removed 19027) transitions.
[2026-05-28 04:50:54] [INFO ] Flow matrix only has 22604 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-8776824360515648219.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1689153063628012157.kers'
[2026-05-28 04:50:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8776824360515648219.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1689153063628012157.kers]
Normalized transition count is 22603 out of 22604 initially.
Culled 0 columns in 111 ms.
// Phase 1: matrix 22603 rows 94 cols 622912 entries
Finished phase 1 with 62 SingleSign rule and 2 generalized
[2026-05-28 04:50:55] [INFO ] Computed 30 invariants in 519 ms
Computed 30 P flows in 520 ms.
Exported basis to /tmp/petrispot-output-1689153063628012157.kers
Total runtime 605 ms.
[2026-05-28 04:51:03] [INFO ] Implicit Places using invariants in 8413 ms returned []
Implicit Place search using SMT only with invariants took 8415 ms to find 0 implicit places.
Running 22622 sub problems to find dead transitions.
[2026-05-28 04:51:03] [INFO ] Flow matrix only has 22604 transitions (discarded 20 similar events)
[2026-05-28 04:51:03] [INFO ] Invariant cache hit.
[2026-05-28 04:51:03] [INFO ] State equation strengthened by 11 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 22622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 93/22698 variables, and 12 constraints, problems are : Problem set: 0 solved, 22622 unsolved in 30382 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/94 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 22622/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22622 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 22622 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 93/22698 variables, and 12 constraints, problems are : Problem set: 0 solved, 22622 unsolved in 30349 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/94 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 22592/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 128508ms problems are : Problem set: 0 solved, 22622 unsolved
Search for dead transitions found 0 dead transitions in 128613ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/176 places, 22624/41651 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144463 ms. Remains : 94/176 places, 22624/41651 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 (p1||G(!p0)))&&p2))))'
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (OR (NOT p2) (AND p0 (NOT p1))), (AND p0 (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-1203-LTLFireability-09
Product exploration timeout after 35090 steps with 0 reset in 10002 ms.
Product exploration timeout after 35030 steps with 0 reset in 10003 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 13 factoid took 65 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 14199 ms. (2 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 867 ms. (46 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 956 ms. (41 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1467 ms. (27 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1333 ms. (29 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1310 ms. (30 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1257 ms. (31 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1369 ms. (29 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 165866 steps, run timeout after 15001 ms. (steps per millisecond=11 ) properties seen :0 out of 7
Probabilistic random walk after 165866 steps, saw 24023 distinct states, run finished after 15001 ms. (steps per millisecond=11 ) properties seen :0
[2026-05-28 04:53:53] [INFO ] Flow matrix only has 22604 transitions (discarded 20 similar events)
[2026-05-28 04:53:53] [INFO ] Invariant cache hit.
[2026-05-28 04:53:53] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 40/71 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 12/83 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 11/94 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 5252ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 31 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 22624/22624 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 94 transition count 22622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 93 transition count 22629
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 15 place count 93 transition count 22618
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 82 transition count 22616
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 82 transition count 22616
Applied a total of 30 rules in 3956 ms. Remains 82 /94 variables (removed 12) and now considering 22616/22624 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3957 ms. Remains : 82/94 places, 22616/22624 transitions.
RANDOM walk for 40000 steps (8 resets) in 17543 ms. (2 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1793 ms. (22 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2891 ms. (13 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2844 ms. (14 steps per ms) remains 3/3 properties
[2026-05-28 04:54:09] [INFO ] Flow matrix only has 22592 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17303257098509458969.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4410694109801793578.kers'
[2026-05-28 04:54:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17303257098509458969.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4410694109801793578.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 113 ms.
// Phase 1: matrix 22592 rows 81 cols 622862 entries
Finished phase 1 with 50 SingleSign rule and 2 generalized
[2026-05-28 04:54:10] [INFO ] Computed 30 invariants in 606 ms
Computed 30 P flows in 606 ms.
Exported basis to /tmp/petrispot-output-4410694109801793578.kers
Total runtime 697 ms.
[2026-05-28 04:54:10] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/64 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7/71 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/82 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 22592/22674 variables, 82/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22674 variables, 33/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/22674 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/22674 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22674/22674 variables, and 145 constraints, problems are : Problem set: 0 solved, 3 unsolved in 42839 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 82/82 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/64 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7/71 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/82 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 22592/22674 variables, 82/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22674 variables, 33/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/22674 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/22674 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.

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

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