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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.0K Mar 6 16:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 6 16:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 6 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 16:26 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:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 6 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 6 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 6 16:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:10 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 46K 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-06b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779594618038

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 03:50:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 03:50:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 03:50:19] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2026-05-24 03:50:19] [INFO ] Transformed 184 places.
[2026-05-24 03:50:19] [INFO ] Transformed 194 transitions.
[2026-05-24 03:50:19] [INFO ] Found NUPN structural information;
[2026-05-24 03:50:19] [INFO ] Parsed PT model containing 184 places and 194 transitions and 503 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 173 transition count 194
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 36 place count 148 transition count 169
Iterating global reduction 1 with 25 rules applied. Total rules applied 61 place count 148 transition count 169
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 142 transition count 163
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 142 transition count 163
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 78 place count 137 transition count 158
Iterating global reduction 1 with 5 rules applied. Total rules applied 83 place count 137 transition count 158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 136 transition count 157
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 136 transition count 157
Applied a total of 85 rules in 60 ms. Remains 136 /184 variables (removed 48) and now considering 157/194 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8352040413150434267.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9661120877814648735.kers'
[2026-05-24 03:50:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8352040413150434267.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9661120877814648735.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 157 rows 136 cols 416 entries
Finished phase 1 with 134 SingleSign rule and 0 generalized
[2026-05-24 03:50:19] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9661120877814648735.kers
Total runtime 1 ms.
[2026-05-24 03:50:19] [INFO ] Implicit Places using invariants in 215 ms returned []
[2026-05-24 03:50:19] [INFO ] Invariant cache hit.
[2026-05-24 03:50:19] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2026-05-24 03:50:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 157/292 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 7/144 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 1/293 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (OVERLAPS) 0/293 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 146 constraints, problems are : Problem set: 0 solved, 156 unsolved in 10570 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/292 variables, 135/145 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 155/300 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 1/293 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 302 constraints, problems are : Problem set: 0 solved, 156 unsolved in 15810 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26450ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 26468ms
Starting structural reductions in LTL mode, iteration 1 : 136/184 places, 157/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26950 ms. Remains : 136/184 places, 157/194 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 157/157 transitions.
Applied a total of 0 rules in 3 ms. Remains 136 /136 variables (removed 0) and now considering 157/157 (removed 0) transitions.
[2026-05-24 03:50:46] [INFO ] Invariant cache hit.
[2026-05-24 03:50:46] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-24 03:50:46] [INFO ] Invariant cache hit.
[2026-05-24 03:50:46] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 136/136 places, 157/157 transitions.
Support contains 23 out of 136 places after structural reductions.
[2026-05-24 03:50:46] [INFO ] Flatten gal took : 43 ms
[2026-05-24 03:50:46] [INFO ] Flatten gal took : 12 ms
[2026-05-24 03:50:46] [INFO ] Input system was already deterministic with 157 transitions.
RANDOM walk for 6941 steps (34 resets) in 230 ms. (30 steps per ms) remains 0/13 properties
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 263 edges and 136 vertex of which 133 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.15 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1) U !(p1 U X(!X(X(p2))))))'
Support contains 6 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 157/157 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 157
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 128 transition count 150
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 128 transition count 150
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 123 transition count 144
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 123 transition count 144
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 120 transition count 139
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 120 transition count 139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 117 transition count 136
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 117 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 116 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 116 transition count 135
Applied a total of 39 rules in 13 ms. Remains 116 /136 variables (removed 20) and now considering 135/157 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4340638987753958328.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12025723639297941448.kers'
[2026-05-24 03:50:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4340638987753958328.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12025723639297941448.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 135 rows 116 cols 360 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-24 03:50:47] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12025723639297941448.kers
Total runtime 2 ms.
[2026-05-24 03:50:47] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-24 03:50:47] [INFO ] Invariant cache hit.
[2026-05-24 03:50:47] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2026-05-24 03:50:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 135/251 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 0/251 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 124 constraints, problems are : Problem set: 0 solved, 134 unsolved in 4990 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 135/251 variables, 116/124 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 134/258 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 0/251 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 258 constraints, problems are : Problem set: 0 solved, 134 unsolved in 6098 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11118ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 11120ms
Starting structural reductions in LTL mode, iteration 1 : 116/136 places, 135/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11286 ms. Remains : 116/136 places, 135/157 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1) U !(p1 U X(!X(X(p2))))))'
Stuttering acceptance computed with spot in 1010 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-00
Product exploration explored 100000 steps with 20009 reset in 313 ms.
Product exploration explored 100000 steps with 19919 reset in 140 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 229 edges and 116 vertex of which 115 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge based reduction with 7 factoid took 167 ms. Reduced automaton from 20 states, 44 edges and 3 AP (stutter sensitive) to 20 states, 44 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (198 resets) in 554 ms. (72 steps per ms) remains 2/8 properties
BEST_FIRST walk for 25754 steps (6 resets) in 97 ms. (262 steps per ms) remains 0/2 properties
Knowledge based reduction with 7 factoid took 223 ms. Reduced automaton from 20 states, 44 edges and 3 AP (stutter sensitive) to 20 states, 44 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 835 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p1))]
Knowledge-based reduction took 1476 ms.
Stuttering acceptance computed with spot in 867 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p1))]
Support contains 6 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 135/135 transitions.
Applied a total of 0 rules in 3 ms. Remains 116 /116 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2026-05-24 03:51:02] [INFO ] Invariant cache hit.
[2026-05-24 03:51:02] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-24 03:51:02] [INFO ] Invariant cache hit.
[2026-05-24 03:51:02] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 116/116 places, 135/135 transitions.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 229 edges and 116 vertex of which 115 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge based reduction with 7 factoid took 154 ms. Reduced automaton from 20 states, 44 edges and 3 AP (stutter sensitive) to 20 states, 44 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (197 resets) in 183 ms. (217 steps per ms) remains 2/8 properties
BEST_FIRST walk for 12924 steps (9 resets) in 30 ms. (416 steps per ms) remains 0/2 properties
Knowledge based reduction with 7 factoid took 230 ms. Reduced automaton from 20 states, 44 edges and 3 AP (stutter sensitive) to 20 states, 44 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 893 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p1))]
Knowledge-based reduction took 1360 ms.
Stuttering acceptance computed with spot in 924 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 901 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19946 reset in 90 ms.
Product exploration explored 100000 steps with 20038 reset in 104 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/ltsmin14373547172336830805
[2026-05-24 03:51:05] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14373547172336830805
Running compilation step : cd /tmp/ltsmin14373547172336830805;'/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 346 ms.
Running link step : cd /tmp/ltsmin14373547172336830805;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin14373547172336830805;'/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/stateBased6824196436054988554.hoa' '--buchi-type=spotba'
LTSmin run took 3830 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-00 finished in 23110 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 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 157/157 transitions.
Graph (complete) has 263 edges and 136 vertex of which 133 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 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 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 132 transition count 131
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 109 transition count 131
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 47 place count 109 transition count 114
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 81 place count 92 transition count 114
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 87 transition count 109
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 87 transition count 109
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 95 place count 83 transition count 104
Iterating global reduction 2 with 4 rules applied. Total rules applied 99 place count 83 transition count 104
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 102 place count 80 transition count 99
Iterating global reduction 2 with 3 rules applied. Total rules applied 105 place count 80 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 107 place count 78 transition count 97
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 78 transition count 97
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 169 place count 48 transition count 67
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 173 place count 44 transition count 59
Iterating global reduction 2 with 4 rules applied. Total rules applied 177 place count 44 transition count 59
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 181 place count 40 transition count 54
Iterating global reduction 2 with 4 rules applied. Total rules applied 185 place count 40 transition count 54
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 189 place count 36 transition count 47
Iterating global reduction 2 with 4 rules applied. Total rules applied 193 place count 36 transition count 47
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 197 place count 32 transition count 42
Iterating global reduction 2 with 4 rules applied. Total rules applied 201 place count 32 transition count 42
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 205 place count 28 transition count 35
Iterating global reduction 2 with 4 rules applied. Total rules applied 209 place count 28 transition count 35
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 213 place count 24 transition count 30
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 24 transition count 30
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 218 place count 23 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 219 place count 23 transition count 29
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 220 place count 23 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 222 place count 21 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 223 place count 20 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 223 place count 20 transition count 24
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 227 place count 18 transition count 24
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 231 place count 16 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 232 place count 16 transition count 21
Applied a total of 232 rules in 50 ms. Remains 16 /136 variables (removed 120) and now considering 21/157 (removed 136) transitions.
[2026-05-24 03:51:10] [INFO ] Flow matrix only has 18 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-2150533424534115719.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2167469929473538777.kers'
[2026-05-24 03:51:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2150533424534115719.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2167469929473538777.kers]
Normalized transition count is 17 out of 18 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 17 rows 16 cols 39 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-24 03:51:10] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2167469929473538777.kers
Total runtime 1 ms.
[2026-05-24 03:51:10] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-24 03:51:10] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2026-05-24 03:51:10] [INFO ] Invariant cache hit.
[2026-05-24 03:51:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 03:51:10] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2026-05-24 03:51:10] [INFO ] Redundant transitions in 1 ms returned []
Running 19 sub problems to find dead transitions.
[2026-05-24 03:51:10] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2026-05-24 03:51:10] [INFO ] Invariant cache hit.
[2026-05-24 03:51:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 17/31 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 2/33 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 18 constraints, problems are : Problem set: 0 solved, 19 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 17/31 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 19/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 2/33 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/34 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/34 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 37 constraints, problems are : Problem set: 0 solved, 19 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 480ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 480ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/136 places, 21/157 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 636 ms. Remains : 16/136 places, 21/157 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 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-03
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-03 finished in 735 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' '!((!p0 U X(G(p0))))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 157/157 transitions.
Graph (complete) has 263 edges and 136 vertex of which 133 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 132 transition count 132
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 110 transition count 132
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 45 place count 110 transition count 115
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 79 place count 93 transition count 115
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 84 place count 88 transition count 110
Iterating global reduction 2 with 5 rules applied. Total rules applied 89 place count 88 transition count 110
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 93 place count 84 transition count 105
Iterating global reduction 2 with 4 rules applied. Total rules applied 97 place count 84 transition count 105
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 101 place count 80 transition count 98
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 80 transition count 98
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 108 place count 77 transition count 95
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 77 transition count 95
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 169 place count 48 transition count 66
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 173 place count 44 transition count 58
Iterating global reduction 2 with 4 rules applied. Total rules applied 177 place count 44 transition count 58
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 181 place count 40 transition count 53
Iterating global reduction 2 with 4 rules applied. Total rules applied 185 place count 40 transition count 53
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 189 place count 36 transition count 46
Iterating global reduction 2 with 4 rules applied. Total rules applied 193 place count 36 transition count 46
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 197 place count 32 transition count 41
Iterating global reduction 2 with 4 rules applied. Total rules applied 201 place count 32 transition count 41
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 205 place count 28 transition count 34
Iterating global reduction 2 with 4 rules applied. Total rules applied 209 place count 28 transition count 34
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 213 place count 24 transition count 29
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 24 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 218 place count 23 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 219 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 220 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 221 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 223 place count 21 transition count 25
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 225 place count 20 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 226 place count 19 transition count 24
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 226 place count 19 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 232 place count 16 transition count 21
Applied a total of 232 rules in 28 ms. Remains 16 /136 variables (removed 120) and now considering 21/157 (removed 136) transitions.
[2026-05-24 03:51:10] [INFO ] Flow matrix only has 18 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-6916886797759380334.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3482469858280435623.kers'
[2026-05-24 03:51:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6916886797759380334.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3482469858280435623.kers]
Normalized transition count is 17 out of 18 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 17 rows 16 cols 41 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-24 03:51:10] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3482469858280435623.kers
Total runtime 0 ms.
[2026-05-24 03:51:10] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-24 03:51:10] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2026-05-24 03:51:10] [INFO ] Invariant cache hit.
[2026-05-24 03:51:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 03:51:10] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2026-05-24 03:51:10] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/136 places, 21/157 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 16/136 places, 21/157 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' '!((!p0 U X(G(p0))))'
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-04 finished in 196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 157/157 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 157
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 126 transition count 148
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 126 transition count 148
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 120 transition count 140
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 120 transition count 140
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 116 transition count 134
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 116 transition count 134
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 112 transition count 130
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 112 transition count 130
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 110 transition count 128
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 110 transition count 128
Applied a total of 51 rules in 13 ms. Remains 110 /136 variables (removed 26) and now considering 128/157 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10204625634325439414.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7105659530530913079.kers'
[2026-05-24 03:51:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10204625634325439414.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7105659530530913079.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 128 rows 110 cols 344 entries
Finished phase 1 with 108 SingleSign rule and 0 generalized
[2026-05-24 03:51:11] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7105659530530913079.kers
Total runtime 0 ms.
[2026-05-24 03:51:11] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 03:51:11] [INFO ] Invariant cache hit.
[2026-05-24 03:51:11] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2026-05-24 03:51:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 128/238 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 6/118 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 0/238 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 118 constraints, problems are : Problem set: 0 solved, 127 unsolved in 4764 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/238 variables, 110/118 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 127/245 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 0/238 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 245 constraints, problems are : Problem set: 0 solved, 127 unsolved in 6527 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11313ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 11314ms
Starting structural reductions in LTL mode, iteration 1 : 110/136 places, 128/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11460 ms. Remains : 110/136 places, 128/157 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-05 finished in 11608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 157/157 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 127 transition count 148
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 127 transition count 148
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 120 transition count 139
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 120 transition count 139
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 115 transition count 131
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 115 transition count 131
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 110 transition count 126
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 110 transition count 126
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 107 transition count 123
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 107 transition count 123
Applied a total of 58 rules in 12 ms. Remains 107 /136 variables (removed 29) and now considering 123/157 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16836823346267399332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15316032262262388373.kers'
[2026-05-24 03:51:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16836823346267399332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15316032262262388373.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 107 cols 330 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-24 03:51:22] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15316032262262388373.kers
Total runtime 1 ms.
[2026-05-24 03:51:22] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 03:51:22] [INFO ] Invariant cache hit.
[2026-05-24 03:51:22] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2026-05-24 03:51:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 123/229 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 1/230 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/230 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 115 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5313 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/229 variables, 106/114 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 121/235 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 1/230 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/230 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 237 constraints, problems are : Problem set: 0 solved, 122 unsolved in 9106 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14434ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 14436ms
Starting structural reductions in LTL mode, iteration 1 : 107/136 places, 123/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14570 ms. Remains : 107/136 places, 123/157 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-07 finished in 14698 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)&&X((p1&&F(G(!p0))))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 157/157 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 157
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 126 transition count 148
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 126 transition count 148
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 121 transition count 142
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 121 transition count 142
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 118 transition count 137
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 118 transition count 137
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 116 transition count 135
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 116 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 115 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 115 transition count 134
Applied a total of 41 rules in 15 ms. Remains 115 /136 variables (removed 21) and now considering 134/157 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15165403564803091064.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17178181097890133924.kers'
[2026-05-24 03:51:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15165403564803091064.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17178181097890133924.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 115 cols 362 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-24 03:51:37] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17178181097890133924.kers
Total runtime 1 ms.
[2026-05-24 03:51:37] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-24 03:51:37] [INFO ] Invariant cache hit.
[2026-05-24 03:51:37] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2026-05-24 03:51:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/249 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 123 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5059 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 134/249 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 133/256 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 256 constraints, problems are : Problem set: 0 solved, 133 unsolved in 6828 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11901ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 11901ms
Starting structural reductions in LTL mode, iteration 1 : 115/136 places, 134/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12052 ms. Remains : 115/136 places, 134/157 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)&&X((p1&&F(G(!p0))))))'
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (OR (NOT p1) p0), true, p0]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-09
Stuttering criterion allowed to conclude after 200 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-09 finished in 12270 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' '!(((!p0||X(X(p1))) U (G((!p0||X(X(p1))))||((!p0||X(X(p1)))&&X(!p1)))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 157/157 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 157
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 127 transition count 149
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 127 transition count 149
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 121 transition count 141
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 121 transition count 141
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 117 transition count 135
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 117 transition count 135
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 113 transition count 131
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 113 transition count 131
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 111 transition count 129
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 111 transition count 129
Applied a total of 49 rules in 11 ms. Remains 111 /136 variables (removed 25) and now considering 129/157 (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-3264166414279421304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11595907184193362244.kers'
[2026-05-24 03:51:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3264166414279421304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11595907184193362244.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 129 rows 111 cols 346 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-24 03:51:49] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11595907184193362244.kers
Total runtime 1 ms.
[2026-05-24 03:51:49] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 03:51:49] [INFO ] Invariant cache hit.
[2026-05-24 03:51:49] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2026-05-24 03:51:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 129/240 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/240 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 119 constraints, problems are : Problem set: 0 solved, 128 unsolved in 4561 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/240 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 128/247 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/240 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 247 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5786 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10357ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 10357ms
Starting structural reductions in LTL mode, iteration 1 : 111/136 places, 129/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10484 ms. Remains : 111/136 places, 129/157 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' '!(((!p0||X(X(p1))) U (G((!p0||X(X(p1))))||(X(!p1)&&(!p0||X(X(p1)))))))'
Stuttering acceptance computed with spot in 181 ms :[(AND p0 (NOT p1)), (NOT p1), false, (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 60 steps with 15 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-11 finished in 10701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(F(p1))))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 157/157 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 157
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 125 transition count 147
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 125 transition count 147
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 119 transition count 139
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 119 transition count 139
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 114 transition count 131
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 114 transition count 131
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 109 transition count 126
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 109 transition count 126
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 106 transition count 123
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 106 transition count 123
Applied a total of 59 rules in 12 ms. Remains 106 /136 variables (removed 30) and now considering 123/157 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7655080567415226587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8657651352003902239.kers'
[2026-05-24 03:52:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7655080567415226587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8657651352003902239.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 106 cols 330 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-24 03:52:00] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8657651352003902239.kers
Total runtime 2 ms.
[2026-05-24 03:52:00] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 03:52:00] [INFO ] Invariant cache hit.
[2026-05-24 03:52:00] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2026-05-24 03:52:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 123/229 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 7/115 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/229 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 115 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4450 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/229 variables, 106/115 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 122/237 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 237 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5430 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9889ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9890ms
Starting structural reductions in LTL mode, iteration 1 : 106/136 places, 123/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10025 ms. Remains : 106/136 places, 123/157 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0)))||p1)))'
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-12
Product exploration explored 100000 steps with 25000 reset in 88 ms.
Product exploration explored 100000 steps with 25000 reset in 83 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 212 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 2005 steps (9 resets) in 14 ms. (133 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 319 ms.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 123/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2026-05-24 03:52:11] [INFO ] Invariant cache hit.
[2026-05-24 03:52:11] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 03:52:11] [INFO ] Invariant cache hit.
[2026-05-24 03:52:11] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 106/106 places, 123/123 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 212 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge based reduction with 1 factoid took 58 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 1379 steps (5 resets) in 9 ms. (137 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 301 ms.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 96 ms.
Product exploration explored 100000 steps with 25000 reset in 103 ms.
Spot run failed in 52 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin18194429010217848021
[2026-05-24 03:52:12] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18194429010217848021
Running compilation step : cd /tmp/ltsmin18194429010217848021;'/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 214 ms.
Running link step : cd /tmp/ltsmin18194429010217848021;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin18194429010217848021;'/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/stateBased7619261261445768049.hoa' '--buchi-type=spotba'
LTSmin run took 20 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-12 finished in 12244 ms.
All properties solved by simple procedures.
Total runtime 113477 ms.

BK_STOP 1779594732677

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-06b"
export BK_EXAMINATION="LTLCardinality"
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-06b, examination is LTLCardinality"
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-177955695400243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-06b.tgz
mv DiscoveryGPU-PT-06b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;