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.r098-tall-177955695400260.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 DiscoveryGPU-PT-07b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695400260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.5K Mar 6 16:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 6 16:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 6 16:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 6 16:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 17 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 17 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 17 09:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 17 09:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Mar 6 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 6 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 6 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 6 16:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 17 09:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 17 09:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 54K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779595197883

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 03:59:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 03:59:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 03:59:59] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2026-05-24 03:59:59] [INFO ] Transformed 212 places.
[2026-05-24 03:59:59] [INFO ] Transformed 224 transitions.
[2026-05-24 03:59:59] [INFO ] Found NUPN structural information;
[2026-05-24 03:59:59] [INFO ] Parsed PT model containing 212 places and 224 transitions and 582 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 224/224 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 224
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 43 place count 169 transition count 195
Iterating global reduction 1 with 29 rules applied. Total rules applied 72 place count 169 transition count 195
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 79 place count 162 transition count 188
Iterating global reduction 1 with 7 rules applied. Total rules applied 86 place count 162 transition count 188
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 89 place count 159 transition count 185
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 place count 159 transition count 185
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 157 transition count 183
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 157 transition count 183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 156 transition count 181
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 156 transition count 181
Applied a total of 98 rules in 68 ms. Remains 156 /212 variables (removed 56) and now considering 181/224 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11708332679624175009.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4167718097846845264.kers'
[2026-05-24 03:59:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11708332679624175009.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4167718097846845264.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 156 cols 479 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-24 03:59:59] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4167718097846845264.kers
Total runtime 2 ms.
[2026-05-24 03:59:59] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-24 03:59:59] [INFO ] Invariant cache hit.
[2026-05-24 03:59:59] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2026-05-24 03:59:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (OVERLAPS) 181/337 variables, 156/158 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 0/337 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 167 constraints, problems are : Problem set: 0 solved, 180 unsolved in 9937 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/337 variables, 156/167 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 180/347 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 347 constraints, problems are : Problem set: 0 solved, 180 unsolved in 12129 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22187ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 22204ms
Starting structural reductions in LTL mode, iteration 1 : 156/212 places, 181/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22703 ms. Remains : 156/212 places, 181/224 transitions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 181/181 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2026-05-24 04:00:22] [INFO ] Invariant cache hit.
[2026-05-24 04:00:22] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-24 04:00:22] [INFO ] Invariant cache hit.
[2026-05-24 04:00:22] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 272 ms. Remains : 156/156 places, 181/181 transitions.
Support contains 29 out of 156 places after structural reductions.
[2026-05-24 04:00:22] [INFO ] Flatten gal took : 34 ms
[2026-05-24 04:00:22] [INFO ] Flatten gal took : 13 ms
[2026-05-24 04:00:22] [INFO ] Input system was already deterministic with 181 transitions.
Support contains 27 out of 156 places (down from 29) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 37229 steps (161 resets) in 878 ms. (42 steps per ms) remains 0/24 properties
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 302 edges and 156 vertex of which 153 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)&&X(F(p2))))))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 181/181 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 145 transition count 170
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 145 transition count 170
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 142 transition count 166
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 142 transition count 166
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 140 transition count 163
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 140 transition count 163
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 138 transition count 161
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 138 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 137 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 137 transition count 160
Applied a total of 38 rules in 9 ms. Remains 137 /156 variables (removed 19) and now considering 160/181 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8198733803385870589.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-679294851022247116.kers'
[2026-05-24 04:00:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8198733803385870589.kers, --Pflows, --basisKERS=/tmp/petrispot-output-679294851022247116.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 160 rows 137 cols 430 entries
Finished phase 1 with 135 SingleSign rule and 0 generalized
[2026-05-24 04:00:23] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-679294851022247116.kers
Total runtime 1 ms.
[2026-05-24 04:00:23] [INFO ] Implicit Places using invariants in 310 ms returned []
[2026-05-24 04:00:23] [INFO ] Invariant cache hit.
[2026-05-24 04:00:23] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2026-05-24 04:00:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (OVERLAPS) 160/297 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 7/146 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 146 constraints, problems are : Problem set: 0 solved, 159 unsolved in 7033 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/297 variables, 137/146 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 159/305 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 305 constraints, problems are : Problem set: 0 solved, 159 unsolved in 8999 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16057ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 16058ms
Starting structural reductions in LTL mode, iteration 1 : 137/156 places, 160/181 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16478 ms. Remains : 137/156 places, 160/181 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)&&X(F(p2))))))'
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-02
Stuttering criterion allowed to conclude after 1192 steps with 5 reset in 11 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-02 finished in 16904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 181/181 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 143 transition count 168
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 143 transition count 168
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 137 transition count 161
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 137 transition count 161
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 133 transition count 155
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 133 transition count 155
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 129 transition count 151
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 129 transition count 151
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 126 transition count 147
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 126 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 125 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 125 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 124 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 124 transition count 145
Applied a total of 64 rules in 24 ms. Remains 124 /156 variables (removed 32) and now considering 145/181 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10473706091857587211.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1705416977917829363.kers'
[2026-05-24 04:00:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10473706091857587211.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1705416977917829363.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 145 rows 124 cols 389 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-24 04:00:40] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1705416977917829363.kers
Total runtime 1 ms.
[2026-05-24 04:00:40] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 04:00:40] [INFO ] Invariant cache hit.
[2026-05-24 04:00:40] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2026-05-24 04:00:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/269 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/269 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 133 constraints, problems are : Problem set: 0 solved, 144 unsolved in 5657 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/269 variables, 124/133 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 144/277 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/269 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 277 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6543 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12218ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 12220ms
Starting structural reductions in LTL mode, iteration 1 : 124/156 places, 145/181 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12381 ms. Remains : 124/156 places, 145/181 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-06
Product exploration explored 100000 steps with 434 reset in 225 ms.
Stack based approach found an accepted trace after 19968 steps with 87 reset with depth 188 and stack size 184 in 32 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-06 finished in 12829 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 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 181/181 transitions.
Graph (complete) has 302 edges and 156 vertex of which 153 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 152 transition count 150
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 125 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 124 transition count 149
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 57 place count 124 transition count 129
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 97 place count 104 transition count 129
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 103 place count 98 transition count 123
Iterating global reduction 3 with 6 rules applied. Total rules applied 109 place count 98 transition count 123
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 113 place count 94 transition count 119
Iterating global reduction 3 with 4 rules applied. Total rules applied 117 place count 94 transition count 119
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 121 place count 90 transition count 112
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 90 transition count 112
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 86 transition count 107
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 86 transition count 107
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 85 transition count 106
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 85 transition count 106
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 203 place count 51 transition count 72
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 209 place count 45 transition count 60
Iterating global reduction 3 with 6 rules applied. Total rules applied 215 place count 45 transition count 60
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 221 place count 39 transition count 53
Iterating global reduction 3 with 6 rules applied. Total rules applied 227 place count 39 transition count 53
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 233 place count 33 transition count 42
Iterating global reduction 3 with 6 rules applied. Total rules applied 239 place count 33 transition count 42
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 245 place count 27 transition count 35
Iterating global reduction 3 with 6 rules applied. Total rules applied 251 place count 27 transition count 35
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 256 place count 22 transition count 26
Iterating global reduction 3 with 5 rules applied. Total rules applied 261 place count 22 transition count 26
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 266 place count 17 transition count 20
Iterating global reduction 3 with 5 rules applied. Total rules applied 271 place count 17 transition count 20
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 272 place count 16 transition count 19
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 16 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 274 place count 16 transition count 18
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 276 place count 14 transition count 16
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 14 edges and 12 vertex of which 9 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 280 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 281 place count 8 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 281 place count 8 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 283 place count 7 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 285 place count 6 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 287 place count 6 transition count 9
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 289 place count 4 transition count 7
Applied a total of 289 rules in 50 ms. Remains 4 /156 variables (removed 152) and now considering 7/181 (removed 174) transitions.
[2026-05-24 04:00:53] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15333677194139575784.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6037738007043268854.kers'
[2026-05-24 04:00:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15333677194139575784.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6037738007043268854.kers]
Normalized transition count is 5 out of 6 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-24 04:00:53] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6037738007043268854.kers
Total runtime 3 ms.
[2026-05-24 04:00:53] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-24 04:00:53] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2026-05-24 04:00:53] [INFO ] Invariant cache hit.
[2026-05-24 04:00:53] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2026-05-24 04:00:53] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-24 04:00:53] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2026-05-24 04:00:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 4 constraints, problems are : Problem set: 0 solved, 4 unsolved in 36 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/9 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 84ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/156 places, 7/181 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 4/156 places, 7/181 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-07 finished in 260 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(F(p0))&&(X(X(X(G(p1))))||F(p2)))))'
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 181/181 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 143 transition count 168
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 143 transition count 168
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 137 transition count 161
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 137 transition count 161
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 132 transition count 153
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 132 transition count 153
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 127 transition count 148
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 127 transition count 148
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 123 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 123 transition count 143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 122 transition count 142
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 122 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 121 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 121 transition count 141
Applied a total of 70 rules in 18 ms. Remains 121 /156 variables (removed 35) and now considering 141/181 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6761398380030175448.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3518640680453670173.kers'
[2026-05-24 04:00:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6761398380030175448.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3518640680453670173.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 141 rows 121 cols 378 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-24 04:00:53] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3518640680453670173.kers
Total runtime 1 ms.
[2026-05-24 04:00:53] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-24 04:00:53] [INFO ] Invariant cache hit.
[2026-05-24 04:00:53] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2026-05-24 04:00:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 141/262 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 7/130 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 130 constraints, problems are : Problem set: 0 solved, 140 unsolved in 5520 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/262 variables, 121/130 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 140/270 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 270 constraints, problems are : Problem set: 0 solved, 140 unsolved in 6924 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12458ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 12459ms
Starting structural reductions in LTL mode, iteration 1 : 121/156 places, 141/181 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12599 ms. Remains : 121/156 places, 141/181 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(X(X(X(G(p1))))||F(p2)))))'
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-08
Stuttering criterion allowed to conclude after 282 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-08 finished in 12946 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 U p1))))'
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 181/181 transitions.
Graph (complete) has 302 edges and 156 vertex of which 153 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 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 151
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 126 transition count 151
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 53 place count 126 transition count 132
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 91 place count 107 transition count 132
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 96 place count 102 transition count 127
Iterating global reduction 2 with 5 rules applied. Total rules applied 101 place count 102 transition count 127
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 105 place count 98 transition count 123
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 98 transition count 123
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 113 place count 94 transition count 116
Iterating global reduction 2 with 4 rules applied. Total rules applied 117 place count 94 transition count 116
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 90 transition count 111
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 90 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 89 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 89 transition count 110
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 195 place count 55 transition count 76
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 201 place count 49 transition count 64
Iterating global reduction 2 with 6 rules applied. Total rules applied 207 place count 49 transition count 64
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 212 place count 44 transition count 58
Iterating global reduction 2 with 5 rules applied. Total rules applied 217 place count 44 transition count 58
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 222 place count 39 transition count 49
Iterating global reduction 2 with 5 rules applied. Total rules applied 227 place count 39 transition count 49
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 232 place count 34 transition count 43
Iterating global reduction 2 with 5 rules applied. Total rules applied 237 place count 34 transition count 43
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 241 place count 30 transition count 36
Iterating global reduction 2 with 4 rules applied. Total rules applied 245 place count 30 transition count 36
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 249 place count 26 transition count 31
Iterating global reduction 2 with 4 rules applied. Total rules applied 253 place count 26 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 254 place count 25 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 255 place count 25 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 256 place count 25 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 257 place count 25 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 259 place count 23 transition count 27
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 261 place count 22 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 262 place count 21 transition count 26
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 262 place count 21 transition count 23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 268 place count 18 transition count 23
Applied a total of 268 rules in 38 ms. Remains 18 /156 variables (removed 138) and now considering 23/181 (removed 158) transitions.
[2026-05-24 04:01:06] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17829918043124122020.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13235055797450329689.kers'
[2026-05-24 04:01:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17829918043124122020.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13235055797450329689.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 21 rows 18 cols 69 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-24 04:01:06] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13235055797450329689.kers
Total runtime 0 ms.
[2026-05-24 04:01:06] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-24 04:01:06] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2026-05-24 04:01:06] [INFO ] Invariant cache hit.
[2026-05-24 04:01:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 04:01:06] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2026-05-24 04:01:06] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2026-05-24 04:01:06] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2026-05-24 04:01:06] [INFO ] Invariant cache hit.
[2026-05-24 04:01:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 21/39 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 20 constraints, problems are : Problem set: 0 solved, 22 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 21/39 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 22/42 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 22 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 471ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 471ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/156 places, 23/181 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 564 ms. Remains : 18/156 places, 23/181 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 U p1))))'
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-10
Stuttering criterion allowed to conclude after 91 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-10 finished in 673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 181/181 transitions.
Graph (complete) has 302 edges and 156 vertex of which 153 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 152 transition count 149
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 124 transition count 149
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 57 place count 124 transition count 129
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 97 place count 104 transition count 129
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 103 place count 98 transition count 123
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 98 transition count 123
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 112 place count 95 transition count 120
Iterating global reduction 2 with 3 rules applied. Total rules applied 115 place count 95 transition count 120
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 118 place count 92 transition count 114
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 92 transition count 114
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 124 place count 89 transition count 111
Iterating global reduction 2 with 3 rules applied. Total rules applied 127 place count 89 transition count 111
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 199 place count 53 transition count 75
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 204 place count 48 transition count 65
Iterating global reduction 2 with 5 rules applied. Total rules applied 209 place count 48 transition count 65
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 214 place count 43 transition count 59
Iterating global reduction 2 with 5 rules applied. Total rules applied 219 place count 43 transition count 59
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 224 place count 38 transition count 50
Iterating global reduction 2 with 5 rules applied. Total rules applied 229 place count 38 transition count 50
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 234 place count 33 transition count 44
Iterating global reduction 2 with 5 rules applied. Total rules applied 239 place count 33 transition count 44
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 244 place count 28 transition count 35
Iterating global reduction 2 with 5 rules applied. Total rules applied 249 place count 28 transition count 35
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 254 place count 23 transition count 29
Iterating global reduction 2 with 5 rules applied. Total rules applied 259 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 260 place count 22 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 261 place count 22 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 22 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 264 place count 20 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 22 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 271 place count 15 transition count 18
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 275 place count 11 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 281 place count 8 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 285 place count 6 transition count 11
Applied a total of 285 rules in 25 ms. Remains 6 /156 variables (removed 150) and now considering 11/181 (removed 170) transitions.
[2026-05-24 04:01:06] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1702372055137868818.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7665891173802144307.kers'
[2026-05-24 04:01:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1702372055137868818.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7665891173802144307.kers]
Normalized transition count is 7 out of 8 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 6 cols 11 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-24 04:01:06] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7665891173802144307.kers
Total runtime 0 ms.
[2026-05-24 04:01:06] [INFO ] Implicit Places using invariants in 15 ms returned []
[2026-05-24 04:01:06] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2026-05-24 04:01:06] [INFO ] Invariant cache hit.
[2026-05-24 04:01:06] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2026-05-24 04:01:06] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-24 04:01:06] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2026-05-24 04:01:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 7 unsolved in 52 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/13 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 51 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/156 places, 11/181 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 6/156 places, 11/181 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-11
Stuttering criterion allowed to conclude after 41 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-11 finished in 236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((F(p1)&&p0) U ((X(p3)||G(p1))&&p2))))))'
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 181/181 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 143 transition count 168
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 143 transition count 168
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 137 transition count 161
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 137 transition count 161
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 132 transition count 153
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 132 transition count 153
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 128 transition count 149
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 128 transition count 149
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 125 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 125 transition count 146
Applied a total of 62 rules in 12 ms. Remains 125 /156 variables (removed 31) and now considering 146/181 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14161035894458591957.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13499039200291125218.kers'
[2026-05-24 04:01:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14161035894458591957.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13499039200291125218.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 125 cols 393 entries
Finished phase 1 with 123 SingleSign rule and 0 generalized
[2026-05-24 04:01:07] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13499039200291125218.kers
Total runtime 3 ms.
[2026-05-24 04:01:07] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 04:01:07] [INFO ] Invariant cache hit.
[2026-05-24 04:01:07] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2026-05-24 04:01:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 146/271 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 7/134 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 0/271 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 134 constraints, problems are : Problem set: 0 solved, 145 unsolved in 5898 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/271 variables, 125/134 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 145/279 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/271 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 279 constraints, problems are : Problem set: 0 solved, 145 unsolved in 8371 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14288ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 14288ms
Starting structural reductions in LTL mode, iteration 1 : 125/156 places, 146/181 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14435 ms. Remains : 125/156 places, 146/181 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((F(p1)&&p0) U ((X(p3)||G(p1))&&p2))))))'
Stuttering acceptance computed with spot in 602 ms :[(OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), true, (NOT p1), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-12 finished in 15101 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(F((G(!p0)||(!p0&&F(p1)))))||(F(p2)&&X(F((G(!p0)||(!p0&&F(p1)))))))))'
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 181/181 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 145 transition count 170
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 145 transition count 170
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 140 transition count 164
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 140 transition count 164
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 135 transition count 156
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 135 transition count 156
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 130 transition count 151
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 130 transition count 151
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 126 transition count 146
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 126 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 125 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 125 transition count 145
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 124 transition count 144
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 124 transition count 144
Applied a total of 64 rules in 13 ms. Remains 124 /156 variables (removed 32) and now considering 144/181 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15207027028214641077.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5263129379634966794.kers'
[2026-05-24 04:01:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15207027028214641077.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5263129379634966794.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 144 rows 124 cols 387 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-24 04:01:22] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5263129379634966794.kers
Total runtime 3 ms.
[2026-05-24 04:01:22] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-24 04:01:22] [INFO ] Invariant cache hit.
[2026-05-24 04:01:22] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2026-05-24 04:01:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 144/268 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/268 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 133 constraints, problems are : Problem set: 0 solved, 143 unsolved in 5827 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/268 variables, 124/133 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 143/276 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/268 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 276 constraints, problems are : Problem set: 0 solved, 143 unsolved in 7228 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13072ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 13073ms
Starting structural reductions in LTL mode, iteration 1 : 124/156 places, 144/181 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13232 ms. Remains : 124/156 places, 144/181 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(F((G(p0)||(p0&&F(p1)))))||(F(p2)&&X(F((G(p0)||(p0&&F(p1)))))))))'
Stuttering acceptance computed with spot in 404 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-13
Product exploration explored 100000 steps with 4625 reset in 225 ms.
Product exploration explored 100000 steps with 4541 reset in 177 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Graph (complete) has 246 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 25 stabilizing places and 25 stable transitions
Detected a total of 25/124 stabilizing places and 25/144 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge based reduction with 14 factoid took 89 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (177 resets) in 196 ms. (203 steps per ms) remains 1/6 properties
BEST_FIRST walk for 15258 steps (9 resets) in 31 ms. (476 steps per ms) remains 0/1 properties
Knowledge based reduction with 14 factoid took 186 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 585 ms.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2026-05-24 04:01:37] [INFO ] Invariant cache hit.
[2026-05-24 04:01:37] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-24 04:01:37] [INFO ] Invariant cache hit.
[2026-05-24 04:01:37] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 124/124 places, 144/144 transitions.
Computed a total of 25 stabilizing places and 25 stable transitions
Graph (complete) has 246 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 25 stabilizing places and 25 stable transitions
Detected a total of 25/124 stabilizing places and 25/144 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge based reduction with 8 factoid took 63 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (170 resets) in 262 ms. (152 steps per ms) remains 1/6 properties
BEST_FIRST walk for 20047 steps (12 resets) in 35 ms. (556 steps per ms) remains 0/1 properties
Knowledge based reduction with 8 factoid took 157 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 552 ms.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2505 reset in 141 ms.
Product exploration explored 100000 steps with 2461 reset in 131 ms.
Spot run failed in 78 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/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/ltsmin11170664085654390312
[2026-05-24 04:01:38] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11170664085654390312
Running compilation step : cd /tmp/ltsmin11170664085654390312;'/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 387 ms.
Running link step : cd /tmp/ltsmin11170664085654390312;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin11170664085654390312;'/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/stateBased8249410581179221527.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2026-05-24 04:01:53] [INFO ] Invariant cache hit.
[2026-05-24 04:01:53] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 04:01:53] [INFO ] Invariant cache hit.
[2026-05-24 04:01:53] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 124/124 places, 144/144 transitions.
Built C files in :
/tmp/ltsmin2286504017999245753
[2026-05-24 04:01:53] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2286504017999245753
Running compilation step : cd /tmp/ltsmin2286504017999245753;'/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 234 ms.
Running link step : cd /tmp/ltsmin2286504017999245753;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2286504017999245753;'/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/stateBased17265907027707320820.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 04:02:08] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:02:08] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:02:08] [INFO ] Time to serialize gal into /tmp/LTL6720657193076174606.gal : 2 ms
[2026-05-24 04:02:08] [INFO ] Time to serialize properties into /tmp/LTL14709077379504571001.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/LTL6720657193076174606.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10059798769207107242.hoa' '-atoms' '/tmp/LTL14709077379504571001.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/LTL14709077379504571001.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10059798769207107242.hoa
Detected timeout of ITS tools.
[2026-05-24 04:02:23] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:02:23] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:02:23] [INFO ] Time to serialize gal into /tmp/LTL6685212279251833899.gal : 1 ms
[2026-05-24 04:02:23] [INFO ] Time to serialize properties into /tmp/LTL16351463151260012578.ltl : 7 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/LTL6685212279251833899.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16351463151260012578.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((G(F((G("((p98!=1)||(p210!=1))"))||(("((p98!=1)||(p210!=1))")&&(F("(p194!=1)"))))))||((F("(p140==1)"))&&(X(F((G("((p98!=1)||(p210...217
Formula 0 simplified : X((G!"(p140==1)" | XG(F!"((p98!=1)||(p210!=1))" & (!"((p98!=1)||(p210!=1))" | G!"(p194!=1)"))) & G(F!"((p98!=1)||(p210!=1))" & F(G!"...196
Detected timeout of ITS tools.
[2026-05-24 04:02:39] [INFO ] Flatten gal took : 10 ms
[2026-05-24 04:02:39] [INFO ] Applying decomposition
[2026-05-24 04:02:39] [INFO ] Flatten gal took : 6 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/graph8904237748350314288.txt' '-o' '/tmp/graph8904237748350314288.bin' '-w' '/tmp/graph8904237748350314288.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8904237748350314288.bin' '-l' '-1' '-v' '-w' '/tmp/graph8904237748350314288.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:02:39] [INFO ] Decomposing Gal with order
[2026-05-24 04:02:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:02:39] [INFO ] Removed a total of 54 redundant transitions.
[2026-05-24 04:02:39] [INFO ] Flatten gal took : 58 ms
[2026-05-24 04:02:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2026-05-24 04:02:39] [INFO ] Time to serialize gal into /tmp/LTL16825450538535290717.gal : 3 ms
[2026-05-24 04:02:39] [INFO ] Time to serialize properties into /tmp/LTL3528876769359684463.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/LTL16825450538535290717.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3528876769359684463.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G(F((G("((i8.u22.p98!=1)||(i13.u43.p210!=1))"))||(("((i8.u22.p98!=1)||(i13.u43.p210!=1))")&&(F("(i11.u36.p194!=1)"))))))||((F("(...300
Formula 0 simplified : X((G!"(i9.u30.p140==1)" | XG(F!"((i8.u22.p98!=1)||(i13.u43.p210!=1))" & (!"((i8.u22.p98!=1)||(i13.u43.p210!=1))" | G!"(i11.u36.p194!...279
Detected timeout of ITS tools.
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-13 finished in 92049 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X((F(p1) U X(X(p2)))))))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 181/181 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 144 transition count 169
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 144 transition count 169
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 139 transition count 163
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 139 transition count 163
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 136 transition count 159
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 136 transition count 159
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 133 transition count 156
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 133 transition count 156
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 131 transition count 153
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 131 transition count 153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 130 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 130 transition count 152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 129 transition count 151
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 129 transition count 151
Applied a total of 54 rules in 14 ms. Remains 129 /156 variables (removed 27) and now considering 151/181 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4770422687933491016.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12758080013554557607.kers'
[2026-05-24 04:02:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4770422687933491016.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12758080013554557607.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 151 rows 129 cols 405 entries
Finished phase 1 with 127 SingleSign rule and 0 generalized
[2026-05-24 04:02:54] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12758080013554557607.kers
Total runtime 1 ms.
[2026-05-24 04:02:54] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-24 04:02:54] [INFO ] Invariant cache hit.
[2026-05-24 04:02:54] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2026-05-24 04:02:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 151/280 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 7/138 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 138 constraints, problems are : Problem set: 0 solved, 150 unsolved in 6118 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 151/280 variables, 129/138 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 150/288 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 288 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7244 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13379ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 13379ms
Starting structural reductions in LTL mode, iteration 1 : 129/156 places, 151/181 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13547 ms. Remains : 129/156 places, 151/181 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X((F(p1) U X(X(p2)))))))'
Stuttering acceptance computed with spot in 479 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-14
Product exploration explored 100000 steps with 19997 reset in 94 ms.
Product exploration explored 100000 steps with 19925 reset in 88 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 258 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 11 states, 19 edges and 3 AP (stutter sensitive) to 11 states, 19 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (169 resets) in 127 ms. (312 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (36 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
[2026-05-24 04:03:08] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 2/280 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/129 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 6 factoid took 170 ms. Reduced automaton from 11 states, 19 edges and 3 AP (stutter sensitive) to 11 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 539 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Knowledge-based reduction took 908 ms.
Stuttering acceptance computed with spot in 494 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 151/151 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 151/151 (removed 0) transitions.
[2026-05-24 04:03:09] [INFO ] Invariant cache hit.
[2026-05-24 04:03:09] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-24 04:03:09] [INFO ] Invariant cache hit.
[2026-05-24 04:03:10] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 129/129 places, 151/151 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 258 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 11 states, 18 edges and 3 AP (stutter sensitive) to 11 states, 18 edges and 3 AP (stutter sensitive).
RANDOM walk for 5237 steps (20 resets) in 43 ms. (119 steps per ms) remains 0/4 properties
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 11 states, 18 edges and 3 AP (stutter sensitive) to 11 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 496 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Knowledge-based reduction took 823 ms.
Stuttering acceptance computed with spot in 492 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 510 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 19988 reset in 87 ms.
Product exploration explored 100000 steps with 20002 reset in 82 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/ltsmin12399105415204678026
[2026-05-24 04:03:12] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12399105415204678026
Running compilation step : cd /tmp/ltsmin12399105415204678026;'/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 264 ms.
Running link step : cd /tmp/ltsmin12399105415204678026;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12399105415204678026;'/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/stateBased10263135320193424361.hoa' '--buchi-type=spotba'
LTSmin run took 208 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-14 finished in 18443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)&&(p1 U X((p2||G(!p2))))))))'
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 181/181 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 142 transition count 167
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 142 transition count 167
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 136 transition count 160
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 136 transition count 160
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 131 transition count 152
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 131 transition count 152
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 126 transition count 147
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 126 transition count 147
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 122 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 122 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 121 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 121 transition count 141
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 120 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 120 transition count 140
Applied a total of 72 rules in 15 ms. Remains 120 /156 variables (removed 36) and now considering 140/181 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10716777525161111842.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17109680961924778547.kers'
[2026-05-24 04:03:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10716777525161111842.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17109680961924778547.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 140 rows 120 cols 377 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-24 04:03:12] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17109680961924778547.kers
Total runtime 7 ms.
[2026-05-24 04:03:12] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-24 04:03:12] [INFO ] Invariant cache hit.
[2026-05-24 04:03:12] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2026-05-24 04:03:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 140/260 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 7/129 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 129 constraints, problems are : Problem set: 0 solved, 139 unsolved in 6057 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/260 variables, 120/129 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 139/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 268 constraints, problems are : Problem set: 0 solved, 139 unsolved in 7191 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13260ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 13260ms
Starting structural reductions in LTL mode, iteration 1 : 120/156 places, 140/181 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13409 ms. Remains : 120/156 places, 140/181 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)&&(p1 U X((p2||G(!p2))))))))'
Stuttering acceptance computed with spot in 276 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), false, false, true, p2]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 98 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-15 finished in 13725 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(F((G(!p0)||(!p0&&F(p1)))))||(F(p2)&&X(F((G(!p0)||(!p0&&F(p1)))))))))'
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.
[2026-05-24 04:03:26] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9425651951230537685
[2026-05-24 04:03:26] [INFO ] Computing symmetric may disable matrix : 181 transitions.
[2026-05-24 04:03:26] [INFO ] Applying decomposition
[2026-05-24 04:03:26] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:03:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 04:03:26] [INFO ] Computing symmetric may enable matrix : 181 transitions.
[2026-05-24 04:03:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph16353416610539017305.txt' '-o' '/tmp/graph16353416610539017305.bin' '-w' '/tmp/graph16353416610539017305.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16353416610539017305.bin' '-l' '-1' '-v' '-w' '/tmp/graph16353416610539017305.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:03:26] [INFO ] Computing Do-Not-Accords matrix : 181 transitions.
[2026-05-24 04:03:26] [INFO ] Decomposing Gal with order
[2026-05-24 04:03:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:03:26] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 04:03:26] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9425651951230537685
Running compilation step : cd /tmp/ltsmin9425651951230537685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-24 04:03:26] [INFO ] Removed a total of 60 redundant transitions.
[2026-05-24 04:03:26] [INFO ] Flatten gal took : 12 ms
[2026-05-24 04:03:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-24 04:03:26] [INFO ] Time to serialize gal into /tmp/LTLFireability5670424361369898110.gal : 3 ms
[2026-05-24 04:03:26] [INFO ] Time to serialize properties into /tmp/LTLFireability13410059641816698229.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/LTLFireability5670424361369898110.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13410059641816698229.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...277
Read 1 LTL properties
Checking formula 0 : !((X((G(F((G(!("((i11.u27.p98==1)&&(i9.u56.p210==1))")))||((!("((i11.u27.p98==1)&&(i9.u56.p210==1))"))&&(F("(i17.u48.p194!=1)"))))))||...313
Formula 0 simplified : X((G!"(i14.u38.p140==1)" | XG(F"((i11.u27.p98==1)&&(i9.u56.p210==1))" & ("((i11.u27.p98==1)&&(i9.u56.p210==1))" | G!"(i17.u48.p194!=...276
Compilation finished in 366 ms.
Running link step : cd /tmp/ltsmin9425651951230537685;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9425651951230537685;'/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(([](<>(([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>((LTLAPp1==true))))))||(<>((LTLAPp2==true))&&X(<>(([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>((LTLAPp1==true)))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t127, t132, u54.t4, u54.t5, u54.t6, i1.u7.t118, i2.t77, i2.t64, i2.t47, i2.t30, i2.t13, i2.u8...609
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
8500 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,85.017,1107776,1,0,1.81817e+06,18593,2440,8.14716e+06,289,201424,1480026
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 300708 ms.

BK_STOP 1779595499759

--------------------
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="DiscoveryGPU-PT-07b"
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 DiscoveryGPU-PT-07b, 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 r098-tall-177955695400260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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