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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 8.3K Mar 6 16:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Mar 6 16:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 6 16:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 6 16:12 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.7K Mar 15 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 09:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 09:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 16:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Mar 6 16:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 6 16:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 6 16:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:11 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 61K 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-08b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779596721732

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-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 04:25:22] [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 04:25:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 04:25:23] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2026-05-24 04:25:23] [INFO ] Transformed 240 places.
[2026-05-24 04:25:23] [INFO ] Transformed 254 transitions.
[2026-05-24 04:25:23] [INFO ] Found NUPN structural information;
[2026-05-24 04:25:23] [INFO ] Parsed PT model containing 240 places and 254 transitions and 661 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 254/254 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 224 transition count 254
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 54 place count 186 transition count 216
Iterating global reduction 1 with 38 rules applied. Total rules applied 92 place count 186 transition count 216
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 180 transition count 210
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 180 transition count 210
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 176 transition count 206
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 176 transition count 206
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 116 place count 172 transition count 202
Iterating global reduction 1 with 4 rules applied. Total rules applied 120 place count 172 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 170 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 170 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 168 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 168 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 167 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 167 transition count 195
Applied a total of 130 rules in 76 ms. Remains 167 /240 variables (removed 73) and now considering 195/254 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11379358741330937903.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12586701770474316500.kers'
[2026-05-24 04:25:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11379358741330937903.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12586701770474316500.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 167 cols 520 entries
Finished phase 1 with 165 SingleSign rule and 0 generalized
[2026-05-24 04:25:23] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12586701770474316500.kers
Total runtime 1 ms.
[2026-05-24 04:25:23] [INFO ] Implicit Places using invariants in 208 ms returned []
[2026-05-24 04:25:23] [INFO ] Invariant cache hit.
[2026-05-24 04:25:23] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2026-05-24 04:25:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (OVERLAPS) 195/362 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 0/362 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 177 constraints, problems are : Problem set: 0 solved, 194 unsolved in 10369 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/362 variables, 167/177 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 194/371 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/362 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 371 constraints, problems are : Problem set: 0 solved, 194 unsolved in 12038 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22492ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 22508ms
Starting structural reductions in LTL mode, iteration 1 : 167/240 places, 195/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22990 ms. Remains : 167/240 places, 195/254 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 195/195 transitions.
Applied a total of 0 rules in 2 ms. Remains 167 /167 variables (removed 0) and now considering 195/195 (removed 0) transitions.
[2026-05-24 04:25:46] [INFO ] Invariant cache hit.
[2026-05-24 04:25:46] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-24 04:25:46] [INFO ] Invariant cache hit.
[2026-05-24 04:25:46] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 167/167 places, 195/195 transitions.
Support contains 31 out of 167 places after structural reductions.
[2026-05-24 04:25:46] [INFO ] Flatten gal took : 38 ms
[2026-05-24 04:25:46] [INFO ] Flatten gal took : 17 ms
[2026-05-24 04:25:46] [INFO ] Input system was already deterministic with 195 transitions.
RANDOM walk for 40000 steps (152 resets) in 914 ms. (43 steps per ms) remains 1/33 properties
BEST_FIRST walk for 13766 steps (7 resets) in 41 ms. (327 steps per ms) remains 0/1 properties
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 328 edges and 167 vertex of which 164 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.13 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((X(p0)&&(F(!p0)||X(p1)))))'
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 195/195 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 157 transition count 183
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 157 transition count 183
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 152 transition count 178
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 152 transition count 178
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 147 transition count 173
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 147 transition count 173
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 144 transition count 169
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 144 transition count 169
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 141 transition count 164
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 141 transition count 164
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 138 transition count 161
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 138 transition count 161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 136 transition count 159
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 136 transition count 159
Applied a total of 62 rules in 19 ms. Remains 136 /167 variables (removed 31) and now considering 159/195 (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-16070890244015158930.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16071635229221434928.kers'
[2026-05-24 04:25:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16070890244015158930.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16071635229221434928.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 159 rows 136 cols 428 entries
Finished phase 1 with 134 SingleSign rule and 0 generalized
[2026-05-24 04:25:47] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16071635229221434928.kers
Total runtime 1 ms.
[2026-05-24 04:25:47] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-24 04:25:47] [INFO ] Invariant cache hit.
[2026-05-24 04:25:47] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2026-05-24 04:25:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 159/295 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 8/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 146 constraints, problems are : Problem set: 0 solved, 158 unsolved in 7144 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 159/295 variables, 136/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 158/304 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 304 constraints, problems are : Problem set: 0 solved, 158 unsolved in 7913 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15091ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 15092ms
Starting structural reductions in LTL mode, iteration 1 : 136/167 places, 159/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15265 ms. Remains : 136/167 places, 159/195 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((X(p0)&&(F(!p0)||X(p1)))))'
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-00
Product exploration explored 100000 steps with 24096 reset in 197 ms.
Product exploration explored 100000 steps with 23918 reset in 140 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 273 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 27 stabilizing places and 27 stable transitions
Detected a total of 27/136 stabilizing places and 27/159 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 9 factoid took 65 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
RANDOM walk for 745 steps (3 resets) in 7 ms. (93 steps per ms) remains 0/6 properties
Knowledge based reduction with 9 factoid took 127 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2026-05-24 04:26:03] [INFO ] Invariant cache hit.
[2026-05-24 04:26:03] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-24 04:26:03] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2026-05-24 04:26:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:26:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-24 04:26:04] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2026-05-24 04:26:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 492 ms
[2026-05-24 04:26:04] [INFO ] Computed and/alt/rep : 155/239/155 causal constraints (skipped 3 transitions) in 6 ms.
[2026-05-24 04:26:04] [INFO ] Added : 47 causal constraints over 10 iterations in 184 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Knowledge-based reduction took 1591 ms.
Stuttering acceptance computed with spot in 212 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 159/159 transitions.
Graph (complete) has 273 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 134 transition count 141
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 118 transition count 141
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 33 place count 118 transition count 113
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 89 place count 90 transition count 113
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 151 place count 59 transition count 82
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 158 place count 52 transition count 68
Iterating global reduction 2 with 7 rules applied. Total rules applied 165 place count 52 transition count 68
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 172 place count 45 transition count 61
Iterating global reduction 2 with 7 rules applied. Total rules applied 179 place count 45 transition count 61
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 186 place count 38 transition count 47
Iterating global reduction 2 with 7 rules applied. Total rules applied 193 place count 38 transition count 47
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 200 place count 31 transition count 40
Iterating global reduction 2 with 7 rules applied. Total rules applied 207 place count 31 transition count 40
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 214 place count 24 transition count 26
Iterating global reduction 2 with 7 rules applied. Total rules applied 221 place count 24 transition count 26
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 228 place count 17 transition count 19
Iterating global reduction 2 with 7 rules applied. Total rules applied 235 place count 17 transition count 19
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 236 place count 17 transition count 18
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 238 place count 15 transition count 16
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 240 place count 14 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 241 place count 13 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 241 place count 13 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 245 place count 11 transition count 13
Applied a total of 245 rules in 42 ms. Remains 11 /136 variables (removed 125) and now considering 13/159 (removed 146) transitions.
[2026-05-24 04:26:05] [INFO ] Flow matrix only has 12 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-8951909760223488452.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1989833876357993407.kers'
[2026-05-24 04:26:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8951909760223488452.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1989833876357993407.kers]
Normalized transition count is 11 out of 12 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 11 cols 21 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-24 04:26:05] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1989833876357993407.kers
Total runtime 0 ms.
[2026-05-24 04:26:05] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 04:26:05] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2026-05-24 04:26:05] [INFO ] Invariant cache hit.
[2026-05-24 04:26:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-24 04:26:05] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2026-05-24 04:26:05] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2026-05-24 04:26:05] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2026-05-24 04:26:05] [INFO ] Invariant cache hit.
[2026-05-24 04:26:05] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 11/21 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1/22 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/23 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 20 constraints, problems are : Problem set: 0 solved, 11 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 11/21 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/22 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/23 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/23 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/23 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 31 constraints, problems are : Problem set: 0 solved, 11 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 258ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 259ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/136 places, 13/159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 348 ms. Remains : 11/136 places, 13/159 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/11 stabilizing places and 11/13 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 7 factoid took 271 ms. Proved property starting from automaton with 5 states, 11 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 276 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-00 finished in 18368 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 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 195/195 transitions.
Graph (complete) has 328 edges and 167 vertex of which 164 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 163 transition count 165
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 137 transition count 165
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 53 place count 137 transition count 139
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 105 place count 111 transition count 139
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 111 place count 105 transition count 131
Iterating global reduction 2 with 6 rules applied. Total rules applied 117 place count 105 transition count 131
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 101 transition count 127
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 101 transition count 127
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 99 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 99 transition count 123
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 97 transition count 121
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 97 transition count 121
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 209 place count 59 transition count 83
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 215 place count 53 transition count 72
Iterating global reduction 2 with 6 rules applied. Total rules applied 221 place count 53 transition count 72
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 227 place count 47 transition count 65
Iterating global reduction 2 with 6 rules applied. Total rules applied 233 place count 47 transition count 65
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 239 place count 41 transition count 53
Iterating global reduction 2 with 6 rules applied. Total rules applied 245 place count 41 transition count 53
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 251 place count 35 transition count 47
Iterating global reduction 2 with 6 rules applied. Total rules applied 257 place count 35 transition count 47
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 263 place count 29 transition count 35
Iterating global reduction 2 with 6 rules applied. Total rules applied 269 place count 29 transition count 35
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 275 place count 23 transition count 29
Iterating global reduction 2 with 6 rules applied. Total rules applied 281 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 282 place count 22 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 283 place count 22 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 284 place count 21 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 285 place count 21 transition count 26
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 286 place count 21 transition count 25
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 287 place count 21 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 289 place count 19 transition count 23
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 20 edges and 17 vertex of which 14 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
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 296 place count 14 transition count 16
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 300 place count 10 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 304 place count 8 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 305 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 307 place count 6 transition count 11
Applied a total of 307 rules in 34 ms. Remains 6 /167 variables (removed 161) and now considering 11/195 (removed 184) transitions.
[2026-05-24 04:26:05] [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-10985121164111471790.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16422790224010370605.kers'
[2026-05-24 04:26:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10985121164111471790.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16422790224010370605.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:26:05] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16422790224010370605.kers
Total runtime 0 ms.
[2026-05-24 04:26:05] [INFO ] Implicit Places using invariants in 14 ms returned []
[2026-05-24 04:26:05] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2026-05-24 04:26:05] [INFO ] Invariant cache hit.
[2026-05-24 04:26:05] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2026-05-24 04:26:05] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-24 04:26:05] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2026-05-24 04:26:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/13 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 92ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 92ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/167 places, 11/195 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 6/167 places, 11/195 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 30 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-01
Stuttering criterion allowed to conclude after 29 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-01 finished in 214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 195/195 transitions.
Graph (complete) has 328 edges and 167 vertex of which 164 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 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 163 transition count 165
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 137 transition count 165
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 53 place count 137 transition count 139
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 105 place count 111 transition count 139
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 111 place count 105 transition count 131
Iterating global reduction 2 with 6 rules applied. Total rules applied 117 place count 105 transition count 131
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 101 transition count 127
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 101 transition count 127
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 99 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 99 transition count 123
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 97 transition count 121
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 97 transition count 121
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 207 place count 60 transition count 84
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 214 place count 53 transition count 71
Iterating global reduction 2 with 7 rules applied. Total rules applied 221 place count 53 transition count 71
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 228 place count 46 transition count 63
Iterating global reduction 2 with 7 rules applied. Total rules applied 235 place count 46 transition count 63
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 242 place count 39 transition count 49
Iterating global reduction 2 with 7 rules applied. Total rules applied 249 place count 39 transition count 49
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 255 place count 33 transition count 43
Iterating global reduction 2 with 6 rules applied. Total rules applied 261 place count 33 transition count 43
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 266 place count 28 transition count 33
Iterating global reduction 2 with 5 rules applied. Total rules applied 271 place count 28 transition count 33
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 276 place count 23 transition count 28
Iterating global reduction 2 with 5 rules applied. Total rules applied 281 place count 23 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 282 place count 23 transition count 27
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 283 place count 23 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 285 place count 21 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 22 edges and 19 vertex of which 16 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 290 place count 16 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 292 place count 14 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 292 place count 14 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 294 place count 13 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 296 place count 12 transition count 18
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 4 with 2 rules applied. Total rules applied 298 place count 11 transition count 18
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 300 place count 11 transition count 16
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 303 place count 8 transition count 13
Applied a total of 303 rules in 29 ms. Remains 8 /167 variables (removed 159) and now considering 13/195 (removed 182) transitions.
[2026-05-24 04:26:05] [INFO ] Flow matrix only has 10 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-13288537559106012364.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9538160297720523119.kers'
[2026-05-24 04:26:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13288537559106012364.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9538160297720523119.kers]
Normalized transition count is 9 out of 10 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 8 cols 16 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-24 04:26:05] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9538160297720523119.kers
Total runtime 0 ms.
[2026-05-24 04:26:05] [INFO ] Implicit Places using invariants in 13 ms returned []
[2026-05-24 04:26:05] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2026-05-24 04:26:05] [INFO ] Invariant cache hit.
[2026-05-24 04:26:05] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2026-05-24 04:26:05] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-24 04:26:05] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2026-05-24 04:26:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/17 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 4/17 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 96ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/167 places, 13/195 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 8/167 places, 13/195 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-02 finished in 258 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||X(F(p1)))) U ((p2 U p3)||G(p4))))'
Support contains 6 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 195/195 transitions.
Graph (complete) has 328 edges and 167 vertex of which 165 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 164 transition count 167
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 139 transition count 167
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 51 place count 139 transition count 143
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 99 place count 115 transition count 143
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 104 place count 110 transition count 136
Iterating global reduction 2 with 5 rules applied. Total rules applied 109 place count 110 transition count 136
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 113 place count 106 transition count 132
Iterating global reduction 2 with 4 rules applied. Total rules applied 117 place count 106 transition count 132
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 104 transition count 128
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 104 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 102 transition count 126
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 102 transition count 126
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 201 place count 64 transition count 88
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 207 place count 58 transition count 76
Iterating global reduction 2 with 6 rules applied. Total rules applied 213 place count 58 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 217 place count 54 transition count 72
Iterating global reduction 2 with 4 rules applied. Total rules applied 221 place count 54 transition count 72
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 225 place count 50 transition count 64
Iterating global reduction 2 with 4 rules applied. Total rules applied 229 place count 50 transition count 64
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 232 place count 47 transition count 61
Iterating global reduction 2 with 3 rules applied. Total rules applied 235 place count 47 transition count 61
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 238 place count 44 transition count 55
Iterating global reduction 2 with 3 rules applied. Total rules applied 241 place count 44 transition count 55
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 244 place count 41 transition count 52
Iterating global reduction 2 with 3 rules applied. Total rules applied 247 place count 41 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 249 place count 39 transition count 50
Applied a total of 249 rules in 33 ms. Remains 39 /167 variables (removed 128) and now considering 50/195 (removed 145) transitions.
[2026-05-24 04:26:06] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-664059403542983960.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11720240378386019509.kers'
[2026-05-24 04:26:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-664059403542983960.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11720240378386019509.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 44 rows 37 cols 116 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-24 04:26:06] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11720240378386019509.kers
Total runtime 1 ms.
[2026-05-24 04:26:06] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-24 04:26:06] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
[2026-05-24 04:26:06] [INFO ] Invariant cache hit.
[2026-05-24 04:26:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 04:26:06] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2026-05-24 04:26:06] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2026-05-24 04:26:06] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
[2026-05-24 04:26:06] [INFO ] Invariant cache hit.
[2026-05-24 04:26:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 44/83 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/83 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 42 constraints, problems are : Problem set: 0 solved, 48 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 44/83 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 48/90 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/83 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 90 constraints, problems are : Problem set: 0 solved, 48 unsolved in 951 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1561ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1561ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/167 places, 50/195 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1670 ms. Remains : 39/167 places, 50/195 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||X(F(p1)))) U ((p2 U p3)||G(p4))))'
Stuttering acceptance computed with spot in 398 ms :[(AND (NOT p3) (NOT p4)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p4) p0), (AND (NOT p1) (NOT p0) (NOT p4)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3) p4), (AND p0 (NOT p1) (NOT p3) (NOT p4))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-03
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-03 finished in 2130 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)&&F(p1)))||X((!p0 U (X(p2)||G(!p0))))))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 195/195 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 156 transition count 182
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 156 transition count 182
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 151 transition count 177
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 151 transition count 177
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 147 transition count 173
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 147 transition count 173
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 144 transition count 169
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 144 transition count 169
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 141 transition count 164
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 141 transition count 164
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 138 transition count 161
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 138 transition count 161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 136 transition count 159
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 136 transition count 159
Applied a total of 62 rules in 23 ms. Remains 136 /167 variables (removed 31) and now considering 159/195 (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-14114805119402244375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9250722440806151763.kers'
[2026-05-24 04:26:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14114805119402244375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9250722440806151763.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 159 rows 136 cols 428 entries
Finished phase 1 with 134 SingleSign rule and 0 generalized
[2026-05-24 04:26:08] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9250722440806151763.kers
Total runtime 2 ms.
[2026-05-24 04:26:08] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-24 04:26:08] [INFO ] Invariant cache hit.
[2026-05-24 04:26:08] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2026-05-24 04:26:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 159/295 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 8/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 146 constraints, problems are : Problem set: 0 solved, 158 unsolved in 6740 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 159/295 variables, 136/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 158/304 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 304 constraints, problems are : Problem set: 0 solved, 158 unsolved in 9252 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16021ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 16023ms
Starting structural reductions in LTL mode, iteration 1 : 136/167 places, 159/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16196 ms. Remains : 136/167 places, 159/195 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)&&F(p1)))||X((!p0 U (X(p2)||G(!p0))))))'
Stuttering acceptance computed with spot in 422 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 104 ms.
Product exploration explored 100000 steps with 33333 reset in 86 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 273 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Detected a total of 26/136 stabilizing places and 26/159 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 12 factoid took 22 ms. Proved property starting from automaton with 10 states, 21 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 25 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-04 finished in 16876 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&&(G(p1)||F(p2))))))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 195/195 transitions.
Graph (complete) has 328 edges and 167 vertex of which 164 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 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 163 transition count 166
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 138 transition count 166
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 51 place count 138 transition count 141
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 101 place count 113 transition count 141
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 106 place count 108 transition count 135
Iterating global reduction 2 with 5 rules applied. Total rules applied 111 place count 108 transition count 135
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 114 place count 105 transition count 132
Iterating global reduction 2 with 3 rules applied. Total rules applied 117 place count 105 transition count 132
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 103 transition count 128
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 103 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 101 transition count 126
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 101 transition count 126
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 201 place count 63 transition count 88
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 207 place count 57 transition count 77
Iterating global reduction 2 with 6 rules applied. Total rules applied 213 place count 57 transition count 77
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 218 place count 52 transition count 71
Iterating global reduction 2 with 5 rules applied. Total rules applied 223 place count 52 transition count 71
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 227 place count 48 transition count 63
Iterating global reduction 2 with 4 rules applied. Total rules applied 231 place count 48 transition count 63
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 235 place count 44 transition count 59
Iterating global reduction 2 with 4 rules applied. Total rules applied 239 place count 44 transition count 59
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 243 place count 40 transition count 51
Iterating global reduction 2 with 4 rules applied. Total rules applied 247 place count 40 transition count 51
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 251 place count 36 transition count 47
Iterating global reduction 2 with 4 rules applied. Total rules applied 255 place count 36 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 256 place count 35 transition count 45
Iterating global reduction 2 with 1 rules applied. Total rules applied 257 place count 35 transition count 45
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 258 place count 34 transition count 44
Iterating global reduction 2 with 1 rules applied. Total rules applied 259 place count 34 transition count 44
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 260 place count 34 transition count 43
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 261 place count 34 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 263 place count 32 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 31 transition count 41
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 264 place count 31 transition count 37
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 272 place count 27 transition count 37
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 276 place count 25 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 277 place count 25 transition count 34
Applied a total of 277 rules in 27 ms. Remains 25 /167 variables (removed 142) and now considering 34/195 (removed 161) transitions.
[2026-05-24 04:26:25] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16836977935145536387.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17405417304137841560.kers'
[2026-05-24 04:26:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16836977935145536387.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17405417304137841560.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 24 cols 73 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-05-24 04:26:25] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17405417304137841560.kers
Total runtime 0 ms.
[2026-05-24 04:26:25] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-24 04:26:25] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
[2026-05-24 04:26:25] [INFO ] Invariant cache hit.
[2026-05-24 04:26:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 04:26:25] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2026-05-24 04:26:25] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2026-05-24 04:26:25] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
[2026-05-24 04:26:25] [INFO ] Invariant cache hit.
[2026-05-24 04:26:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 29/54 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 0/54 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 27 constraints, problems are : Problem set: 0 solved, 33 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 29/54 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 33/60 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 60 constraints, problems are : Problem set: 0 solved, 33 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 808ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 808ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/167 places, 34/195 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 895 ms. Remains : 25/167 places, 34/195 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&&(G(p1)||F(p2))))))'
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-06
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-06 finished in 1060 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)||X((p1||X(F(p2))))))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 195/195 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 158 transition count 184
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 158 transition count 184
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 154 transition count 180
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 154 transition count 180
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 150 transition count 176
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 150 transition count 176
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 148 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 148 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 146 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 146 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 145 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 145 transition count 169
Applied a total of 44 rules in 19 ms. Remains 145 /167 variables (removed 22) and now considering 169/195 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-671786582766338726.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7518350275434315164.kers'
[2026-05-24 04:26:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-671786582766338726.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7518350275434315164.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 169 rows 145 cols 455 entries
Finished phase 1 with 143 SingleSign rule and 0 generalized
[2026-05-24 04:26:26] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7518350275434315164.kers
Total runtime 2 ms.
[2026-05-24 04:26:26] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-24 04:26:26] [INFO ] Invariant cache hit.
[2026-05-24 04:26:26] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2026-05-24 04:26:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 169/314 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 8/155 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/314 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 155 constraints, problems are : Problem set: 0 solved, 168 unsolved in 7575 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/314 variables, 145/155 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 168/323 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 0/314 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 323 constraints, problems are : Problem set: 0 solved, 168 unsolved in 9766 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17361ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 17361ms
Starting structural reductions in LTL mode, iteration 1 : 145/167 places, 169/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17522 ms. Remains : 145/167 places, 169/195 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)||X((p1||X(F(p2))))))'
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 75 ms.
Product exploration explored 100000 steps with 33333 reset in 77 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 289 edges and 145 vertex of which 143 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 17 ms. Proved property starting from automaton with 5 states, 8 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-07 finished in 17913 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((((!p1||X(p2)) U (G((!p1||X(p2)))||((!p1||X(p2))&&(!p3||(!p1 U (p4||G(!p1)))))))||p0)))'
Support contains 5 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 195/195 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 157 transition count 183
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 157 transition count 183
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 153 transition count 179
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 153 transition count 179
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 149 transition count 175
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 149 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 147 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 147 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 145 transition count 169
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 145 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 144 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 144 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 143 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 143 transition count 167
Applied a total of 48 rules in 14 ms. Remains 143 /167 variables (removed 24) and now considering 167/195 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3691785350948685152.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7636857489758300521.kers'
[2026-05-24 04:26:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3691785350948685152.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7636857489758300521.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 167 rows 143 cols 452 entries
Finished phase 1 with 141 SingleSign rule and 0 generalized
[2026-05-24 04:26:44] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7636857489758300521.kers
Total runtime 2 ms.
[2026-05-24 04:26:44] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-24 04:26:44] [INFO ] Invariant cache hit.
[2026-05-24 04:26:44] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2026-05-24 04:26:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 167/310 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 8/153 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/310 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 153 constraints, problems are : Problem set: 0 solved, 166 unsolved in 7928 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 167/310 variables, 143/153 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 166/319 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 0/310 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 319 constraints, problems are : Problem set: 0 solved, 166 unsolved in 10137 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18081ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 18081ms
Starting structural reductions in LTL mode, iteration 1 : 143/167 places, 167/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18237 ms. Remains : 143/167 places, 167/195 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((((!p1||X(p2)) U (G((!p1||X(p2)))||((!p1||X(p2))&&(!p3||(!p1 U (p4||G(!p1)))))))||p0)))'
Stuttering acceptance computed with spot in 245 ms :[true, (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2) (NOT p4)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 87 ms.
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 287 edges and 143 vertex of which 142 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 18 factoid took 19 ms. Proved property starting from automaton with 6 states, 13 edges and 5 AP (stutter sensitive
Knowledge-based reduction took 22 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-09 finished in 18717 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 p1) U !X(X(X(p0))))))'
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 195/195 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 158 transition count 184
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 158 transition count 184
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 153 transition count 179
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 153 transition count 179
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 148 transition count 174
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 148 transition count 174
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 146 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 146 transition count 171
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 144 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 144 transition count 168
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 142 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 142 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 141 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 141 transition count 165
Applied a total of 52 rules in 10 ms. Remains 141 /167 variables (removed 26) and now considering 165/195 (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-15296842681138176609.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5647393321474368425.kers'
[2026-05-24 04:27:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15296842681138176609.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5647393321474368425.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 165 rows 141 cols 444 entries
Finished phase 1 with 139 SingleSign rule and 0 generalized
[2026-05-24 04:27:02] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5647393321474368425.kers
Total runtime 3 ms.
[2026-05-24 04:27:02] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-24 04:27:02] [INFO ] Invariant cache hit.
[2026-05-24 04:27:03] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2026-05-24 04:27:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 165/306 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 8/151 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/306 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 151 constraints, problems are : Problem set: 0 solved, 164 unsolved in 7286 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/306 variables, 141/151 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 164/315 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 315 constraints, problems are : Problem set: 0 solved, 164 unsolved in 8908 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16211ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 16211ms
Starting structural reductions in LTL mode, iteration 1 : 141/167 places, 165/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16382 ms. Remains : 141/167 places, 165/195 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 p1) U !X(X(X(p0))))))'
Stuttering acceptance computed with spot in 659 ms :[p0, p0, p0, (AND p1 p0), p0, p0, true, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), (AND p1 (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-10
Product exploration explored 100000 steps with 20018 reset in 78 ms.
Product exploration explored 100000 steps with 19962 reset in 80 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 283 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 27 stabilizing places and 27 stable transitions
Detected a total of 27/141 stabilizing places and 27/165 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 8 factoid took 104 ms. Reduced automaton from 18 states, 33 edges and 2 AP (stutter sensitive) to 18 states, 33 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (151 resets) in 117 ms. (338 steps per ms) remains 1/5 properties
BEST_FIRST walk for 16630 steps (8 resets) in 26 ms. (615 steps per ms) remains 0/1 properties
Knowledge based reduction with 8 factoid took 146 ms. Reduced automaton from 18 states, 33 edges and 2 AP (stutter sensitive) to 18 states, 33 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 611 ms :[p0, p0, p0, (AND p1 p0), p0, p0, true, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), (AND p1 (NOT p0))]
Knowledge-based reduction took 916 ms.
Stuttering acceptance computed with spot in 626 ms :[p0, p0, p0, (AND p1 p0), p0, p0, true, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), (AND p1 (NOT p0))]
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 165/165 transitions.
Applied a total of 0 rules in 2 ms. Remains 141 /141 variables (removed 0) and now considering 165/165 (removed 0) transitions.
[2026-05-24 04:27:21] [INFO ] Invariant cache hit.
[2026-05-24 04:27:21] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 04:27:21] [INFO ] Invariant cache hit.
[2026-05-24 04:27:21] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 141/141 places, 165/165 transitions.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 283 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 27 stabilizing places and 27 stable transitions
Detected a total of 27/141 stabilizing places and 27/165 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 8 factoid took 87 ms. Reduced automaton from 18 states, 33 edges and 2 AP (stutter sensitive) to 18 states, 33 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (152 resets) in 147 ms. (270 steps per ms) remains 1/5 properties
BEST_FIRST walk for 19886 steps (12 resets) in 20 ms. (946 steps per ms) remains 0/1 properties
Knowledge based reduction with 8 factoid took 141 ms. Reduced automaton from 18 states, 33 edges and 2 AP (stutter sensitive) to 18 states, 33 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 668 ms :[p0, p0, p0, (AND p1 p0), p0, p0, true, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), (AND p1 (NOT p0))]
Knowledge-based reduction took 952 ms.
Stuttering acceptance computed with spot in 650 ms :[p0, p0, p0, (AND p1 p0), p0, p0, true, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 630 ms :[p0, p0, p0, (AND p1 p0), p0, p0, true, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 20002 reset in 88 ms.
Product exploration explored 100000 steps with 19968 reset in 100 ms.
Spot run failed in 74 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/ltsmin14322485846990165173
[2026-05-24 04:27:24] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14322485846990165173
Running compilation step : cd /tmp/ltsmin14322485846990165173;'/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 363 ms.
Running link step : cd /tmp/ltsmin14322485846990165173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin14322485846990165173;'/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/stateBased407834013981167312.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 165/165 transitions.
Applied a total of 0 rules in 1 ms. Remains 141 /141 variables (removed 0) and now considering 165/165 (removed 0) transitions.
[2026-05-24 04:27:39] [INFO ] Invariant cache hit.
[2026-05-24 04:27:39] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-24 04:27:39] [INFO ] Invariant cache hit.
[2026-05-24 04:27:39] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 141/141 places, 165/165 transitions.
Built C files in :
/tmp/ltsmin8741120581265082717
[2026-05-24 04:27:39] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8741120581265082717
Running compilation step : cd /tmp/ltsmin8741120581265082717;'/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 251 ms.
Running link step : cd /tmp/ltsmin8741120581265082717;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8741120581265082717;'/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/stateBased8591055855361151758.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 04:27:54] [INFO ] Flatten gal took : 14 ms
[2026-05-24 04:27:54] [INFO ] Flatten gal took : 10 ms
[2026-05-24 04:27:54] [INFO ] Time to serialize gal into /tmp/LTL2741152057439843613.gal : 3 ms
[2026-05-24 04:27:54] [INFO ] Time to serialize properties into /tmp/LTL8875084768948637030.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2741152057439843613.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14330622960657694595.hoa' '-atoms' '/tmp/LTL8875084768948637030.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8875084768948637030.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14330622960657694595.hoa
Detected timeout of ITS tools.
[2026-05-24 04:28:09] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:28:09] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:28:09] [INFO ] Time to serialize gal into /tmp/LTL13916752278661477671.gal : 1 ms
[2026-05-24 04:28:09] [INFO ] Time to serialize properties into /tmp/LTL1829386950642226283.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13916752278661477671.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1829386950642226283.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((!(("(p69==1)")U("(p168==1)")))U(!(X(X(X("(p69==1)"))))))))
Formula 0 simplified : F(("(p69==1)" U "(p168==1)") R XXX"(p69==1)")
Detected timeout of ITS tools.
[2026-05-24 04:28:24] [INFO ] Flatten gal took : 11 ms
[2026-05-24 04:28:24] [INFO ] Applying decomposition
[2026-05-24 04:28:24] [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/graph13689753110337511626.txt' '-o' '/tmp/graph13689753110337511626.bin' '-w' '/tmp/graph13689753110337511626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13689753110337511626.bin' '-l' '-1' '-v' '-w' '/tmp/graph13689753110337511626.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:28:24] [INFO ] Decomposing Gal with order
[2026-05-24 04:28:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:28:24] [INFO ] Removed a total of 62 redundant transitions.
[2026-05-24 04:28:24] [INFO ] Flatten gal took : 80 ms
[2026-05-24 04:28:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2026-05-24 04:28:24] [INFO ] Time to serialize gal into /tmp/LTL5579526451363667635.gal : 4 ms
[2026-05-24 04:28:24] [INFO ] Time to serialize properties into /tmp/LTL16226839805003016604.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/LTL5579526451363667635.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16226839805003016604.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((!(("(i2.u4.p69==1)")U("(i12.u36.p168==1)")))U(!(X(X(X("(i2.u4.p69==1)"))))))))
Formula 0 simplified : F(("(i2.u4.p69==1)" U "(i12.u36.p168==1)") R XXX"(i2.u4.p69==1)")
Detected timeout of ITS tools.
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-10 finished in 97152 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)&&F(p1)&&X(G(((X(p4)||p3)&&p2)))))'
Support contains 6 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 195/195 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 156 transition count 182
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 156 transition count 182
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 151 transition count 177
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 151 transition count 177
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 147 transition count 173
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 147 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 145 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 145 transition count 171
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 143 transition count 167
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 143 transition count 167
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 141 transition count 165
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 141 transition count 165
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 139 transition count 163
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 139 transition count 163
Applied a total of 56 rules in 11 ms. Remains 139 /167 variables (removed 28) and now considering 163/195 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11174560583511833086.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17050584134766710911.kers'
[2026-05-24 04:28:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11174560583511833086.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17050584134766710911.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 163 rows 139 cols 440 entries
Finished phase 1 with 137 SingleSign rule and 0 generalized
[2026-05-24 04:28:40] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17050584134766710911.kers
Total runtime 1 ms.
[2026-05-24 04:28:40] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 04:28:40] [INFO ] Invariant cache hit.
[2026-05-24 04:28:40] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2026-05-24 04:28:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 163/302 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 8/149 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/302 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 149 constraints, problems are : Problem set: 0 solved, 162 unsolved in 7207 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/302 variables, 139/149 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 162/311 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 311 constraints, problems are : Problem set: 0 solved, 162 unsolved in 9357 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16592ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 16592ms
Starting structural reductions in LTL mode, iteration 1 : 139/167 places, 163/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16740 ms. Remains : 139/167 places, 163/195 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)&&F(p1)&&X(G(((X(p4)||p3)&&p2)))))'
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p0), (NOT p1), (OR (NOT p2) (AND (NOT p3) (NOT p4))), true, (AND p2 (NOT p4))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 215 steps with 3 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-11 finished in 16987 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 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 195/195 transitions.
Graph (complete) has 328 edges and 167 vertex of which 164 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 163 transition count 165
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 137 transition count 165
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 53 place count 137 transition count 140
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 103 place count 112 transition count 140
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 109 place count 106 transition count 132
Iterating global reduction 2 with 6 rules applied. Total rules applied 115 place count 106 transition count 132
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 119 place count 102 transition count 128
Iterating global reduction 2 with 4 rules applied. Total rules applied 123 place count 102 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 125 place count 100 transition count 124
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 100 transition count 124
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 98 transition count 122
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 98 transition count 122
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 209 place count 59 transition count 83
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 216 place count 52 transition count 70
Iterating global reduction 2 with 7 rules applied. Total rules applied 223 place count 52 transition count 70
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 230 place count 45 transition count 62
Iterating global reduction 2 with 7 rules applied. Total rules applied 237 place count 45 transition count 62
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 244 place count 38 transition count 48
Iterating global reduction 2 with 7 rules applied. Total rules applied 251 place count 38 transition count 48
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 257 place count 32 transition count 42
Iterating global reduction 2 with 6 rules applied. Total rules applied 263 place count 32 transition count 42
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 269 place count 26 transition count 30
Iterating global reduction 2 with 6 rules applied. Total rules applied 275 place count 26 transition count 30
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 281 place count 20 transition count 24
Iterating global reduction 2 with 6 rules applied. Total rules applied 287 place count 20 transition count 24
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 288 place count 19 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 289 place count 19 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 290 place count 18 transition count 21
Iterating global reduction 2 with 1 rules applied. Total rules applied 291 place count 18 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 293 place count 16 transition count 19
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 25 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 3 rules applied. Total rules applied 296 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 297 place count 13 transition count 17
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 4 with 2 rules applied. Total rules applied 299 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 301 place count 10 transition count 15
Applied a total of 301 rules in 23 ms. Remains 10 /167 variables (removed 157) and now considering 15/195 (removed 180) transitions.
[2026-05-24 04:28:57] [INFO ] Flow matrix only has 13 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-847349557641123620.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1280311192537474905.kers'
[2026-05-24 04:28:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-847349557641123620.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1280311192537474905.kers]
Normalized transition count is 12 out of 13 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 12 rows 9 cols 26 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-24 04:28:57] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1280311192537474905.kers
Total runtime 0 ms.
[2026-05-24 04:28:57] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-24 04:28:57] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2026-05-24 04:28:57] [INFO ] Invariant cache hit.
[2026-05-24 04:28:57] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2026-05-24 04:28:57] [INFO ] Redundant transitions in 1 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-24 04:28:57] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2026-05-24 04:28:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/22 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/23 variables, and 11 constraints, problems are : Problem set: 0 solved, 10 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/22 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/23 variables, and 21 constraints, problems are : Problem set: 0 solved, 10 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 209ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 209ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/167 places, 15/195 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 299 ms. Remains : 10/167 places, 15/195 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 52 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-13 finished in 376 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&&X(!p1)))) U (p1 U G(p2)))))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 195/195 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 157 transition count 184
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 157 transition count 184
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 153 transition count 180
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 153 transition count 180
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 149 transition count 176
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 149 transition count 176
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 146 transition count 172
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 146 transition count 172
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 143 transition count 167
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 143 transition count 167
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 140 transition count 164
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 140 transition count 164
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 138 transition count 162
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 138 transition count 162
Applied a total of 58 rules in 19 ms. Remains 138 /167 variables (removed 29) and now considering 162/195 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11258396184560794961.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11949524283740764278.kers'
[2026-05-24 04:28:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11258396184560794961.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11949524283740764278.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 138 cols 436 entries
Finished phase 1 with 136 SingleSign rule and 0 generalized
[2026-05-24 04:28:57] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11949524283740764278.kers
Total runtime 1 ms.
[2026-05-24 04:28:57] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-24 04:28:57] [INFO ] Invariant cache hit.
[2026-05-24 04:28:57] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2026-05-24 04:28:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 162/300 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 8/148 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/300 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 148 constraints, problems are : Problem set: 0 solved, 161 unsolved in 6873 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/300 variables, 138/148 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 161/309 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/300 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 309 constraints, problems are : Problem set: 0 solved, 161 unsolved in 7887 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14772ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 14773ms
Starting structural reductions in LTL mode, iteration 1 : 138/167 places, 162/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15017 ms. Remains : 138/167 places, 162/195 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&&X(!p1)))) U (p1 U G(p2)))))'
Stuttering acceptance computed with spot in 556 ms :[(NOT p2), (NOT p2), (OR (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (NOT p0) p1), true, p1, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (NOT p2), (AND (NOT p2) p1 p0), (AND (NOT p2) p1)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-14
Product exploration explored 100000 steps with 16635 reset in 82 ms.
Product exploration explored 100000 steps with 16688 reset in 133 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 278 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 14 states, 35 edges and 3 AP (stutter sensitive) to 14 states, 35 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (148 resets) in 280 ms. (142 steps per ms) remains 2/17 properties
BEST_FIRST walk for 40002 steps (22 resets) in 80 ms. (493 steps per ms) remains 1/2 properties
[2026-05-24 04:29:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/73 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 190/263 variables, 96/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf6 is UNSAT
After SMT solving in domain Real declared 295/300 variables, and 136 constraints, problems are : Problem set: 1 solved, 0 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 133/138 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 133ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 235 ms. Reduced automaton from 14 states, 35 edges and 3 AP (stutter sensitive) to 14 states, 34 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 549 ms :[(NOT p2), (NOT p2), (OR (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (NOT p0) p1), true, p1, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1)]
[2026-05-24 04:29:14] [INFO ] Invariant cache hit.
[2026-05-24 04:29:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-24 04:29:14] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2026-05-24 04:29:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:29:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-24 04:29:14] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2026-05-24 04:29:14] [INFO ] Computed and/alt/rep : 158/244/158 causal constraints (skipped 3 transitions) in 8 ms.
[2026-05-24 04:29:15] [INFO ] Added : 155 causal constraints over 32 iterations in 1195 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 2549 ms.
Stuttering acceptance computed with spot in 531 ms :[(NOT p2), (NOT p2), (OR (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (NOT p0) p1), true, p1, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2026-05-24 04:29:16] [INFO ] Invariant cache hit.
[2026-05-24 04:29:16] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-24 04:29:16] [INFO ] Invariant cache hit.
[2026-05-24 04:29:16] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 138/138 places, 162/162 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 278 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge based reduction with 9 factoid took 84 ms. Reduced automaton from 14 states, 34 edges and 3 AP (stutter sensitive) to 14 states, 34 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (152 resets) in 123 ms. (322 steps per ms) remains 0/14 properties
Knowledge based reduction with 9 factoid took 256 ms. Reduced automaton from 14 states, 34 edges and 3 AP (stutter sensitive) to 14 states, 34 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 568 ms :[(NOT p2), (NOT p2), (OR (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (NOT p0) p1), true, p1, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1)]
[2026-05-24 04:29:17] [INFO ] Invariant cache hit.
[2026-05-24 04:29:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-24 04:29:17] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2026-05-24 04:29:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:29:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-24 04:29:17] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2026-05-24 04:29:17] [INFO ] Computed and/alt/rep : 158/244/158 causal constraints (skipped 3 transitions) in 7 ms.
[2026-05-24 04:29:18] [INFO ] Added : 155 causal constraints over 32 iterations in 1191 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 2384 ms.
Stuttering acceptance computed with spot in 563 ms :[(NOT p2), (NOT p2), (OR (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (NOT p0) p1), true, p1, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 568 ms :[(NOT p2), (NOT p2), (OR (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (NOT p0) p1), true, p1, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Product exploration explored 100000 steps with 16655 reset in 87 ms.
Product exploration explored 100000 steps with 16687 reset in 85 ms.
Spot run failed in 48 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/ltsmin12931875118188710769
[2026-05-24 04:29:20] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12931875118188710769
Running compilation step : cd /tmp/ltsmin12931875118188710769;'/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 254 ms.
Running link step : cd /tmp/ltsmin12931875118188710769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12931875118188710769;'/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/stateBased13996677021504055725.hoa' '--buchi-type=spotba'
LTSmin run took 38 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-14 finished in 23194 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 p1) U !X(X(X(p0))))))'
Spot run failed in 44 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:29:20] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1083227391747597548
[2026-05-24 04:29:20] [INFO ] Computing symmetric may disable matrix : 195 transitions.
[2026-05-24 04:29:20] [INFO ] Applying decomposition
[2026-05-24 04:29:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 04:29:20] [INFO ] Computing symmetric may enable matrix : 195 transitions.
[2026-05-24 04:29:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 04:29:20] [INFO ] Flatten gal took : 9 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/graph5935699100031717050.txt' '-o' '/tmp/graph5935699100031717050.bin' '-w' '/tmp/graph5935699100031717050.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5935699100031717050.bin' '-l' '-1' '-v' '-w' '/tmp/graph5935699100031717050.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:29:20] [INFO ] Computing Do-Not-Accords matrix : 195 transitions.
[2026-05-24 04:29:20] [INFO ] Decomposing Gal with order
[2026-05-24 04:29:20] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 04:29:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:29:20] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1083227391747597548
Running compilation step : cd /tmp/ltsmin1083227391747597548;'/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:29:20] [INFO ] Removed a total of 67 redundant transitions.
[2026-05-24 04:29:20] [INFO ] Flatten gal took : 12 ms
[2026-05-24 04:29:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 2 ms.
[2026-05-24 04:29:20] [INFO ] Time to serialize gal into /tmp/LTLFireability8784246888315389930.gal : 3 ms
[2026-05-24 04:29:20] [INFO ] Time to serialize properties into /tmp/LTLFireability202787227610915424.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/LTLFireability8784246888315389930.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability202787227610915424.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...275
Read 1 LTL properties
Checking formula 0 : !((G((!(("(i9.u20.p69==1)")U("(i14.u42.p168==1)")))U(!(X(X(X("(i9.u20.p69==1)"))))))))
Formula 0 simplified : F(("(i9.u20.p69==1)" U "(i14.u42.p168==1)") R XXX"(i9.u20.p69==1)")
Compilation finished in 381 ms.
Running link step : cd /tmp/ltsmin1083227391747597548;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1083227391747597548;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((!((LTLAPp0==true) U (LTLAPp1==true)) U !X(X(X((LTLAPp0==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-24 04:50:41] [INFO ] Applying decomposition
[2026-05-24 04:50:41] [INFO ] Flatten gal took : 154 ms
[2026-05-24 04:50:41] [INFO ] Decomposing Gal with order
[2026-05-24 04:50:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:50:41] [INFO ] Removed a total of 69 redundant transitions.
[2026-05-24 04:50:41] [INFO ] Flatten gal took : 82 ms
[2026-05-24 04:50:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 341 labels/synchronizations in 125 ms.
[2026-05-24 04:50:42] [INFO ] Time to serialize gal into /tmp/LTLFireability10551334587545651578.gal : 30 ms
[2026-05-24 04:50:42] [INFO ] Time to serialize properties into /tmp/LTLFireability12912794469249786617.ltl : 11 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/LTLFireability10551334587545651578.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12912794469249786617.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G((!(("(i0.i0.i0.i0.i0.i0.u10.p69==1)")U("(i0.i0.i0.u13.p168==1)")))U(!(X(X(X("(i0.i0.i0.i0.i0.i0.u10.p69==1)"))))))))
Formula 0 simplified : F(("(i0.i0.i0.i0.i0.i0.u10.p69==1)" U "(i0.i0.i0.u13.p168==1)") R XXX"(i0.i0.i0.i0.i0.i0.u10.p69==1)")
Reverse transition relation is NOT exact ! Due to transitions t188, t189, i0.t18, i0.t12, i0.u15.t19, i0.u15.t21, i0.i0.t27, i0.i0.t30, i0.i0.u14.t31, i0.i...1033
Computing Next relation with stutter on 1 deadlock states
32 unique states visited
32 strongly connected components in search stack
33 transitions explored
32 items max in DFS search stack
6853 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,68.5714,1098080,1,0,1.51109e+06,1.01861e+06,3268,4.33766e+06,1449,4.68974e+06,829015
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1596537 ms.

BK_STOP 1779598319866

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

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