About the Execution of ITS-Tools for DiscoveryGPU-PT-11b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 519.199 | 191710.00 | 234181.00 | 719.10 | TFTFFFFFFFFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695500323.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-11b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500323
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 9.2K Mar 6 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 6 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 6 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 6 16:49 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.6K Mar 15 09:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 09:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 09:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Mar 6 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 6 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 6 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 6 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:13 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 82K 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-11b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779599714873
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-11b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 05:15:15] [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 05:15:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 05:15:16] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2026-05-24 05:15:16] [INFO ] Transformed 324 places.
[2026-05-24 05:15:16] [INFO ] Transformed 344 transitions.
[2026-05-24 05:15:16] [INFO ] Found NUPN structural information;
[2026-05-24 05:15:16] [INFO ] Parsed PT model containing 324 places and 344 transitions and 898 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 344/344 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 302 transition count 344
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 70 place count 254 transition count 296
Iterating global reduction 1 with 48 rules applied. Total rules applied 118 place count 254 transition count 296
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 129 place count 243 transition count 285
Iterating global reduction 1 with 11 rules applied. Total rules applied 140 place count 243 transition count 285
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 149 place count 234 transition count 276
Iterating global reduction 1 with 9 rules applied. Total rules applied 158 place count 234 transition count 276
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 166 place count 226 transition count 268
Iterating global reduction 1 with 8 rules applied. Total rules applied 174 place count 226 transition count 268
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 180 place count 220 transition count 256
Iterating global reduction 1 with 6 rules applied. Total rules applied 186 place count 220 transition count 256
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 192 place count 214 transition count 250
Iterating global reduction 1 with 6 rules applied. Total rules applied 198 place count 214 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 201 place count 211 transition count 247
Iterating global reduction 1 with 3 rules applied. Total rules applied 204 place count 211 transition count 247
Applied a total of 204 rules in 102 ms. Remains 211 /324 variables (removed 113) and now considering 247/344 (removed 97) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1204828265246451764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3304426721726213210.kers'
[2026-05-24 05:15:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1204828265246451764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3304426721726213210.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 247 rows 211 cols 655 entries
Finished phase 1 with 209 SingleSign rule and 0 generalized
[2026-05-24 05:15:16] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3304426721726213210.kers
Total runtime 2 ms.
[2026-05-24 05:15:16] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-24 05:15:16] [INFO ] Invariant cache hit.
[2026-05-24 05:15:16] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Running 246 sub problems to find dead transitions.
[2026-05-24 05:15:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 247/458 variables, 211/213 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 20/233 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (OVERLAPS) 0/458 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 235 constraints, problems are : Problem set: 0 solved, 246 unsolved in 16812 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (OVERLAPS) 247/458 variables, 211/235 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 246/481 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (OVERLAPS) 0/458 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 481 constraints, problems are : Problem set: 0 solved, 246 unsolved in 27508 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44433ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 44451ms
Starting structural reductions in LTL mode, iteration 1 : 211/324 places, 247/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45052 ms. Remains : 211/324 places, 247/344 transitions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 247/247 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 247/247 (removed 0) transitions.
[2026-05-24 05:16:01] [INFO ] Invariant cache hit.
[2026-05-24 05:16:01] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-24 05:16:01] [INFO ] Invariant cache hit.
[2026-05-24 05:16:01] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 211/211 places, 247/247 transitions.
Support contains 25 out of 211 places after structural reductions.
[2026-05-24 05:16:01] [INFO ] Flatten gal took : 38 ms
[2026-05-24 05:16:01] [INFO ] Flatten gal took : 21 ms
[2026-05-24 05:16:01] [INFO ] Input system was already deterministic with 247 transitions.
RANDOM walk for 7218 steps (17 resets) in 203 ms. (35 steps per ms) remains 0/16 properties
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 40 stabilizing places and 40 stable transitions
Graph (complete) has 411 edges and 211 vertex of which 208 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 247/247 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 197 transition count 233
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 197 transition count 233
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 192 transition count 226
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 192 transition count 226
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 188 transition count 221
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 188 transition count 221
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 184 transition count 216
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 184 transition count 216
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 182 transition count 214
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 181 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 181 transition count 213
Applied a total of 60 rules in 17 ms. Remains 181 /211 variables (removed 30) and now considering 213/247 (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-16276656760032006659.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15106825642372359968.kers'
[2026-05-24 05:16:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16276656760032006659.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15106825642372359968.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 213 rows 181 cols 575 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-24 05:16:02] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15106825642372359968.kers
Total runtime 3 ms.
[2026-05-24 05:16:02] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-24 05:16:02] [INFO ] Invariant cache hit.
[2026-05-24 05:16:02] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2026-05-24 05:16:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 213/394 variables, 181/183 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 11/194 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 194 constraints, problems are : Problem set: 0 solved, 212 unsolved in 11433 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/394 variables, 181/194 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 212/406 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 406 constraints, problems are : Problem set: 0 solved, 212 unsolved in 14042 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25517ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 25523ms
Starting structural reductions in LTL mode, iteration 1 : 181/211 places, 213/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25717 ms. Remains : 181/211 places, 213/247 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-00
Product exploration explored 100000 steps with 33333 reset in 177 ms.
Product exploration explored 100000 steps with 33333 reset in 163 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Graph (complete) has 366 edges and 181 vertex of which 180 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 35 stabilizing places and 35 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 10 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-00 finished in 26379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 247/247 transitions.
Graph (complete) has 411 edges and 211 vertex of which 208 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 207 transition count 207
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 171 transition count 207
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 73 place count 171 transition count 176
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 135 place count 140 transition count 176
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 140 place count 135 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 145 place count 135 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 145 place count 135 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 134 transition count 169
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 149 place count 132 transition count 167
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 132 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 152 place count 131 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 131 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 154 place count 130 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 130 transition count 164
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 259 place count 78 transition count 112
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 269 place count 68 transition count 93
Iterating global reduction 2 with 10 rules applied. Total rules applied 279 place count 68 transition count 93
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 289 place count 58 transition count 81
Iterating global reduction 2 with 10 rules applied. Total rules applied 299 place count 58 transition count 81
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 309 place count 48 transition count 62
Iterating global reduction 2 with 10 rules applied. Total rules applied 319 place count 48 transition count 62
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 329 place count 38 transition count 51
Iterating global reduction 2 with 10 rules applied. Total rules applied 339 place count 38 transition count 51
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 348 place count 29 transition count 34
Iterating global reduction 2 with 9 rules applied. Total rules applied 357 place count 29 transition count 34
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 366 place count 20 transition count 24
Iterating global reduction 2 with 9 rules applied. Total rules applied 375 place count 20 transition count 24
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 377 place count 18 transition count 21
Iterating global reduction 2 with 2 rules applied. Total rules applied 379 place count 18 transition count 21
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 380 place count 17 transition count 20
Iterating global reduction 2 with 1 rules applied. Total rules applied 381 place count 17 transition count 20
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 382 place count 17 transition count 19
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 383 place count 17 transition count 19
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 385 place count 15 transition count 17
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 15 edges and 13 vertex of which 10 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 389 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 390 place count 9 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 390 place count 9 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 392 place count 8 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 396 place count 6 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 399 place count 6 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 400 place count 5 transition count 9
Applied a total of 400 rules in 87 ms. Remains 5 /211 variables (removed 206) and now considering 9/247 (removed 238) transitions.
[2026-05-24 05:16:28] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5116963287074931051.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4093758726505593165.kers'
[2026-05-24 05:16:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5116963287074931051.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4093758726505593165.kers]
Normalized transition count is 7 out of 8 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 5 cols 13 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-24 05:16:28] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4093758726505593165.kers
Total runtime 0 ms.
[2026-05-24 05:16:28] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 05:16:28] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
[2026-05-24 05:16:28] [INFO ] Invariant cache hit.
[2026-05-24 05:16:28] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2026-05-24 05:16:28] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-24 05:16:28] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
[2026-05-24 05:16:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 42 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/12 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 39 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 84ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/211 places, 9/247 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 5/211 places, 9/247 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-03 finished in 257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 247/247 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 198 transition count 234
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 198 transition count 234
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 195 transition count 229
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 195 transition count 229
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 192 transition count 226
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 192 transition count 226
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 189 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 189 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 188 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 188 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 187 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 187 transition count 220
Applied a total of 48 rules in 27 ms. Remains 187 /211 variables (removed 24) and now considering 220/247 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-660068715361745097.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7203271784353538844.kers'
[2026-05-24 05:16:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-660068715361745097.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7203271784353538844.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 220 rows 187 cols 593 entries
Finished phase 1 with 185 SingleSign rule and 0 generalized
[2026-05-24 05:16:28] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7203271784353538844.kers
Total runtime 1 ms.
[2026-05-24 05:16:28] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-24 05:16:28] [INFO ] Invariant cache hit.
[2026-05-24 05:16:28] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2026-05-24 05:16:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 220/407 variables, 187/189 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/407 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 211 constraints, problems are : Problem set: 0 solved, 219 unsolved in 13406 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/407 variables, 187/211 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 219/430 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/407 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 430 constraints, problems are : Problem set: 0 solved, 219 unsolved in 16876 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30318ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 30319ms
Starting structural reductions in LTL mode, iteration 1 : 187/211 places, 220/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30511 ms. Remains : 187/211 places, 220/247 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(G(p0)))))'
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-05 finished in 30705 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 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 247/247 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 197 transition count 233
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 197 transition count 233
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 192 transition count 226
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 192 transition count 226
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 188 transition count 221
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 188 transition count 221
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 185 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 185 transition count 217
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 183 transition count 215
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 183 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 182 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 182 transition count 214
Applied a total of 58 rules in 24 ms. Remains 182 /211 variables (removed 29) and now considering 214/247 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-839211457345397942.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1034810700821693337.kers'
[2026-05-24 05:16:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-839211457345397942.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1034810700821693337.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 182 cols 576 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-05-24 05:16:59] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1034810700821693337.kers
Total runtime 2 ms.
[2026-05-24 05:16:59] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-24 05:16:59] [INFO ] Invariant cache hit.
[2026-05-24 05:16:59] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2026-05-24 05:16:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 214/396 variables, 182/184 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 11/195 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 195 constraints, problems are : Problem set: 0 solved, 213 unsolved in 11418 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/396 variables, 182/195 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 213/408 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/396 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 408 constraints, problems are : Problem set: 0 solved, 213 unsolved in 15828 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27277ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 27277ms
Starting structural reductions in LTL mode, iteration 1 : 182/211 places, 214/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27471 ms. Remains : 182/211 places, 214/247 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 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-07 finished in 27594 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&&G(!p1)) U X(p2)))'
Support contains 5 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 247/247 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 198 transition count 234
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 198 transition count 234
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 194 transition count 228
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 194 transition count 228
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 191 transition count 225
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 191 transition count 225
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 188 transition count 221
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 188 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 187 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 187 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 186 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 186 transition count 219
Applied a total of 50 rules in 26 ms. Remains 186 /211 variables (removed 25) and now considering 219/247 (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-17996330308101850915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10112742596312815532.kers'
[2026-05-24 05:17:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17996330308101850915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10112742596312815532.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 186 cols 591 entries
Finished phase 1 with 184 SingleSign rule and 0 generalized
[2026-05-24 05:17:27] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10112742596312815532.kers
Total runtime 4 ms.
[2026-05-24 05:17:27] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-24 05:17:27] [INFO ] Invariant cache hit.
[2026-05-24 05:17:27] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-24 05:17:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/405 variables, 186/188 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 11/199 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/405 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 199 constraints, problems are : Problem set: 0 solved, 218 unsolved in 12292 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/405 variables, 186/199 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 218/417 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/405 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 417 constraints, problems are : Problem set: 0 solved, 218 unsolved in 15817 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28143ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 28144ms
Starting structural reductions in LTL mode, iteration 1 : 186/211 places, 219/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28360 ms. Remains : 186/211 places, 219/247 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0)&&p1) U X(p2)))'
Stuttering acceptance computed with spot in 197 ms :[(NOT p2), (NOT p2), (NOT p2), true, p0]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-10 finished in 28598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 247/247 transitions.
Graph (complete) has 411 edges and 211 vertex of which 208 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 207 transition count 207
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 171 transition count 207
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 73 place count 171 transition count 176
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 135 place count 140 transition count 176
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 140 place count 135 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 145 place count 135 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 145 place count 135 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 134 transition count 169
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 149 place count 132 transition count 167
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 132 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 152 place count 131 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 131 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 154 place count 130 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 130 transition count 164
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 257 place count 79 transition count 113
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 266 place count 70 transition count 96
Iterating global reduction 2 with 9 rules applied. Total rules applied 275 place count 70 transition count 96
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 284 place count 61 transition count 85
Iterating global reduction 2 with 9 rules applied. Total rules applied 293 place count 61 transition count 85
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 302 place count 52 transition count 68
Iterating global reduction 2 with 9 rules applied. Total rules applied 311 place count 52 transition count 68
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 320 place count 43 transition count 58
Iterating global reduction 2 with 9 rules applied. Total rules applied 329 place count 43 transition count 58
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 338 place count 34 transition count 41
Iterating global reduction 2 with 9 rules applied. Total rules applied 347 place count 34 transition count 41
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 355 place count 26 transition count 32
Iterating global reduction 2 with 8 rules applied. Total rules applied 363 place count 26 transition count 32
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 365 place count 24 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 367 place count 24 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 368 place count 23 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 369 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 370 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 371 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 373 place count 21 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 22 edges and 19 vertex of which 16 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 380 place count 16 transition count 18
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 384 place count 12 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 388 place count 10 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 390 place count 9 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 391 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 392 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 394 place count 7 transition count 12
Applied a total of 394 rules in 46 ms. Remains 7 /211 variables (removed 204) and now considering 12/247 (removed 235) transitions.
[2026-05-24 05:17:55] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16155112563321013188.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12174400904191191382.kers'
[2026-05-24 05:17:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16155112563321013188.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12174400904191191382.kers]
Normalized transition count is 9 out of 10 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 7 cols 15 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 05:17:55] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12174400904191191382.kers
Total runtime 0 ms.
[2026-05-24 05:17:55] [INFO ] Implicit Places using invariants in 14 ms returned []
[2026-05-24 05:17:55] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2026-05-24 05:17:55] [INFO ] Invariant cache hit.
[2026-05-24 05:17:55] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2026-05-24 05:17:55] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-24 05:17:55] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2026-05-24 05:17:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 4/16 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 90ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/211 places, 12/247 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 7/211 places, 12/247 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-12
Stuttering criterion allowed to conclude after 35 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-12 finished in 216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(X(F(p0))) U p1))))'
Support contains 4 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 247/247 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 198 transition count 234
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 198 transition count 234
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 193 transition count 227
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 193 transition count 227
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 189 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 189 transition count 222
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 185 transition count 217
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 185 transition count 217
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 183 transition count 215
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 183 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 182 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 182 transition count 214
Applied a total of 58 rules in 19 ms. Remains 182 /211 variables (removed 29) and now considering 214/247 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-883471272727968395.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12694407058193237456.kers'
[2026-05-24 05:17:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-883471272727968395.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12694407058193237456.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 182 cols 577 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-05-24 05:17:55] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12694407058193237456.kers
Total runtime 1 ms.
[2026-05-24 05:17:55] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 05:17:55] [INFO ] Invariant cache hit.
[2026-05-24 05:17:56] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2026-05-24 05:17:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 214/396 variables, 182/184 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 11/195 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 195 constraints, problems are : Problem set: 0 solved, 213 unsolved in 11696 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/396 variables, 182/195 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 213/408 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/396 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 408 constraints, problems are : Problem set: 0 solved, 213 unsolved in 17769 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29494ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 29494ms
Starting structural reductions in LTL mode, iteration 1 : 182/211 places, 214/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29673 ms. Remains : 182/211 places, 214/247 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(X(F(p0))) U p1))))'
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 95 ms.
Product exploration explored 100000 steps with 33333 reset in 119 ms.
Computed a total of 36 stabilizing places and 36 stable transitions
Graph (complete) has 367 edges and 182 vertex of which 181 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 36 stabilizing places and 36 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 9 ms. Proved property starting from automaton with 5 states, 6 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 14 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-13 finished in 30135 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 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 247/247 transitions.
Graph (complete) has 411 edges and 211 vertex of which 209 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 208 transition count 207
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 171 transition count 207
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 75 place count 171 transition count 177
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 135 place count 141 transition count 177
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 139 place count 137 transition count 172
Iterating global reduction 2 with 4 rules applied. Total rules applied 143 place count 137 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 143 place count 137 transition count 171
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 136 transition count 171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 134 transition count 169
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 134 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 150 place count 133 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 151 place count 133 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 152 place count 132 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 132 transition count 166
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 257 place count 80 transition count 114
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 266 place count 71 transition count 96
Iterating global reduction 2 with 9 rules applied. Total rules applied 275 place count 71 transition count 96
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 284 place count 62 transition count 86
Iterating global reduction 2 with 9 rules applied. Total rules applied 293 place count 62 transition count 86
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 301 place count 54 transition count 71
Iterating global reduction 2 with 8 rules applied. Total rules applied 309 place count 54 transition count 71
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 317 place count 46 transition count 62
Iterating global reduction 2 with 8 rules applied. Total rules applied 325 place count 46 transition count 62
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 333 place count 38 transition count 47
Iterating global reduction 2 with 8 rules applied. Total rules applied 341 place count 38 transition count 47
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 349 place count 30 transition count 38
Iterating global reduction 2 with 8 rules applied. Total rules applied 357 place count 30 transition count 38
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 358 place count 29 transition count 37
Iterating global reduction 2 with 1 rules applied. Total rules applied 359 place count 29 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 361 place count 29 transition count 35
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 362 place count 29 transition count 35
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 364 place count 27 transition count 33
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 28 edges and 25 vertex of which 22 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 373 place count 22 transition count 24
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 379 place count 16 transition count 24
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 387 place count 12 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 388 place count 12 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 391 place count 9 transition count 16
Applied a total of 391 rules in 27 ms. Remains 9 /211 variables (removed 202) and now considering 16/247 (removed 231) transitions.
[2026-05-24 05:18:25] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4356807239171370852.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4942027078011944228.kers'
[2026-05-24 05:18:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4356807239171370852.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4942027078011944228.kers]
Normalized transition count is 11 out of 12 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 9 cols 18 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-24 05:18:25] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4942027078011944228.kers
Total runtime 2 ms.
[2026-05-24 05:18:26] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 05:18:26] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2026-05-24 05:18:26] [INFO ] Invariant cache hit.
[2026-05-24 05:18:26] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2026-05-24 05:18:26] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-24 05:18:26] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2026-05-24 05:18:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4/20 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/21 variables, and 9 constraints, problems are : Problem set: 0 solved, 8 unsolved in 65 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 4/20 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/21 variables, and 17 constraints, problems are : Problem set: 0 solved, 8 unsolved in 59 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 127ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/211 places, 16/247 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 9/211 places, 16/247 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-14
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-14 finished in 293 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 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 247/247 transitions.
Graph (complete) has 411 edges and 211 vertex of which 208 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 207 transition count 207
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 171 transition count 207
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 73 place count 171 transition count 176
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 135 place count 140 transition count 176
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 139 place count 136 transition count 172
Iterating global reduction 2 with 4 rules applied. Total rules applied 143 place count 136 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 143 place count 136 transition count 171
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 135 transition count 171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 134 transition count 170
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 134 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 133 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 133 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 150 place count 132 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 151 place count 132 transition count 167
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 257 place count 79 transition count 114
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 266 place count 70 transition count 97
Iterating global reduction 2 with 9 rules applied. Total rules applied 275 place count 70 transition count 97
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 284 place count 61 transition count 86
Iterating global reduction 2 with 9 rules applied. Total rules applied 293 place count 61 transition count 86
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 301 place count 53 transition count 71
Iterating global reduction 2 with 8 rules applied. Total rules applied 309 place count 53 transition count 71
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 317 place count 45 transition count 62
Iterating global reduction 2 with 8 rules applied. Total rules applied 325 place count 45 transition count 62
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 333 place count 37 transition count 47
Iterating global reduction 2 with 8 rules applied. Total rules applied 341 place count 37 transition count 47
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 349 place count 29 transition count 38
Iterating global reduction 2 with 8 rules applied. Total rules applied 357 place count 29 transition count 38
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 359 place count 27 transition count 35
Iterating global reduction 2 with 2 rules applied. Total rules applied 361 place count 27 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 362 place count 26 transition count 34
Iterating global reduction 2 with 1 rules applied. Total rules applied 363 place count 26 transition count 34
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 364 place count 26 transition count 33
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 365 place count 26 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 367 place count 24 transition count 31
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 27 edges and 22 vertex of which 19 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 373 place count 19 transition count 25
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 376 place count 16 transition count 25
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 384 place count 12 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 387 place count 12 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 390 place count 9 transition count 15
Applied a total of 390 rules in 27 ms. Remains 9 /211 variables (removed 202) and now considering 15/247 (removed 232) transitions.
[2026-05-24 05:18:26] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1525320913923930948.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1681792762401801066.kers'
[2026-05-24 05:18:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1525320913923930948.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1681792762401801066.kers]
Normalized transition count is 10 out of 11 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 9 cols 17 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-24 05:18:26] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1681792762401801066.kers
Total runtime 0 ms.
[2026-05-24 05:18:26] [INFO ] Implicit Places using invariants in 14 ms returned []
[2026-05-24 05:18:26] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
[2026-05-24 05:18:26] [INFO ] Invariant cache hit.
[2026-05-24 05:18:26] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2026-05-24 05:18:26] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-24 05:18:26] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
[2026-05-24 05:18:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/19 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/20 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 62 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/19 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/20 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 65 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 128ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 128ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/211 places, 15/247 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 9/211 places, 15/247 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 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-15 finished in 285 ms.
All properties solved by simple procedures.
Total runtime 190557 ms.
BK_STOP 1779599906583
--------------------
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-11b"
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-11b, 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-177955695500323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-11b.tgz
mv DiscoveryGPU-PT-11b 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 '
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 ;