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.r338-smll-178021499100100.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 ErlangenMainframeV1-PT-bP07C07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499100100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.1M
-rw-r--r-- 1 mcc users 8.0K May 27 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 27 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 27 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 27 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 27 10:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.5K May 27 08:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 27 08:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 27 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 27 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 5.7M May 26 18:17 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 ErlangenMainframeV1-PT-bP07C07-LTLFireability-00
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-LTLFireability-01
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-LTLFireability-02
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-LTLFireability-03
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-LTLFireability-04
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-LTLFireability-05
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-LTLFireability-06
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-LTLFireability-07
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-LTLFireability-08
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-LTLFireability-09
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-LTLFireability-10
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-LTLFireability-11
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-LTLFireability-12
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-LTLFireability-13
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-LTLFireability-14
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780272408321

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP07C07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-06-01 00:06:50] [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-06-01 00:06:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 00:06:52] [INFO ] Load time of PNML (sax parser for PT used): 1100 ms
[2026-06-01 00:06:52] [INFO ] Transformed 293 places.
[2026-06-01 00:06:52] [INFO ] Transformed 6879 transitions.
[2026-06-01 00:06:52] [INFO ] Found NUPN structural information;
[2026-06-01 00:06:52] [INFO ] Parsed PT model containing 293 places and 6879 transitions and 114566 arcs in 1441 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ErlangenMainframeV1-PT-bP07C07-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP07C07-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP07C07-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP07C07-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 6879/6879 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 226 transition count 6812
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 226 transition count 6812
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 174 place count 186 transition count 6772
Iterating global reduction 0 with 40 rules applied. Total rules applied 214 place count 186 transition count 6772
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 217 place count 183 transition count 6769
Iterating global reduction 0 with 3 rules applied. Total rules applied 220 place count 183 transition count 6769
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 223 place count 180 transition count 6750
Iterating global reduction 0 with 3 rules applied. Total rules applied 226 place count 180 transition count 6750
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 229 place count 177 transition count 6747
Iterating global reduction 0 with 3 rules applied. Total rules applied 232 place count 177 transition count 6747
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 235 place count 174 transition count 6744
Iterating global reduction 0 with 3 rules applied. Total rules applied 238 place count 174 transition count 6744
Applied a total of 238 rules in 522 ms. Remains 174 /293 variables (removed 119) and now considering 6744/6879 (removed 135) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8013824301525401168.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13328494909446993772.kers'
[2026-06-01 00:06:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8013824301525401168.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13328494909446993772.kers]
Culled 0 columns in 33 ms.
// Phase 1: matrix 6744 rows 174 cols 114220 entries
Finished phase 1 with 151 SingleSign rule and 3 generalized
[2026-06-01 00:06:53] [INFO ] Computed 20 invariants in 123 ms
Computed 20 P flows in 125 ms.
Exported basis to /tmp/petrispot-output-13328494909446993772.kers
Total runtime 154 ms.
[2026-06-01 00:06:54] [INFO ] Implicit Places using invariants in 670 ms returned []
[2026-06-01 00:06:54] [INFO ] Invariant cache hit.
[2026-06-01 00:06:58] [INFO ] Implicit Places using invariants and state equation in 3831 ms returned []
Implicit Place search using SMT with State Equation took 4573 ms to find 0 implicit places.
Running 6743 sub problems to find dead transitions.
[2026-06-01 00:06:58] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6743 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 173/6918 variables, and 7 constraints, problems are : Problem set: 0 solved, 6743 unsolved in 30376 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/174 constraints, PredecessorRefiner: 6743/152 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6743 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6743 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 173/6918 variables, and 7 constraints, problems are : Problem set: 0 solved, 6743 unsolved in 30224 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/174 constraints, PredecessorRefiner: 6591/152 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72491ms problems are : Problem set: 0 solved, 6743 unsolved
Search for dead transitions found 0 dead transitions in 72697ms
Starting structural reductions in LTL mode, iteration 1 : 174/293 places, 6744/6879 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77937 ms. Remains : 174/293 places, 6744/6879 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 6744/6744 transitions.
Applied a total of 0 rules in 52 ms. Remains 174 /174 variables (removed 0) and now considering 6744/6744 (removed 0) transitions.
[2026-06-01 00:08:10] [INFO ] Invariant cache hit.
[2026-06-01 00:08:11] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-06-01 00:08:11] [INFO ] Invariant cache hit.
[2026-06-01 00:08:14] [INFO ] Implicit Places using invariants and state equation in 3460 ms returned []
Implicit Place search using SMT with State Equation took 3610 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3666 ms. Remains : 174/174 places, 6744/6744 transitions.
Support contains 49 out of 174 places after structural reductions.
[2026-06-01 00:08:16] [INFO ] Flatten gal took : 1452 ms
[2026-06-01 00:08:17] [INFO ] Flatten gal took : 923 ms
[2026-06-01 00:08:18] [INFO ] Input system was already deterministic with 6744 transitions.
Support contains 48 out of 174 places (down from 49) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 6998 ms. (5 steps per ms) remains 26/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 72 ms. (54 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 198902 steps, run timeout after 6001 ms. (steps per millisecond=33 ) properties seen :0 out of 26
Probabilistic random walk after 198902 steps, saw 38615 distinct states, run finished after 6012 ms. (steps per millisecond=33 ) properties seen :0
[2026-06-01 00:08:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (OVERLAPS) 35/81 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 62/143 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 31/174 variables, 7/20 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 25 unsolved
SMT process timed out in 5174ms, After SMT, problems are : Problem set: 1 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 6744/6744 transitions.
Graph (trivial) has 119 edges and 174 vertex of which 9 / 174 are part of one of the 4 SCC in 8 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 169 transition count 6710
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 33 rules applied. Total rules applied 58 place count 145 transition count 6701
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 139 transition count 6701
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 64 place count 139 transition count 6687
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 92 place count 125 transition count 6687
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 124 transition count 6686
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 124 transition count 6686
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 94 place count 124 transition count 6685
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 123 transition count 6685
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 3 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 148 place count 97 transition count 6659
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 154 place count 97 transition count 6653
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 157 place count 94 transition count 6646
Iterating global reduction 4 with 3 rules applied. Total rules applied 160 place count 94 transition count 6646
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 174 place count 87 transition count 6674
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 186 place count 87 transition count 6662
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 188 place count 85 transition count 6656
Iterating global reduction 5 with 2 rules applied. Total rules applied 190 place count 85 transition count 6656
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 200 place count 85 transition count 6646
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 202 place count 84 transition count 6659
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 203 place count 84 transition count 6658
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 211 place count 84 transition count 6650
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 214 place count 84 transition count 6647
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 217 place count 81 transition count 6647
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 218 place count 81 transition count 6646
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 219 place count 81 transition count 6652
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 222 place count 80 transition count 6650
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 235 place count 80 transition count 6637
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 242 place count 80 transition count 6637
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 249 place count 80 transition count 6630
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 250 place count 79 transition count 6629
Applied a total of 250 rules in 12720 ms. Remains 79 /174 variables (removed 95) and now considering 6629/6744 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12721 ms. Remains : 79/174 places, 6629/6744 transitions.
RANDOM walk for 40000 steps (8 resets) in 5692 ms. (7 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 146 ms. (27 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (8 resets) in 118 ms. (33 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 150 ms. (26 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (8 resets) in 130 ms. (30 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 169 ms. (23 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 193 ms. (20 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 184 ms. (21 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 216 ms. (18 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 181 ms. (21 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 167 ms. (23 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 168 ms. (23 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 166 ms. (23 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 180 ms. (22 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 78 ms. (50 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 168 ms. (23 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 79 ms. (50 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 177 ms. (22 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 156 ms. (25 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 189 ms. (21 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 25/25 properties
Interrupted probabilistic random walk after 105486 steps, run timeout after 6001 ms. (steps per millisecond=17 ) properties seen :2 out of 25
Probabilistic random walk after 105486 steps, saw 25369 distinct states, run finished after 6001 ms. (steps per millisecond=17 ) properties seen :2
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1008818495575238681.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17148510420259764788.kers'
[2026-06-01 00:08:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1008818495575238681.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17148510420259764788.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 29 ms.
// Phase 1: matrix 6629 rows 76 cols 113927 entries
Finished phase 1 with 56 SingleSign rule and 3 generalized
[2026-06-01 00:08:53] [INFO ] Computed 20 invariants in 110 ms
Computed 20 P flows in 111 ms.
Exported basis to /tmp/petrispot-output-17148510420259764788.kers
Total runtime 133 ms.
[2026-06-01 00:08:54] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 7/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 20/72 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 3/75 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 6626/6701 variables, 75/93 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6701 variables, 23/116 constraints. Problems are: Problem set: 0 solved, 23 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/6701 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 7/6708 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/6708 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/6708 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6708/6708 variables, and 123 constraints, problems are : Problem set: 0 solved, 23 unsolved in 45036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 79/79 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 23/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 7/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 20/72 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 3/75 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 6626/6701 variables, 75/93 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6701 variables, 23/116 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6701 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 7/6708 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/6708 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/6708 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6708/6708 variables, and 123 constraints, problems are : Problem set: 0 solved, 23 unsolved in 45021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 79/79 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 23/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90382ms problems are : Problem set: 0 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 6629/6629 transitions.
Applied a total of 0 rules in 1895 ms. Remains 79 /79 variables (removed 0) and now considering 6629/6629 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1895 ms. Remains : 79/79 places, 6629/6629 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA ErlangenMainframeV1-PT-bP07C07-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 19 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(p1 U X(!p0))))'
Support contains 14 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 6744/6744 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 159 transition count 4557
Ensure Unique test removed 6 places
Iterating global reduction 0 with 21 rules applied. Total rules applied 36 place count 153 transition count 4557
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 150 transition count 1479
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 150 transition count 1479
Applied a total of 42 rules in 129 ms. Remains 150 /174 variables (removed 24) and now considering 1479/6744 (removed 5265) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11968111796572326710.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-297500325524190120.kers'
[2026-06-01 00:10:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11968111796572326710.kers, --Pflows, --basisKERS=/tmp/petrispot-output-297500325524190120.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1479 rows 150 cols 16056 entries
Finished phase 1 with 135 SingleSign rule and 1 generalized
[2026-06-01 00:10:26] [INFO ] Computed 14 invariants in 11 ms
Computed 14 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-297500325524190120.kers
Total runtime 14 ms.
[2026-06-01 00:10:26] [INFO ] Implicit Places using invariants in 332 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 336 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 149/174 places, 1479/6744 transitions.
Applied a total of 0 rules in 8 ms. Remains 149 /149 variables (removed 0) and now considering 1479/1479 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 473 ms. Remains : 149/174 places, 1479/6744 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)&&(p1 U X(!p0))))'
Stuttering acceptance computed with spot in 456 ms :[true, p0, p0, true, true]
Running random walk in product with property : ErlangenMainframeV1-PT-bP07C07-LTLFireability-00
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 2 ms.
FORMULA ErlangenMainframeV1-PT-bP07C07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP07C07-LTLFireability-00 finished in 1045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 8 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 6744/6744 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 166 transition count 4684
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 166 transition count 4684
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 159 transition count 566
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 159 transition count 566
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 158 transition count 564
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 158 transition count 564
Applied a total of 32 rules in 256 ms. Remains 158 /174 variables (removed 16) and now considering 564/6744 (removed 6180) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1479239370863993039.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5687910186939650501.kers'
[2026-06-01 00:10:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1479239370863993039.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5687910186939650501.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 564 rows 158 cols 7146 entries
Finished phase 1 with 136 SingleSign rule and 2 generalized
[2026-06-01 00:10:27] [INFO ] Computed 20 invariants in 7 ms
Computed 20 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-5687910186939650501.kers
Total runtime 10 ms.
[2026-06-01 00:10:27] [INFO ] Implicit Places using invariants in 340 ms returned []
[2026-06-01 00:10:27] [INFO ] Invariant cache hit.
[2026-06-01 00:10:28] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
Running 563 sub problems to find dead transitions.
[2026-06-01 00:10:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 5 (OVERLAPS) 564/722 variables, 158/179 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 722/722 variables, and 179 constraints, problems are : Problem set: 0 solved, 563 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 563/161 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 5 (OVERLAPS) 564/722 variables, 158/179 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/722 variables, 161/340 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 722/722 variables, and 351 constraints, problems are : Problem set: 0 solved, 563 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 563/161 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60687ms problems are : Problem set: 0 solved, 563 unsolved
Search for dead transitions found 0 dead transitions in 60690ms
Starting structural reductions in LTL mode, iteration 1 : 158/174 places, 564/6744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61940 ms. Remains : 158/174 places, 564/6744 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP07C07-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 1293 ms.
Product exploration explored 100000 steps with 0 reset in 819 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge based reduction with 2 factoid took 58 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 558 ms. (71 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 479 ms. (83 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 997046 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :0 out of 1
Probabilistic random walk after 997046 steps, saw 136832 distinct states, run finished after 3001 ms. (steps per millisecond=332 ) properties seen :0
[2026-06-01 00:11:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/33 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/115 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/158 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 564/722 variables, 158/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/722 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/722 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 722/722 variables, and 178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/33 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/115 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 43/158 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 564/722 variables, 158/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/722 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/722 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 722/722 variables, and 179 constraints, problems are : Problem set: 0 solved, 1 unsolved in 603 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1024ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 67 ms.
Support contains 8 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 564/564 transitions.
Graph (trivial) has 141 edges and 158 vertex of which 11 / 158 are part of one of the 5 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 152 transition count 526
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 35 rules applied. Total rules applied 62 place count 126 transition count 517
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 68 place count 120 transition count 517
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 68 place count 120 transition count 504
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 94 place count 107 transition count 504
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 172 place count 68 transition count 465
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 178 place count 68 transition count 459
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 181 place count 65 transition count 452
Iterating global reduction 4 with 3 rules applied. Total rules applied 184 place count 65 transition count 452
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 198 place count 58 transition count 470
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 210 place count 58 transition count 458
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 212 place count 56 transition count 454
Iterating global reduction 5 with 2 rules applied. Total rules applied 214 place count 56 transition count 454
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 224 place count 56 transition count 444
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 226 place count 55 transition count 457
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 227 place count 55 transition count 456
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 240 place count 55 transition count 443
Free-agglomeration rule applied 14 times.
Iterating global reduction 7 with 14 rules applied. Total rules applied 254 place count 55 transition count 429
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 30 rules applied. Total rules applied 284 place count 41 transition count 413
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 285 place count 40 transition count 284
Iterating global reduction 8 with 1 rules applied. Total rules applied 286 place count 40 transition count 284
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 294 place count 40 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 297 place count 40 transition count 273
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 298 place count 40 transition count 272
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 398 edges and 39 vertex of which 35 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 3 rules applied. Total rules applied 301 place count 35 transition count 271
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 307 place count 35 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 308 place count 34 transition count 264
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 311 place count 31 transition count 264
Applied a total of 311 rules in 297 ms. Remains 31 /158 variables (removed 127) and now considering 264/564 (removed 300) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 31/158 places, 264/564 transitions.
RANDOM walk for 935 steps (0 resets) in 31 ms. (29 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 5110 ms.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 8 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 564/564 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 564/564 (removed 0) transitions.
[2026-06-01 00:11:36] [INFO ] Invariant cache hit.
[2026-06-01 00:11:37] [INFO ] Implicit Places using invariants in 333 ms returned []
[2026-06-01 00:11:37] [INFO ] Invariant cache hit.
[2026-06-01 00:11:37] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1010 ms. Remains : 158/158 places, 564/564 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge based reduction with 2 factoid took 43 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 696 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 447 ms. (89 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1043203 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :0 out of 1
Probabilistic random walk after 1043203 steps, saw 142375 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
[2026-06-01 00:11:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/33 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/115 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/158 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 564/722 variables, 158/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/722 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/722 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 722/722 variables, and 178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/33 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/115 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 43/158 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 564/722 variables, 158/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/722 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/722 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 722/722 variables, and 179 constraints, problems are : Problem set: 0 solved, 1 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 968ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 8 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 564/564 transitions.
Graph (trivial) has 141 edges and 158 vertex of which 11 / 158 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 152 transition count 526
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 35 rules applied. Total rules applied 62 place count 126 transition count 517
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 68 place count 120 transition count 517
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 68 place count 120 transition count 504
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 94 place count 107 transition count 504
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 172 place count 68 transition count 465
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 178 place count 68 transition count 459
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 181 place count 65 transition count 452
Iterating global reduction 4 with 3 rules applied. Total rules applied 184 place count 65 transition count 452
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 198 place count 58 transition count 470
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 210 place count 58 transition count 458
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 212 place count 56 transition count 454
Iterating global reduction 5 with 2 rules applied. Total rules applied 214 place count 56 transition count 454
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 224 place count 56 transition count 444
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 226 place count 55 transition count 457
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 227 place count 55 transition count 456
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 240 place count 55 transition count 443
Free-agglomeration rule applied 14 times.
Iterating global reduction 7 with 14 rules applied. Total rules applied 254 place count 55 transition count 429
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 30 rules applied. Total rules applied 284 place count 41 transition count 413
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 285 place count 40 transition count 284
Iterating global reduction 8 with 1 rules applied. Total rules applied 286 place count 40 transition count 284
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 294 place count 40 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 297 place count 40 transition count 273
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 298 place count 40 transition count 272
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 398 edges and 39 vertex of which 35 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 3 rules applied. Total rules applied 301 place count 35 transition count 271
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 307 place count 35 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 308 place count 34 transition count 264
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 311 place count 31 transition count 264
Applied a total of 311 rules in 166 ms. Remains 31 /158 variables (removed 127) and now considering 264/564 (removed 300) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 31/158 places, 264/564 transitions.
RANDOM walk for 921 steps (0 resets) in 15 ms. (57 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 4846 ms.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 964 ms.
Product exploration explored 100000 steps with 0 reset in 731 ms.
Spot run failed in 164 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/ltsmin10950087048800460662
[2026-06-01 00:11:44] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10950087048800460662
Running compilation step : cd /tmp/ltsmin10950087048800460662;'/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/ltsmin10950087048800460662;'/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/ltsmin10950087048800460662;'/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 8 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 564/564 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 564/564 (removed 0) transitions.
[2026-06-01 00:11:47] [INFO ] Invariant cache hit.
[2026-06-01 00:11:48] [INFO ] Implicit Places using invariants in 319 ms returned []
[2026-06-01 00:11:48] [INFO ] Invariant cache hit.
[2026-06-01 00:11:48] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 964 ms. Remains : 158/158 places, 564/564 transitions.
Built C files in :
/tmp/ltsmin4084649953066660111
[2026-06-01 00:11:48] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4084649953066660111
Running compilation step : cd /tmp/ltsmin4084649953066660111;'/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'
Compilation finished in 2566 ms.
Running link step : cd /tmp/ltsmin4084649953066660111;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin4084649953066660111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased12643224733996285604.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-06-01 00:12:04] [INFO ] Flatten gal took : 49 ms
[2026-06-01 00:12:04] [INFO ] Flatten gal took : 131 ms
[2026-06-01 00:12:04] [INFO ] Time to serialize gal into /tmp/LTL8776834878999598377.gal : 28 ms
[2026-06-01 00:12:04] [INFO ] Time to serialize properties into /tmp/LTL10002123587211545615.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/LTL8776834878999598377.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7141028353113115491.hoa' '-atoms' '/tmp/LTL10002123587211545615.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/LTL10002123587211545615.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7141028353113115491.hoa
Detected timeout of ITS tools.
[2026-06-01 00:12:20] [INFO ] Flatten gal took : 68 ms
[2026-06-01 00:12:20] [INFO ] Flatten gal took : 64 ms
[2026-06-01 00:12:20] [INFO ] Time to serialize gal into /tmp/LTL12109887651357629145.gal : 12 ms
[2026-06-01 00:12:20] [INFO ] Time to serialize properties into /tmp/LTL2867363371097375754.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/LTL12109887651357629145.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2867363371097375754.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((((p17!=1)||(p43!=1))||((p55!=1)||(p70!=1)))||(((p100!=1)||(p112!=1))||((p138!=1)||(p185!=1))))")))))
Formula 0 simplified : XXF!"((((p17!=1)||(p43!=1))||((p55!=1)||(p70!=1)))||(((p100!=1)||(p112!=1))||((p138!=1)||(p185!=1))))"
Detected timeout of ITS tools.
[2026-06-01 00:12:35] [INFO ] Flatten gal took : 40 ms
[2026-06-01 00:12:35] [INFO ] Applying decomposition
[2026-06-01 00:12:35] [INFO ] Flatten gal took : 40 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/graph3939956342541550315.txt' '-o' '/tmp/graph3939956342541550315.bin' '-w' '/tmp/graph3939956342541550315.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3939956342541550315.bin' '-l' '-1' '-v' '-w' '/tmp/graph3939956342541550315.weights' '-q' '0' '-e' '0.001'
[2026-06-01 00:12:35] [INFO ] Decomposing Gal with order
[2026-06-01 00:12:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-01 00:12:36] [INFO ] Removed a total of 94 redundant transitions.
[2026-06-01 00:12:36] [INFO ] Flatten gal took : 208 ms
[2026-06-01 00:12:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 14 ms.
[2026-06-01 00:12:36] [INFO ] Time to serialize gal into /tmp/LTL7726646978145392416.gal : 18 ms
[2026-06-01 00:12:36] [INFO ] Time to serialize properties into /tmp/LTL2114041930032332786.ltl : 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/LTL7726646978145392416.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2114041930032332786.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((((u8.p17!=1)||(u8.p43!=1))||((u8.p55!=1)||(u8.p70!=1)))||(((u8.p100!=1)||(u8.p112!=1))||((u8.p138!=1)||(u8.p185!=1))))")))...157
Formula 0 simplified : XXF!"((((u8.p17!=1)||(u8.p43!=1))||((u8.p55!=1)||(u8.p70!=1)))||(((u8.p100!=1)||(u8.p112!=1))||((u8.p138!=1)||(u8.p185!=1))))"
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV1-PT-bP07C07-LTLFireability-01 finished in 144048 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0 U (G(!p0)||(!p0&&G(!p1))))))'
Support contains 14 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 6744/6744 transitions.
Graph (trivial) has 130 edges and 174 vertex of which 9 / 174 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 168 transition count 6716
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 30 rules applied. Total rules applied 52 place count 147 transition count 6707
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 58 place count 141 transition count 6707
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 58 place count 141 transition count 6693
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 86 place count 127 transition count 6693
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 101 place count 112 transition count 4506
Ensure Unique test removed 7 places
Iterating global reduction 3 with 22 rules applied. Total rules applied 123 place count 105 transition count 4506
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 123 place count 105 transition count 4505
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 104 transition count 4505
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 128 place count 101 transition count 1427
Iterating global reduction 3 with 3 rules applied. Total rules applied 131 place count 101 transition count 1427
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 197 place count 68 transition count 1394
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 203 place count 68 transition count 1388
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 206 place count 65 transition count 1381
Iterating global reduction 4 with 3 rules applied. Total rules applied 209 place count 65 transition count 1381
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 221 place count 59 transition count 1399
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 233 place count 59 transition count 1387
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 235 place count 57 transition count 1383
Iterating global reduction 5 with 2 rules applied. Total rules applied 237 place count 57 transition count 1383
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 247 place count 57 transition count 1373
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 249 place count 56 transition count 1386
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 260 place count 56 transition count 1375
Partial Post-agglomeration rule applied 9 times.
Drop transitions (Partial Post agglomeration) removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 269 place count 56 transition count 1375
Applied a total of 269 rules in 680 ms. Remains 56 /174 variables (removed 118) and now considering 1375/6744 (removed 5369) transitions.
[2026-06-01 00:12:52] [INFO ] Flow matrix only has 1360 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9787920545171778982.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14633082487279168322.kers'
[2026-06-01 00:12:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9787920545171778982.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14633082487279168322.kers]
Normalized transition count is 1359 out of 1360 initially.
Culled 0 columns in 4 ms.
// Phase 1: matrix 1359 rows 56 cols 23626 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-06-01 00:12:52] [INFO ] Computed 13 invariants in 13 ms
Computed 13 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-14633082487279168322.kers
Total runtime 19 ms.
[2026-06-01 00:12:52] [INFO ] Implicit Places using invariants in 347 ms returned []
[2026-06-01 00:12:52] [INFO ] Flow matrix only has 1360 transitions (discarded 15 similar events)
[2026-06-01 00:12:52] [INFO ] Invariant cache hit.
[2026-06-01 00:12:52] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-01 00:12:53] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
[2026-06-01 00:12:53] [INFO ] Redundant transitions in 127 ms returned []
Running 1367 sub problems to find dead transitions.
[2026-06-01 00:12:53] [INFO ] Flow matrix only has 1360 transitions (discarded 15 similar events)
[2026-06-01 00:12:53] [INFO ] Invariant cache hit.
[2026-06-01 00:12:53] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1367 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1367 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 1359/1415 variables, 56/69 constraints. Problems are: Problem set: 0 solved, 1367 unsolved
SMT process timed out in 32303ms, After SMT, problems are : Problem set: 0 solved, 1367 unsolved
Search for dead transitions found 0 dead transitions in 32309ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/174 places, 1375/6744 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34257 ms. Remains : 56/174 places, 1375/6744 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0 U (G(!p0)||(!p0&&G(!p1))))))'
Stuttering acceptance computed with spot in 103 ms :[p0, (AND p1 p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP07C07-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 3539 ms.
Product exploration explored 100000 steps with 0 reset in 3123 ms.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 13 factoid took 60 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 3063 ms. (13 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 877 ms. (45 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 755 ms. (52 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1218 ms. (32 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1040 ms. (38 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1261 ms. (31 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 945 ms. (42 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 493203 steps, run timeout after 6001 ms. (steps per millisecond=82 ) properties seen :0 out of 6
Probabilistic random walk after 493203 steps, saw 80938 distinct states, run finished after 6001 ms. (steps per millisecond=82 ) properties seen :0
[2026-06-01 00:13:41] [INFO ] Flow matrix only has 1360 transitions (discarded 15 similar events)
[2026-06-01 00:13:41] [INFO ] Invariant cache hit.
[2026-06-01 00:13:41] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 29/43 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 13/56 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1359/1415 variables, 56/69 constraints. Problems are: Problem set: 1 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1415 variables, 10/79 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1415 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1416 variables, 1/80 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1416 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1416 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1416/1416 variables, and 80 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1211 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 56/56 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 29/43 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 13/56 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1359/1415 variables, 56/69 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1415 variables, 10/79 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1415 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1416 variables, 1/80 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1416 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1416 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1416/1416 variables, and 80 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1980 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 56/56 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3229ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 401 ms.
Support contains 14 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1375/1375 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 56 transition count 1369
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 54 transition count 1369
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 54 transition count 1359
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 28 place count 44 transition count 1359
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 44 place count 44 transition count 1343
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 44 transition count 1349
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 48 place count 43 transition count 1347
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 61 place count 43 transition count 1334
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 42 transition count 1333
Applied a total of 62 rules in 1548 ms. Remains 42 /56 variables (removed 14) and now considering 1333/1375 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1549 ms. Remains : 42/56 places, 1333/1375 transitions.
RANDOM walk for 23064 steps (5 resets) in 948 ms. (24 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge based reduction with 14 factoid took 159 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[p0, (AND p0 p1)]
Knowledge-based reduction took 14745 ms.
Stuttering acceptance computed with spot in 101 ms :[p0, (AND p0 p1)]
Support contains 14 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 1375/1375 transitions.
Applied a total of 0 rules in 56 ms. Remains 56 /56 variables (removed 0) and now considering 1375/1375 (removed 0) transitions.
[2026-06-01 00:13:47] [INFO ] Flow matrix only has 1360 transitions (discarded 15 similar events)
[2026-06-01 00:13:47] [INFO ] Invariant cache hit.
[2026-06-01 00:13:47] [INFO ] Implicit Places using invariants in 288 ms returned []
[2026-06-01 00:13:47] [INFO ] Flow matrix only has 1360 transitions (discarded 15 similar events)
[2026-06-01 00:13:47] [INFO ] Invariant cache hit.
[2026-06-01 00:13:48] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-01 00:13:48] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
[2026-06-01 00:13:48] [INFO ] Redundant transitions in 140 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1276 ms. Remains : 56/56 places, 1375/1375 transitions.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 13 factoid took 78 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 2310 ms. (17 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1061 ms. (37 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 871 ms. (45 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 902 ms. (44 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 757 ms. (52 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 953 ms. (41 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 991 ms. (40 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 479876 steps, run timeout after 6001 ms. (steps per millisecond=79 ) properties seen :0 out of 6
Probabilistic random walk after 479876 steps, saw 78925 distinct states, run finished after 6001 ms. (steps per millisecond=79 ) properties seen :0
[2026-06-01 00:13:56] [INFO ] Flow matrix only has 1360 transitions (discarded 15 similar events)
[2026-06-01 00:13:56] [INFO ] Invariant cache hit.
[2026-06-01 00:13:56] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 29/43 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 13/56 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1359/1415 variables, 56/69 constraints. Problems are: Problem set: 1 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1415 variables, 10/79 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1415 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1416 variables, 1/80 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1416 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1416 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1416/1416 variables, and 80 constraints, problems are : Problem set: 1 solved, 5 unsolved in 950 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 56/56 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 29/43 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 13/56 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1359/1415 variables, 56/69 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1415 variables, 10/79 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1415 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1416 variables, 1/80 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1416 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1416 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1416/1416 variables, and 80 constraints, problems are : Problem set: 1 solved, 5 unsolved in 2201 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 56/56 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3174ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 887 steps, including 39 resets, run visited all 2 properties in 36 ms. (steps per millisecond=24 )
Parikh walk visited 5 properties in 234 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 14 factoid took 167 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[p0, (AND p0 p1)]
Knowledge-based reduction took 12052 ms.
Stuttering acceptance computed with spot in 103 ms :[p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 103 ms :[p0, (AND p0 p1)]
Product exploration explored 100000 steps with 0 reset in 3286 ms.
Product exploration explored 100000 steps with 0 reset in 3131 ms.
Built C files in :
/tmp/ltsmin12743721726114605940
[2026-06-01 00:14:07] [INFO ] Computing symmetric may disable matrix : 1375 transitions.
[2026-06-01 00:14:08] [INFO ] Computation of Complete disable matrix. took 864 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-01 00:14:08] [INFO ] Computing symmetric may enable matrix : 1375 transitions.
[2026-06-01 00:14:08] [INFO ] Computation of Complete enable matrix. took 56 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-01 00:14:08] [INFO ] Computing Do-Not-Accords matrix : 1375 transitions.
[2026-06-01 00:14:08] [INFO ] Computation of Completed DNA matrix. took 177 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-01 00:14:09] [INFO ] Built C files in 1896ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12743721726114605940
Running compilation step : cd /tmp/ltsmin12743721726114605940;'/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/ltsmin12743721726114605940;'/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/ltsmin12743721726114605940;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 14 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 1375/1375 transitions.
Applied a total of 0 rules in 36 ms. Remains 56 /56 variables (removed 0) and now considering 1375/1375 (removed 0) transitions.
[2026-06-01 00:14:12] [INFO ] Flow matrix only has 1360 transitions (discarded 15 similar events)
[2026-06-01 00:14:12] [INFO ] Invariant cache hit.
[2026-06-01 00:14:12] [INFO ] Implicit Places using invariants in 210 ms returned []
[2026-06-01 00:14:12] [INFO ] Flow matrix only has 1360 transitions (discarded 15 similar events)
[2026-06-01 00:14:12] [INFO ] Invariant cache hit.
[2026-06-01 00:14:13] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-01 00:14:13] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 1293 ms to find 0 implicit places.
[2026-06-01 00:14:13] [INFO ] Redundant transitions in 91 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1429 ms. Remains : 56/56 places, 1375/1375 transitions.
Built C files in :
/tmp/ltsmin15251729039034872267
[2026-06-01 00:14:13] [INFO ] Computing symmetric may disable matrix : 1375 transitions.
[2026-06-01 00:14:14] [INFO ] Computation of Complete disable matrix. took 965 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-01 00:14:14] [INFO ] Computing symmetric may enable matrix : 1375 transitions.
[2026-06-01 00:14:14] [INFO ] Computation of Complete enable matrix. took 115 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-01 00:14:15] [INFO ] Computing Do-Not-Accords matrix : 1375 transitions.
[2026-06-01 00:14:15] [INFO ] Computation of Completed DNA matrix. took 192 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-01 00:14:15] [INFO ] Built C files in 2155ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15251729039034872267
Running compilation step : cd /tmp/ltsmin15251729039034872267;'/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/ltsmin15251729039034872267;'/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/ltsmin15251729039034872267;'/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-06-01 00:14:19] [INFO ] Flatten gal took : 248 ms
[2026-06-01 00:14:19] [INFO ] Flatten gal took : 172 ms
[2026-06-01 00:14:19] [INFO ] Time to serialize gal into /tmp/LTL13932427528539805233.gal : 24 ms
[2026-06-01 00:14:19] [INFO ] Time to serialize properties into /tmp/LTL8960220395593237766.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/LTL13932427528539805233.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15898963022099983448.hoa' '-atoms' '/tmp/LTL8960220395593237766.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8960220395593237766.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15898963022099983448.hoa
Detected timeout of ITS tools.
[2026-06-01 00:14:35] [INFO ] Flatten gal took : 165 ms
[2026-06-01 00:14:35] [INFO ] Flatten gal took : 174 ms
[2026-06-01 00:14:35] [INFO ] Time to serialize gal into /tmp/LTL14851943393300141981.gal : 25 ms
[2026-06-01 00:14:35] [INFO ] Time to serialize properties into /tmp/LTL16006432873628771239.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/LTL14851943393300141981.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16006432873628771239.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
Checking formula 0 : !((F((!("(((((p25==1)&&(p37==1))&&((p56==1)&&(p82==1)))&&(((p94==1)&&(p120==1))&&((p128==1)&&(p179==1))))&&(p286==1))"))U((G(!("(((((p...504
Formula 0 simplified : G(F"(((((p14==1)&&(p37==1))&&((p63==1)&&(p82==1)))&&(((p94==1)&&(p113==1))&&((p132==1)&&(p179==1))))&&(p275==1))" U "(((((p25==1)&&(...250
Detected timeout of ITS tools.
[2026-06-01 00:14:50] [INFO ] Flatten gal took : 179 ms
[2026-06-01 00:14:50] [INFO ] Applying decomposition
[2026-06-01 00:14:50] [INFO ] Flatten gal took : 270 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/graph8412636692393503883.txt' '-o' '/tmp/graph8412636692393503883.bin' '-w' '/tmp/graph8412636692393503883.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8412636692393503883.bin' '-l' '-1' '-v' '-w' '/tmp/graph8412636692393503883.weights' '-q' '0' '-e' '0.001'
[2026-06-01 00:14:51] [INFO ] Decomposing Gal with order
[2026-06-01 00:14:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-01 00:14:52] [INFO ] Removed a total of 12228 redundant transitions.
[2026-06-01 00:14:52] [INFO ] Flatten gal took : 526 ms
[2026-06-01 00:14:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 128 ms.
[2026-06-01 00:14:52] [INFO ] Time to serialize gal into /tmp/LTL6520409378177847897.gal : 8 ms
[2026-06-01 00:14:52] [INFO ] Time to serialize properties into /tmp/LTL13776314873484703841.ltl : 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/LTL6520409378177847897.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13776314873484703841.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((!("(((((i0.u2.p25==1)&&(i0.u3.p37==1))&&((i0.u5.p56==1)&&(i1.u9.p82==1)))&&(((i0.u4.p94==1)&&(i0.u4.p120==1))&&((i0.u2.p128==1)&...719
Formula 0 simplified : G(F"(((((i0.u1.p14==1)&&(i0.u3.p37==1))&&((i1.u9.p63==1)&&(i1.u9.p82==1)))&&(((i0.u4.p94==1)&&(i0.u6.p113==1))&&((i0.u7.p132==1)&&(i...359
Reverse transition relation is NOT exact ! Due to transitions t69_t70_t72_t80_t86_t73_t78, Intersection with reachable at each step enabled. (destroyed/re...190
4 unique states visited
3 strongly connected components in search stack
7 transitions explored
4 items max in DFS search stack
224 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.34358,81908,1,0,106656,6232,9131,326112,443,76297,133694
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV1-PT-bP07C07-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ErlangenMainframeV1-PT-bP07C07-LTLFireability-02 finished in 123700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(F(X((F(X(p0)) U p1))))))))'
Support contains 9 out of 174 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 : 174/174 places, 6744/6744 transitions.
Graph (trivial) has 130 edges and 174 vertex of which 9 / 174 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 168 transition count 6716
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 30 rules applied. Total rules applied 52 place count 147 transition count 6707
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 58 place count 141 transition count 6707
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 58 place count 141 transition count 6693
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 86 place count 127 transition count 6693
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 101 place count 112 transition count 4506
Ensure Unique test removed 7 places
Iterating global reduction 3 with 22 rules applied. Total rules applied 123 place count 105 transition count 4506
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 123 place count 105 transition count 4505
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 104 transition count 4505
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 127 place count 102 transition count 2075
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 102 transition count 2075
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 101 transition count 2073
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 101 transition count 2073
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 195 place count 69 transition count 2041
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 201 place count 69 transition count 2035
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 204 place count 66 transition count 2028
Iterating global reduction 4 with 3 rules applied. Total rules applied 207 place count 66 transition count 2028
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 221 place count 59 transition count 2046
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 233 place count 59 transition count 2034
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 235 place count 57 transition count 2030
Iterating global reduction 5 with 2 rules applied. Total rules applied 237 place count 57 transition count 2030
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 247 place count 57 transition count 2020
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 249 place count 56 transition count 2033
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 258 place count 56 transition count 2024
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 266 place count 56 transition count 2024
Applied a total of 266 rules in 586 ms. Remains 56 /174 variables (removed 118) and now considering 2024/6744 (removed 4720) transitions.
[2026-06-01 00:14:55] [INFO ] Flow matrix only has 2009 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8569603059692738674.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5731454789665314168.kers'
[2026-06-01 00:14:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8569603059692738674.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5731454789665314168.kers]
Normalized transition count is 2008 out of 2009 initially.
Culled 0 columns in 6 ms.
// Phase 1: matrix 2008 rows 56 cols 35300 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-06-01 00:14:55] [INFO ] Computed 13 invariants in 17 ms
Computed 13 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-5731454789665314168.kers
Total runtime 24 ms.
[2026-06-01 00:14:56] [INFO ] Implicit Places using invariants in 499 ms returned []
[2026-06-01 00:14:56] [INFO ] Flow matrix only has 2009 transitions (discarded 15 similar events)
[2026-06-01 00:14:56] [INFO ] Invariant cache hit.
[2026-06-01 00:14:56] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-01 00:14:57] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
[2026-06-01 00:14:57] [INFO ] Redundant transitions in 127 ms returned []
Running 2016 sub problems to find dead transitions.
[2026-06-01 00:14:57] [INFO ] Flow matrix only has 2009 transitions (discarded 15 similar events)
[2026-06-01 00:14:57] [INFO ] Invariant cache hit.
[2026-06-01 00:14:57] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2016 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2016 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 56/2065 variables, and 13 constraints, problems are : Problem set: 0 solved, 2016 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/56 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 2016/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2016 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2016 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2016 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 56/2065 variables, and 13 constraints, problems are : Problem set: 0 solved, 2016 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/56 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1988/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62903ms problems are : Problem set: 0 solved, 2016 unsolved
Search for dead transitions found 0 dead transitions in 62913ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/174 places, 2024/6744 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65222 ms. Remains : 56/174 places, 2024/6744 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(F(X((F(X(p0)) U p1))))))))'
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP07C07-LTLFireability-04
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 2 ms.
FORMULA ErlangenMainframeV1-PT-bP07C07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP07C07-LTLFireability-04 finished in 65391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((!p0||X(((X(!p0)&&F(p1))||X(G(!p0))))))||(G(F(p1))&&(!p0||X(((X(!p0)&&F(p1))||X(G(!p0)))))))))'
Support contains 9 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 6744/6744 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 166 transition count 4684
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 166 transition count 4684
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 159 transition count 566
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 159 transition count 566
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 157 transition count 562
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 157 transition count 562
Applied a total of 34 rules in 270 ms. Remains 157 /174 variables (removed 17) and now considering 562/6744 (removed 6182) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11428953546205443170.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8324692308965592002.kers'
[2026-06-01 00:16:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11428953546205443170.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8324692308965592002.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 562 rows 157 cols 7142 entries
Finished phase 1 with 135 SingleSign rule and 2 generalized
[2026-06-01 00:16:00] [INFO ] Computed 20 invariants in 8 ms
Computed 20 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-8324692308965592002.kers
Total runtime 11 ms.
[2026-06-01 00:16:01] [INFO ] Implicit Places using invariants in 335 ms returned []
[2026-06-01 00:16:01] [INFO ] Invariant cache hit.
[2026-06-01 00:16:01] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 994 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2026-06-01 00:16:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/719 variables, 157/178 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 719/719 variables, and 178 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 561/159 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/719 variables, 157/178 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/719 variables, 159/337 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 719/719 variables, and 344 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 561/159 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60844ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60847ms
Starting structural reductions in LTL mode, iteration 1 : 157/174 places, 562/6744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62114 ms. Remains : 157/174 places, 562/6744 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(((X(p1)&&F(p2))||X(G(p1))))||p0))||(G(F(p2))&&(X(((X(p1)&&F(p2))||X(G(p1))))||p3)))))'
Stuttering acceptance computed with spot in 791 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP07C07-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 917 ms.
Product exploration explored 100000 steps with 0 reset in 721 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge based reduction with 8 factoid took 117 ms. Reduced automaton from 15 states, 27 edges and 4 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 417 ms. (95 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 349 ms. (114 steps per ms) remains 2/2 properties
[2026-06-01 00:17:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/33 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 82/115 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 5 (OVERLAPS) 42/157 variables, 7/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 1/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 562/719 variables, 157/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/719 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/719 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 719/719 variables, and 178 constraints, problems are : Problem set: 1 solved, 1 unsolved in 836 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/32 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/114 variables, 5/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/157 variables, 7/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 1/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 562/719 variables, 157/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/719 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/719 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 719/719 variables, and 178 constraints, problems are : Problem set: 1 solved, 1 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1326ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 8 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 562/562 transitions.
Graph (trivial) has 139 edges and 157 vertex of which 11 / 157 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 151 transition count 524
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 35 rules applied. Total rules applied 62 place count 125 transition count 515
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 68 place count 119 transition count 515
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 68 place count 119 transition count 502
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 94 place count 106 transition count 502
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 168 place count 69 transition count 465
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 174 place count 69 transition count 459
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 177 place count 66 transition count 452
Iterating global reduction 4 with 3 rules applied. Total rules applied 180 place count 66 transition count 452
Performed 8 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 196 place count 58 transition count 470
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 208 place count 58 transition count 458
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 210 place count 56 transition count 454
Iterating global reduction 5 with 2 rules applied. Total rules applied 212 place count 56 transition count 454
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 222 place count 56 transition count 444
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 224 place count 55 transition count 457
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 225 place count 55 transition count 456
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 237 place count 55 transition count 444
Free-agglomeration rule applied 14 times.
Iterating global reduction 7 with 14 rules applied. Total rules applied 251 place count 55 transition count 430
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 30 rules applied. Total rules applied 281 place count 41 transition count 414
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 282 place count 40 transition count 285
Iterating global reduction 8 with 1 rules applied. Total rules applied 283 place count 40 transition count 285
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 291 place count 40 transition count 277
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 295 place count 40 transition count 273
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 296 place count 40 transition count 272
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 398 edges and 39 vertex of which 35 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 3 rules applied. Total rules applied 299 place count 35 transition count 271
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 305 place count 35 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 306 place count 34 transition count 264
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 309 place count 31 transition count 264
Applied a total of 309 rules in 209 ms. Remains 31 /157 variables (removed 126) and now considering 264/562 (removed 298) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 31/157 places, 264/562 transitions.
RANDOM walk for 4052 steps (0 resets) in 85 ms. (47 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge based reduction with 9 factoid took 178 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Knowledge-based reduction took 2596 ms.
Stuttering acceptance computed with spot in 365 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 9 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 562/562 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2026-06-01 00:17:08] [INFO ] Invariant cache hit.
[2026-06-01 00:17:08] [INFO ] Implicit Places using invariants in 308 ms returned []
[2026-06-01 00:17:08] [INFO ] Invariant cache hit.
[2026-06-01 00:17:08] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 923 ms. Remains : 157/157 places, 562/562 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge based reduction with 2 factoid took 55 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 40000 steps (8 resets) in 429 ms. (93 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
[2026-06-01 00:17:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/32 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/114 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/157 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 562/719 variables, 157/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/719 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/719 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 719/719 variables, and 178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/32 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/114 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/157 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 562/719 variables, 157/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/719 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/719 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 719/719 variables, and 178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1045ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 8 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 562/562 transitions.
Graph (trivial) has 139 edges and 157 vertex of which 11 / 157 are part of one of the 5 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 151 transition count 524
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 35 rules applied. Total rules applied 62 place count 125 transition count 515
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 68 place count 119 transition count 515
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 68 place count 119 transition count 502
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 94 place count 106 transition count 502
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 168 place count 69 transition count 465
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 174 place count 69 transition count 459
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 177 place count 66 transition count 452
Iterating global reduction 4 with 3 rules applied. Total rules applied 180 place count 66 transition count 452
Performed 8 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 196 place count 58 transition count 470
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 208 place count 58 transition count 458
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 210 place count 56 transition count 454
Iterating global reduction 5 with 2 rules applied. Total rules applied 212 place count 56 transition count 454
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 222 place count 56 transition count 444
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 224 place count 55 transition count 457
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 225 place count 55 transition count 456
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 237 place count 55 transition count 444
Free-agglomeration rule applied 14 times.
Iterating global reduction 7 with 14 rules applied. Total rules applied 251 place count 55 transition count 430
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 30 rules applied. Total rules applied 281 place count 41 transition count 414
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 282 place count 40 transition count 285
Iterating global reduction 8 with 1 rules applied. Total rules applied 283 place count 40 transition count 285
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 291 place count 40 transition count 277
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 295 place count 40 transition count 273
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 296 place count 40 transition count 272
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 398 edges and 39 vertex of which 35 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 3 rules applied. Total rules applied 299 place count 35 transition count 271
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 305 place count 35 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 306 place count 34 transition count 264
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 309 place count 31 transition count 264
Applied a total of 309 rules in 207 ms. Remains 31 /157 variables (removed 126) and now considering 264/562 (removed 298) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 31/157 places, 264/562 transitions.
RANDOM walk for 4548 steps (0 resets) in 104 ms. (43 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Knowledge-based reduction took 2040 ms.
Stuttering acceptance computed with spot in 362 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 990 ms.
Product exploration explored 100000 steps with 0 reset in 720 ms.
Spot run failed in 52 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin3677511109578910071
[2026-06-01 00:17:13] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3677511109578910071
Running compilation step : cd /tmp/ltsmin3677511109578910071;'/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'
Compilation finished in 2397 ms.
Running link step : cd /tmp/ltsmin3677511109578910071;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin3677511109578910071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased12326590722839829311.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 562/562 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2026-06-01 00:17:28] [INFO ] Invariant cache hit.
[2026-06-01 00:17:28] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-06-01 00:17:28] [INFO ] Invariant cache hit.
[2026-06-01 00:17:29] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 723 ms. Remains : 157/157 places, 562/562 transitions.
Built C files in :
/tmp/ltsmin2932233030136256482
[2026-06-01 00:17:29] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2932233030136256482
Running compilation step : cd /tmp/ltsmin2932233030136256482;'/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'
Compilation finished in 2413 ms.
Running link step : cd /tmp/ltsmin2932233030136256482;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2932233030136256482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased15087454497647869838.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-06-01 00:17:44] [INFO ] Flatten gal took : 69 ms
[2026-06-01 00:17:44] [INFO ] Flatten gal took : 69 ms
[2026-06-01 00:17:44] [INFO ] Time to serialize gal into /tmp/LTL3314020631873644890.gal : 11 ms
[2026-06-01 00:17:44] [INFO ] Time to serialize properties into /tmp/LTL15217426364147654074.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/LTL3314020631873644890.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3319200121940847383.hoa' '-atoms' '/tmp/LTL15217426364147654074.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/LTL15217426364147654074.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3319200121940847383.hoa
Detected timeout of ITS tools.
[2026-06-01 00:18:00] [INFO ] Flatten gal took : 68 ms
[2026-06-01 00:18:00] [INFO ] Flatten gal took : 69 ms
[2026-06-01 00:18:00] [INFO ] Time to serialize gal into /tmp/LTL10534629769287971314.gal : 12 ms
[2026-06-01 00:18:00] [INFO ] Time to serialize properties into /tmp/LTL17325611343019613693.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/LTL10534629769287971314.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17325611343019613693.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
Checking formula 0 : !((X((G(("((((p13!=1)||(p43!=1))||((p55!=1)||(p74!=1)))||(((p100!=1)||(p108!=1))||((p131!=1)||(p185!=1))))")||(X((X(G("((((p13!=1)||(p...734
Formula 0 simplified : X(F(!"((((p13!=1)||(p43!=1))||((p55!=1)||(p74!=1)))||(((p100!=1)||(p108!=1))||((p131!=1)||(p185!=1))))" & X(XF!"((((p13!=1)||(p43!=1...704
Detected timeout of ITS tools.
[2026-06-01 00:18:15] [INFO ] Flatten gal took : 40 ms
[2026-06-01 00:18:15] [INFO ] Applying decomposition
[2026-06-01 00:18:15] [INFO ] Flatten gal took : 40 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/graph18312220660274765037.txt' '-o' '/tmp/graph18312220660274765037.bin' '-w' '/tmp/graph18312220660274765037.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18312220660274765037.bin' '-l' '-1' '-v' '-w' '/tmp/graph18312220660274765037.weights' '-q' '0' '-e' '0.001'
[2026-06-01 00:18:15] [INFO ] Decomposing Gal with order
[2026-06-01 00:18:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-01 00:18:15] [INFO ] Removed a total of 104 redundant transitions.
[2026-06-01 00:18:15] [INFO ] Flatten gal took : 71 ms
[2026-06-01 00:18:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 3 ms.
[2026-06-01 00:18:15] [INFO ] Time to serialize gal into /tmp/LTL12707213828077502036.gal : 10 ms
[2026-06-01 00:18:15] [INFO ] Time to serialize properties into /tmp/LTL12755244593513273706.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/LTL12707213828077502036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12755244593513273706.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((G(("((((u17.p13!=1)||(u17.p43!=1))||((u17.p55!=1)||(u17.p74!=1)))||(((u17.p100!=1)||(u17.p108!=1))||((u17.p131!=1)||(u17.p185!=1...953
Formula 0 simplified : X(F(!"((((u17.p13!=1)||(u17.p43!=1))||((u17.p55!=1)||(u17.p74!=1)))||(((u17.p100!=1)||(u17.p108!=1))||((u17.p131!=1)||(u17.p185!=1))...923
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV1-PT-bP07C07-LTLFireability-05 finished in 150383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((X((G(p2)||p1))||p0)))))))'
Support contains 16 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 6744/6744 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 159 transition count 4557
Ensure Unique test removed 6 places
Iterating global reduction 0 with 21 rules applied. Total rules applied 36 place count 153 transition count 4557
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 152 transition count 3099
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 152 transition count 3099
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 151 transition count 3097
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 151 transition count 3097
Applied a total of 40 rules in 111 ms. Remains 151 /174 variables (removed 23) and now considering 3097/6744 (removed 3647) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14745042844297263956.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16361730229491619779.kers'
[2026-06-01 00:18:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14745042844297263956.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16361730229491619779.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 3097 rows 151 cols 35492 entries
Finished phase 1 with 136 SingleSign rule and 1 generalized
[2026-06-01 00:18:30] [INFO ] Computed 14 invariants in 19 ms
Computed 14 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-16361730229491619779.kers
Total runtime 25 ms.
[2026-06-01 00:18:31] [INFO ] Implicit Places using invariants in 402 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 405 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/174 places, 3097/6744 transitions.
Applied a total of 0 rules in 9 ms. Remains 150 /150 variables (removed 0) and now considering 3097/3097 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 526 ms. Remains : 150/174 places, 3097/6744 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((X((G(p2)||p1))||p0)))))))'
Stuttering acceptance computed with spot in 308 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP07C07-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 6239 ms.
Product exploration explored 100000 steps with 0 reset in 5925 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge based reduction with 1 factoid took 56 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 3045 ms. (13 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1939 ms. (20 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1959 ms. (20 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1433 ms. (27 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1458 ms. (27 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1945 ms. (20 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 2263 ms. (17 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1495 ms. (26 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 984283 steps, run timeout after 15001 ms. (steps per millisecond=65 ) properties seen :0 out of 7
Probabilistic random walk after 984283 steps, saw 137767 distinct states, run finished after 15001 ms. (steps per millisecond=65 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15617034599050770156.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4564256576278145301.kers'
[2026-06-01 00:19:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15617034599050770156.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4564256576278145301.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 3097 rows 150 cols 32575 entries
Finished phase 1 with 137 SingleSign rule and 0 generalized
[2026-06-01 00:19:04] [INFO ] Computed 13 invariants in 19 ms
Computed 13 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-4564256576278145301.kers
Total runtime 26 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 75/91 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 59/150 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 3097/3247 variables, 150/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3247 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/3247 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3247/3247 variables, and 163 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2262 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 75/91 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 59/150 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 3097/3247 variables, 150/163 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3247 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/3247 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3247/3247 variables, and 163 constraints, problems are : Problem set: 1 solved, 6 unsolved in 4243 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6566ms problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 678 steps, including 9 resets, run visited all 2 properties in 21 ms. (steps per millisecond=32 )
Parikh walk visited 6 properties in 288 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 397 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Knowledge-based reduction took 27744 ms.
Stuttering acceptance computed with spot in 388 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 16 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 3097/3097 transitions.
Applied a total of 0 rules in 16 ms. Remains 150 /150 variables (removed 0) and now considering 3097/3097 (removed 0) transitions.
[2026-06-01 00:19:12] [INFO ] Invariant cache hit.
[2026-06-01 00:19:12] [INFO ] Implicit Places using invariants in 614 ms returned []
[2026-06-01 00:19:12] [INFO ] Invariant cache hit.
[2026-06-01 00:19:14] [INFO ] Implicit Places using invariants and state equation in 1485 ms returned []
Implicit Place search using SMT with State Equation took 2101 ms to find 0 implicit places.
Running 3096 sub problems to find dead transitions.
[2026-06-01 00:19:14] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 149/3247 variables, and 0 constraints, problems are : Problem set: 0 solved, 3096 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/150 constraints, PredecessorRefiner: 3096/158 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 149/3247 variables, and 0 constraints, problems are : Problem set: 0 solved, 3096 unsolved in 30094 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/150 constraints, PredecessorRefiner: 2938/158 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65368ms problems are : Problem set: 0 solved, 3096 unsolved
Search for dead transitions found 0 dead transitions in 65379ms
Finished structural reductions in LTL mode , in 1 iterations and 67506 ms. Remains : 150/150 places, 3097/3097 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 3727 ms. (10 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1574 ms. (25 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1457 ms. (27 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1575 ms. (25 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1358 ms. (29 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1647 ms. (24 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 582922 steps, run timeout after 9001 ms. (steps per millisecond=64 ) properties seen :0 out of 5
Probabilistic random walk after 582922 steps, saw 88726 distinct states, run finished after 9001 ms. (steps per millisecond=64 ) properties seen :0
[2026-06-01 00:20:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 75/91 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 59/150 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3097/3247 variables, 150/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3247 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/3247 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3247/3247 variables, and 163 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1902 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 150/150 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 75/91 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 59/150 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3097/3247 variables, 150/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3247 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/3247 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3247/3247 variables, and 163 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3742 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5665ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 85 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=28 )
Parikh walk visited 5 properties in 264 ms.
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Knowledge-based reduction took 19027 ms.
Stuttering acceptance computed with spot in 355 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 382 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 6509 ms.
Product exploration explored 100000 steps with 0 reset in 5833 ms.
Spot run failed in 52 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin1138849897450088440
[2026-06-01 00:20:51] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1138849897450088440
Running compilation step : cd /tmp/ltsmin1138849897450088440;'/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/ltsmin1138849897450088440;'/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/ltsmin1138849897450088440;'/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 16 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 3097/3097 transitions.
Applied a total of 0 rules in 9 ms. Remains 150 /150 variables (removed 0) and now considering 3097/3097 (removed 0) transitions.
[2026-06-01 00:20:54] [INFO ] Invariant cache hit.
[2026-06-01 00:20:55] [INFO ] Implicit Places using invariants in 475 ms returned []
[2026-06-01 00:20:55] [INFO ] Invariant cache hit.
[2026-06-01 00:20:56] [INFO ] Implicit Places using invariants and state equation in 1571 ms returned []
Implicit Place search using SMT with State Equation took 2049 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2059 ms. Remains : 150/150 places, 3097/3097 transitions.
Built C files in :
/tmp/ltsmin6938169625937822171
[2026-06-01 00:20:56] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6938169625937822171
Running compilation step : cd /tmp/ltsmin6938169625937822171;'/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/ltsmin6938169625937822171;'/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/ltsmin6938169625937822171;'/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-06-01 00:21:00] [INFO ] Flatten gal took : 226 ms
[2026-06-01 00:21:00] [INFO ] Flatten gal took : 231 ms
[2026-06-01 00:21:00] [INFO ] Time to serialize gal into /tmp/LTL10585611735814560897.gal : 38 ms
[2026-06-01 00:21:00] [INFO ] Time to serialize properties into /tmp/LTL1375405500076727982.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/LTL10585611735814560897.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8099586173597464721.hoa' '-atoms' '/tmp/LTL1375405500076727982.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/LTL1375405500076727982.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8099586173597464721.hoa
Detected timeout of ITS tools.
[2026-06-01 00:21:16] [INFO ] Flatten gal took : 301 ms
[2026-06-01 00:21:16] [INFO ] Flatten gal took : 229 ms
[2026-06-01 00:21:16] [INFO ] Time to serialize gal into /tmp/LTL7616002455167692796.gal : 37 ms
[2026-06-01 00:21:16] [INFO ] Time to serialize properties into /tmp/LTL8321895153546171277.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/LTL7616002455167692796.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8321895153546171277.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G(("((((p14==0)||(p44==0))||((p52==0)||(p71==0)))||(((p94==0)||(p120==0))||((p132==0)||(p179==0))))")||(("(p286==0)")||(X((...399
Formula 0 simplified : XXXXF(!"((((p14==0)||(p44==0))||((p52==0)||(p71==0)))||(((p94==0)||(p120==0))||((p132==0)||(p179==0))))" & !"(p286==0)" & X(!"((((p1...379
Detected timeout of ITS tools.
[2026-06-01 00:21:32] [INFO ] Flatten gal took : 454 ms
[2026-06-01 00:21:32] [INFO ] Applying decomposition
[2026-06-01 00:21:32] [INFO ] Flatten gal took : 307 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/graph11345234304018932895.txt' '-o' '/tmp/graph11345234304018932895.bin' '-w' '/tmp/graph11345234304018932895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11345234304018932895.bin' '-l' '-1' '-v' '-w' '/tmp/graph11345234304018932895.weights' '-q' '0' '-e' '0.001'
[2026-06-01 00:21:32] [INFO ] Decomposing Gal with order
[2026-06-01 00:21:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-01 00:21:34] [INFO ] Removed a total of 8126 redundant transitions.
[2026-06-01 00:21:34] [INFO ] Flatten gal took : 802 ms
[2026-06-01 00:21:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1012 labels/synchronizations in 141 ms.
[2026-06-01 00:21:34] [INFO ] Time to serialize gal into /tmp/LTL3755311266452609996.gal : 7 ms
[2026-06-01 00:21:34] [INFO ] Time to serialize properties into /tmp/LTL893549354218978649.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/LTL3755311266452609996.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL893549354218978649.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
Checking formula 0 : !((X(X(X(X(G(("((((i3.u42.p14==0)||(i3.u24.p44==0))||((u43.p52==0)||(i3.u24.p71==0)))||(((i3.u24.p94==0)||(i3.u24.p120==0))||((i3.u24....558
Formula 0 simplified : XXXXF(!"((((i3.u42.p14==0)||(i3.u24.p44==0))||((u43.p52==0)||(i3.u24.p71==0)))||(((i3.u24.p94==0)||(i3.u24.p120==0))||((i3.u24.p132=...538
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV1-PT-bP07C07-LTLFireability-07 finished in 198587 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(F(G((X((F(G(p0))&&X(p1))) U p2))))))'
Support contains 19 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 6744/6744 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 166 transition count 4684
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 166 transition count 4684
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 163 transition count 1606
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 163 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 162 transition count 1604
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 162 transition count 1604
Applied a total of 24 rules in 119 ms. Remains 162 /174 variables (removed 12) and now considering 1604/6744 (removed 5140) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6342415345264612543.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8398753065361658699.kers'
[2026-06-01 00:21:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6342415345264612543.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8398753065361658699.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 1604 rows 162 cols 25866 entries
Finished phase 1 with 140 SingleSign rule and 2 generalized
[2026-06-01 00:21:49] [INFO ] Computed 20 invariants in 17 ms
Computed 20 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-8398753065361658699.kers
Total runtime 22 ms.
[2026-06-01 00:21:49] [INFO ] Implicit Places using invariants in 364 ms returned []
[2026-06-01 00:21:49] [INFO ] Invariant cache hit.
[2026-06-01 00:21:50] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1323 ms to find 0 implicit places.
Running 1603 sub problems to find dead transitions.
[2026-06-01 00:21:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 161/1766 variables, and 7 constraints, problems are : Problem set: 0 solved, 1603 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/162 constraints, PredecessorRefiner: 1603/157 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 162/1766 variables, and 21 constraints, problems are : Problem set: 0 solved, 1603 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/162 constraints, PredecessorRefiner: 1446/157 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62047ms problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 62053ms
Starting structural reductions in LTL mode, iteration 1 : 162/174 places, 1604/6744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63501 ms. Remains : 162/174 places, 1604/6744 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(F(G((X((F(G(p0))&&X(p1))) U p2))))))'
Stuttering acceptance computed with spot in 235 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP07C07-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 2918 ms.
Stack based approach found an accepted trace after 97 steps with 0 reset with depth 98 and stack size 98 in 2 ms.
FORMULA ErlangenMainframeV1-PT-bP07C07-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP07C07-LTLFireability-09 finished in 66730 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 9 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 6744/6744 transitions.
Graph (trivial) has 135 edges and 174 vertex of which 9 / 174 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 168 transition count 6716
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 30 rules applied. Total rules applied 52 place count 147 transition count 6707
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 58 place count 141 transition count 6707
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 58 place count 141 transition count 6693
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 86 place count 127 transition count 6693
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 101 place count 112 transition count 4506
Ensure Unique test removed 7 places
Iterating global reduction 3 with 22 rules applied. Total rules applied 123 place count 105 transition count 4506
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 123 place count 105 transition count 4505
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 104 transition count 4505
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 132 place count 97 transition count 387
Iterating global reduction 3 with 7 rules applied. Total rules applied 139 place count 97 transition count 387
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 141 place count 95 transition count 383
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 95 transition count 383
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 209 place count 62 transition count 350
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 215 place count 62 transition count 344
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 218 place count 59 transition count 337
Iterating global reduction 4 with 3 rules applied. Total rules applied 221 place count 59 transition count 337
Performed 8 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 237 place count 51 transition count 355
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 249 place count 51 transition count 343
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 251 place count 49 transition count 339
Iterating global reduction 5 with 2 rules applied. Total rules applied 253 place count 49 transition count 339
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 263 place count 49 transition count 329
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 265 place count 48 transition count 342
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 278 place count 48 transition count 329
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 283 place count 48 transition count 329
Applied a total of 283 rules in 421 ms. Remains 48 /174 variables (removed 126) and now considering 329/6744 (removed 6415) transitions.
[2026-06-01 00:22:56] [INFO ] Flow matrix only has 314 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1866519872079909880.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13145866875957009664.kers'
[2026-06-01 00:22:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1866519872079909880.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13145866875957009664.kers]
Normalized transition count is 313 out of 314 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 313 rows 48 cols 4882 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-06-01 00:22:56] [INFO ] Computed 13 invariants in 3 ms
Computed 13 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13145866875957009664.kers
Total runtime 4 ms.
[2026-06-01 00:22:56] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-06-01 00:22:56] [INFO ] Flow matrix only has 314 transitions (discarded 15 similar events)
[2026-06-01 00:22:56] [INFO ] Invariant cache hit.
[2026-06-01 00:22:56] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-01 00:22:56] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2026-06-01 00:22:56] [INFO ] Redundant transitions in 4 ms returned []
Running 321 sub problems to find dead transitions.
[2026-06-01 00:22:56] [INFO ] Flow matrix only has 314 transitions (discarded 15 similar events)
[2026-06-01 00:22:56] [INFO ] Invariant cache hit.
[2026-06-01 00:22:56] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (OVERLAPS) 313/361 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (OVERLAPS) 1/362 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/362 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 72 constraints, problems are : Problem set: 0 solved, 321 unsolved in 27291 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 48/48 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 321/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (OVERLAPS) 313/361 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 38/109 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/362 variables, and 110 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 48/48 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 321/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 57750ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 57751ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/174 places, 329/6744 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58566 ms. Remains : 48/174 places, 329/6744 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 56 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP07C07-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP07C07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP07C07-LTLFireability-10 finished in 58657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&((p2 U (p3&&F(p0)))||p1))))'
Support contains 24 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 6744/6744 transitions.
Graph (trivial) has 130 edges and 174 vertex of which 7 / 174 are part of one of the 3 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 169 transition count 6718
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 29 rules applied. Total rules applied 50 place count 149 transition count 6709
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 57 place count 143 transition count 6708
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 142 transition count 6708
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 58 place count 142 transition count 6695
Deduced a syphon composed of 13 places in 6 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 84 place count 129 transition count 6695
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 86 place count 127 transition count 5965
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 127 transition count 5965
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 88 place count 127 transition count 5964
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 90 place count 126 transition count 5964
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 125 transition count 4506
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 125 transition count 4506
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 166 place count 88 transition count 4469
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 172 place count 88 transition count 4463
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 175 place count 85 transition count 4456
Iterating global reduction 5 with 3 rules applied. Total rules applied 178 place count 85 transition count 4456
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 190 place count 79 transition count 4474
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 202 place count 79 transition count 4462
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 204 place count 77 transition count 4458
Iterating global reduction 6 with 2 rules applied. Total rules applied 206 place count 77 transition count 4458
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 216 place count 77 transition count 4448
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 218 place count 76 transition count 4461
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 227 place count 76 transition count 4452
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 231 place count 76 transition count 4452
Applied a total of 231 rules in 2509 ms. Remains 76 /174 variables (removed 98) and now considering 4452/6744 (removed 2292) transitions.
[2026-06-01 00:23:57] [INFO ] Flow matrix only has 4438 transitions (discarded 14 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12874478057809931911.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17561806188551878233.kers'
[2026-06-01 00:23:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12874478057809931911.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17561806188551878233.kers]
Normalized transition count is 4437 out of 4438 initially.
Culled 0 columns in 12 ms.
// Phase 1: matrix 4437 rows 76 cols 76122 entries
Finished phase 1 with 53 SingleSign rule and 3 generalized
[2026-06-01 00:23:57] [INFO ] Computed 20 invariants in 42 ms
Computed 20 P flows in 43 ms.
Exported basis to /tmp/petrispot-output-17561806188551878233.kers
Total runtime 54 ms.
[2026-06-01 00:23:58] [INFO ] Implicit Places using invariants in 1018 ms returned []
[2026-06-01 00:23:58] [INFO ] Flow matrix only has 4438 transitions (discarded 14 similar events)
[2026-06-01 00:23:58] [INFO ] Invariant cache hit.
[2026-06-01 00:24:00] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-01 00:24:02] [INFO ] Implicit Places using invariants and state equation in 3749 ms returned []
Implicit Place search using SMT with State Equation took 4769 ms to find 0 implicit places.
[2026-06-01 00:24:02] [INFO ] Redundant transitions in 659 ms returned []
Running 4444 sub problems to find dead transitions.
[2026-06-01 00:24:02] [INFO ] Flow matrix only has 4438 transitions (discarded 14 similar events)
[2026-06-01 00:24:02] [INFO ] Invariant cache hit.
[2026-06-01 00:24:02] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4444 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 75/4514 variables, and 7 constraints, problems are : Problem set: 0 solved, 4444 unsolved in 30130 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/76 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 4444/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4444 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4444 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 75/4514 variables, and 7 constraints, problems are : Problem set: 0 solved, 4444 unsolved in 30132 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/76 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 4419/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67724ms problems are : Problem set: 0 solved, 4444 unsolved
Search for dead transitions found 0 dead transitions in 67750ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/174 places, 4452/6744 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75714 ms. Remains : 76/174 places, 4452/6744 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&((p2 U (p3&&F(p0)))||p1))))'
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP07C07-LTLFireability-12
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP07C07-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP07C07-LTLFireability-12 finished in 76105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((p1 U G(p2))||X(p1))))'
Support contains 24 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 6744/6744 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 166 transition count 4684
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 166 transition count 4684
Applied a total of 16 rules in 114 ms. Remains 166 /174 variables (removed 8) and now considering 4684/6744 (removed 2060) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17792606220432724780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5415077525529688499.kers'
[2026-06-01 00:25:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17792606220432724780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5415077525529688499.kers]
Culled 0 columns in 21 ms.
// Phase 1: matrix 4684 rows 166 cols 81274 entries
Finished phase 1 with 144 SingleSign rule and 2 generalized
[2026-06-01 00:25:11] [INFO ] Computed 20 invariants in 72 ms
Computed 20 P flows in 73 ms.
Exported basis to /tmp/petrispot-output-5415077525529688499.kers
Total runtime 93 ms.
[2026-06-01 00:25:12] [INFO ] Implicit Places using invariants in 1058 ms returned []
[2026-06-01 00:25:12] [INFO ] Invariant cache hit.
[2026-06-01 00:25:15] [INFO ] Implicit Places using invariants and state equation in 3521 ms returned []
Implicit Place search using SMT with State Equation took 4582 ms to find 0 implicit places.
Running 4683 sub problems to find dead transitions.
[2026-06-01 00:25:15] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4683 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 165/4850 variables, and 7 constraints, problems are : Problem set: 0 solved, 4683 unsolved in 30140 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/166 constraints, PredecessorRefiner: 4683/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4683 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4683 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 165/4850 variables, and 7 constraints, problems are : Problem set: 0 solved, 4683 unsolved in 30137 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/166 constraints, PredecessorRefiner: 4524/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67854ms problems are : Problem set: 0 solved, 4683 unsolved
Search for dead transitions found 0 dead transitions in 67876ms
Starting structural reductions in LTL mode, iteration 1 : 166/174 places, 4684/6744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72588 ms. Remains : 166/174 places, 4684/6744 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((p1 U G(p2))||X(p1))))'
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP07C07-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP07C07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP07C07-LTLFireability-14 finished in 72960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U (!p0&&X(!p2))))'
Support contains 24 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 6744/6744 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 173 transition count 6743
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 173 transition count 6743
Applied a total of 2 rules in 98 ms. Remains 173 /174 variables (removed 1) and now considering 6743/6744 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1399101344198408882.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11654533707759666875.kers'
[2026-06-01 00:26:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1399101344198408882.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11654533707759666875.kers]
Culled 0 columns in 32 ms.
// Phase 1: matrix 6743 rows 173 cols 114218 entries
Finished phase 1 with 150 SingleSign rule and 3 generalized
[2026-06-01 00:26:24] [INFO ] Computed 20 invariants in 116 ms
Computed 20 P flows in 117 ms.
Exported basis to /tmp/petrispot-output-11654533707759666875.kers
Total runtime 146 ms.
[2026-06-01 00:26:25] [INFO ] Implicit Places using invariants in 1477 ms returned []
[2026-06-01 00:26:25] [INFO ] Invariant cache hit.
[2026-06-01 00:26:31] [INFO ] Implicit Places using invariants and state equation in 5564 ms returned []
Implicit Place search using SMT with State Equation took 7046 ms to find 0 implicit places.
Running 6742 sub problems to find dead transitions.
[2026-06-01 00:26:31] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 172/6916 variables, and 7 constraints, problems are : Problem set: 0 solved, 6742 unsolved in 30191 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/173 constraints, PredecessorRefiner: 6742/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6742 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 172/6916 variables, and 7 constraints, problems are : Problem set: 0 solved, 6742 unsolved in 30193 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/173 constraints, PredecessorRefiner: 6591/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 71796ms problems are : Problem set: 0 solved, 6742 unsolved
Search for dead transitions found 0 dead transitions in 71834ms
Starting structural reductions in LTL mode, iteration 1 : 173/174 places, 6743/6744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79011 ms. Remains : 173/174 places, 6743/6744 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U (!p0&&X(!p2))))'
Stuttering acceptance computed with spot in 270 ms :[(OR p0 p2), (NOT p1), (AND (NOT p0) p2), p2, (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP07C07-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 819 ms.
Product exploration explored 100000 steps with 50000 reset in 677 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 19 factoid took 12 ms. Proved property starting from automaton with 5 states, 13 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 86 ms.
FORMULA ErlangenMainframeV1-PT-bP07C07-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP07C07-LTLFireability-15 finished in 80946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Spot run failed in 66 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((!p0||X(((X(!p0)&&F(p1))||X(G(!p0))))))||(G(F(p1))&&(!p0||X(((X(!p0)&&F(p1))||X(G(!p0)))))))))'
Spot run failed in 50 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((X((G(p2)||p1))||p0)))))))'
Spot run failed in 49 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-06-01 00:27:45] [INFO ] Flatten gal took : 871 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11275731745048734959
[2026-06-01 00:27:46] [INFO ] Too many transitions (6744) to apply POR reductions. Disabling POR matrices.
[2026-06-01 00:27:46] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11275731745048734959
Running compilation step : cd /tmp/ltsmin11275731745048734959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-06-01 00:27:46] [INFO ] Applying decomposition
[2026-06-01 00:27:47] [INFO ] Flatten gal took : 654 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/graph3134307908970440662.txt' '-o' '/tmp/graph3134307908970440662.bin' '-w' '/tmp/graph3134307908970440662.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3134307908970440662.bin' '-l' '-1' '-v' '-w' '/tmp/graph3134307908970440662.weights' '-q' '0' '-e' '0.001'
[2026-06-01 00:27:49] [INFO ] Decomposing Gal with order
[2026-06-01 00:27:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-01 00:27:50] [INFO ] Removed a total of 35468 redundant transitions.
[2026-06-01 00:27:50] [INFO ] Flatten gal took : 1312 ms
[2026-06-01 00:27:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 990 labels/synchronizations in 320 ms.
[2026-06-01 00:27:51] [INFO ] Time to serialize gal into /tmp/LTLFireability14709127345381736926.gal : 29 ms
[2026-06-01 00:27:51] [INFO ] Time to serialize properties into /tmp/LTLFireability15937622025240151338.ltl : 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/LTLFireability14709127345381736926.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15937622025240151338.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((X(X(G("((((i8.u7.p17!=1)||(u11.p43!=1))||((i8.u29.p55!=1)||(i8.u29.p70!=1)))||(((u17.p100!=1)||(i5.u19.p112!=1))||((u22.p138!=1)||(...179
Formula 0 simplified : XXF!"((((i8.u7.p17!=1)||(u11.p43!=1))||((i8.u29.p55!=1)||(i8.u29.p70!=1)))||(((u17.p100!=1)||(i5.u19.p112!=1))||((u22.p138!=1)||(i8....171
Compilation finished in 69315 ms.
Running link step : cd /tmp/ltsmin11275731745048734959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 104 ms.
Running LTSmin : cd /tmp/ltsmin11275731745048734959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin11275731745048734959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11275731745048734959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(([]((!(LTLAPp1==true)||X(((X(!(LTLAPp1==true))&&<>((LTLAPp2==true)))||X([](!(LTLAPp1==true)))))))||([](<>((LTLAPp2==true)))&&(!(LTLAPp1==true)||X(((X(!(LTLAPp1==true))&&<>((LTLAPp2==true)))||X([](!(LTLAPp1==true)))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin11275731745048734959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(([]((!(LTLAPp1==true)||X(((X(!(LTLAPp1==true))&&<>((LTLAPp2==true)))||X([](!(LTLAPp1==true)))))))||([](<>((LTLAPp2==true)))&&(!(LTLAPp1==true)||X(((X(!(LTLAPp1==true))&&<>((LTLAPp2==true)))||X([](!(LTLAPp1==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11275731745048734959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(X(X([]((X(([]((LTLAPp5==true))||(LTLAPp4==true)))||(LTLAPp3==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin11275731745048734959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(X(X([]((X(([]((LTLAPp5==true))||(LTLAPp4==true)))||(LTLAPp3==true)))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin11275731745048734959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-06-01 00:54:57] [INFO ] Applying decomposition
[2026-06-01 00:55:10] [INFO ] Flatten gal took : 13417 ms
[2026-06-01 00:55:20] [INFO ] Decomposing Gal with order
[2026-06-01 00:55:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-01 00:55:25] [INFO ] Removed a total of 56871 redundant transitions.
[2026-06-01 00:55:26] [INFO ] Flatten gal took : 1529 ms
[2026-06-01 00:55:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 291 labels/synchronizations in 280 ms.
[2026-06-01 00:55:26] [INFO ] Time to serialize gal into /tmp/LTLFireability11834623263985321685.gal : 50 ms
[2026-06-01 00:55:26] [INFO ] Time to serialize properties into /tmp/LTLFireability15101050197000595148.ltl : 15 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/LTLFireability11834623263985321685.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15101050197000595148.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((X(X(G("((((i0.i0.i0.i0.i0.i0.i0.u8.p17!=1)||(i0.i0.i0.i0.i0.i0.i0.u9.p43!=1))||((i0.i0.i0.i0.i0.i0.u10.p55!=1)||(i0.i0.i0.i0.i0.u11...271
Formula 0 simplified : XXF!"((((i0.i0.i0.i0.i0.i0.i0.u8.p17!=1)||(i0.i0.i0.i0.i0.i0.i0.u9.p43!=1))||((i0.i0.i0.i0.i0.i0.u10.p55!=1)||(i0.i0.i0.i0.i0.u11.p7...263
Reverse transition relation is NOT exact ! Due to transitions i0.t4763, i0.i0.u14.t92, i0.i0.u14.t4521, i0.i0.u14.t4522, i0.i0.i0.t93, i0.i0.i0.u13.t97, i0...958
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
176 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.81146,68840,1,0,94589,3942,2926,334952,1154,25039,62826
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV1-PT-bP07C07-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((G((!("((((i0.i0.i0.i0.i0.i0.i0.u8.p13==1)&&(i0.i0.i0.i0.i0.i0.i0.u9.p43==1))&&((i0.i0.i0.i0.i0.i0.u10.p55==1)&&(i0.i0.i0.i0.i0.u...1646
Formula 1 simplified : X(F("((((i0.i0.i0.i0.i0.i0.i0.u8.p13==1)&&(i0.i0.i0.i0.i0.i0.i0.u9.p43==1))&&((i0.i0.i0.i0.i0.i0.u10.p55==1)&&(i0.i0.i0.i0.i0.u11.p7...1592
46 unique states visited
46 strongly connected components in search stack
47 transitions explored
46 items max in DFS search stack
122 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.03247,105480,1,0,148071,23033,3085,527410,1160,156275,81821
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ErlangenMainframeV1-PT-bP07C07-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(X(X(X(G(("((((i0.i0.i0.i0.i0.i0.i0.u8.p14==0)||(i0.i0.i0.i0.i0.i0.i0.u9.p44==0))||((i0.i0.i0.i0.i0.i0.u10.p52==0)||(i0.i0.i0.i0.i...834
Formula 2 simplified : XXXXF(!"((((i0.i0.i0.i0.i0.i0.i0.u8.p14==0)||(i0.i0.i0.i0.i0.i0.i0.u9.p44==0))||((i0.i0.i0.i0.i0.i0.u10.p52==0)||(i0.i0.i0.i0.i0.u11...814
119 unique states visited
0 strongly connected components in search stack
234 transitions explored
83 items max in DFS search stack
43202 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,435.046,3993592,1,0,5.0078e+06,99035,3404,2.92978e+07,1175,1.24675e+06,925503
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA ErlangenMainframeV1-PT-bP07C07-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 3393902 ms.

BK_STOP 1780275806455

--------------------
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="ErlangenMainframeV1-PT-bP07C07"
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 ErlangenMainframeV1-PT-bP07C07, 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 r338-smll-178021499100100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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