About the Execution of ITS-Tools for DiscoveryGPU-PT-13b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 653.443 | 302228.00 | 361934.00 | 766.10 | FFFFFFFFFFFFFFFF | 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-177955695500356.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-13b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500356
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.6K Mar 6 16:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Mar 6 16:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 6 16:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 6 16:20 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.9K Mar 15 09:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 09:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 09:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 6 16:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 6 16:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 6 16:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 6 16:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:15 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 97K 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-13b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779603039850
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-13b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 06:10:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 06:10:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 06:10:41] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2026-05-24 06:10:41] [INFO ] Transformed 380 places.
[2026-05-24 06:10:41] [INFO ] Transformed 404 transitions.
[2026-05-24 06:10:41] [INFO ] Found NUPN structural information;
[2026-05-24 06:10:41] [INFO ] Parsed PT model containing 380 places and 404 transitions and 1056 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 404/404 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 354 transition count 404
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 90 place count 290 transition count 340
Iterating global reduction 1 with 64 rules applied. Total rules applied 154 place count 290 transition count 340
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 168 place count 276 transition count 326
Iterating global reduction 1 with 14 rules applied. Total rules applied 182 place count 276 transition count 326
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 193 place count 265 transition count 315
Iterating global reduction 1 with 11 rules applied. Total rules applied 204 place count 265 transition count 315
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 214 place count 255 transition count 305
Iterating global reduction 1 with 10 rules applied. Total rules applied 224 place count 255 transition count 305
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 229 place count 250 transition count 295
Iterating global reduction 1 with 5 rules applied. Total rules applied 234 place count 250 transition count 295
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 238 place count 246 transition count 291
Iterating global reduction 1 with 4 rules applied. Total rules applied 242 place count 246 transition count 291
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 246 place count 242 transition count 287
Iterating global reduction 1 with 4 rules applied. Total rules applied 250 place count 242 transition count 287
Applied a total of 250 rules in 107 ms. Remains 242 /380 variables (removed 138) and now considering 287/404 (removed 117) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15410320497754675623.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-316766604417550541.kers'
[2026-05-24 06:10:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15410320497754675623.kers, --Pflows, --basisKERS=/tmp/petrispot-output-316766604417550541.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 287 rows 242 cols 771 entries
Finished phase 1 with 240 SingleSign rule and 0 generalized
[2026-05-24 06:10:41] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-316766604417550541.kers
Total runtime 2 ms.
[2026-05-24 06:10:41] [INFO ] Implicit Places using invariants in 295 ms returned []
[2026-05-24 06:10:41] [INFO ] Invariant cache hit.
[2026-05-24 06:10:42] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2026-05-24 06:10:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/242 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (OVERLAPS) 287/529 variables, 242/244 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 13/257 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 0/529 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 529/529 variables, and 257 constraints, problems are : Problem set: 0 solved, 286 unsolved in 21357 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/242 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/529 variables, 242/257 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 286/543 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/529 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 529/529 variables, and 543 constraints, problems are : Problem set: 0 solved, 286 unsolved in 28511 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50004ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 50024ms
Starting structural reductions in LTL mode, iteration 1 : 242/380 places, 287/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50736 ms. Remains : 242/380 places, 287/404 transitions.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 287/287 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2026-05-24 06:11:32] [INFO ] Invariant cache hit.
[2026-05-24 06:11:32] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-24 06:11:32] [INFO ] Invariant cache hit.
[2026-05-24 06:11:32] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 213 ms. Remains : 242/242 places, 287/287 transitions.
Support contains 27 out of 242 places after structural reductions.
[2026-05-24 06:11:32] [INFO ] Flatten gal took : 44 ms
[2026-05-24 06:11:32] [INFO ] Flatten gal took : 18 ms
[2026-05-24 06:11:32] [INFO ] Input system was already deterministic with 287 transitions.
RANDOM walk for 36544 steps (85 resets) in 1275 ms. (28 steps per ms) remains 0/25 properties
FORMULA DiscoveryGPU-PT-13b-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 486 edges and 242 vertex of which 241 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(X(F(p1))))))))'
Support contains 2 out of 242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 287/287 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 235 transition count 279
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 235 transition count 279
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 228 transition count 269
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 228 transition count 269
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 222 transition count 262
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 222 transition count 262
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 217 transition count 256
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 217 transition count 256
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 215 transition count 254
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 215 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 214 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 214 transition count 253
Applied a total of 56 rules in 30 ms. Remains 214 /242 variables (removed 28) and now considering 253/287 (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-6314054313561474542.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12781795641915184866.kers'
[2026-05-24 06:11:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6314054313561474542.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12781795641915184866.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 253 rows 214 cols 683 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-24 06:11:33] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12781795641915184866.kers
Total runtime 1 ms.
[2026-05-24 06:11:33] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-24 06:11:33] [INFO ] Invariant cache hit.
[2026-05-24 06:11:33] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2026-05-24 06:11:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 253/467 variables, 214/216 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 13/229 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/467 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 229 constraints, problems are : Problem set: 0 solved, 252 unsolved in 16147 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 253/467 variables, 214/229 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 252/481 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/467 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 481 constraints, problems are : Problem set: 0 solved, 252 unsolved in 21145 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37342ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 37346ms
Starting structural reductions in LTL mode, iteration 1 : 214/242 places, 253/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37601 ms. Remains : 214/242 places, 253/287 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(X(F(p1))))))))'
Stuttering acceptance computed with spot in 352 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-00
Product exploration explored 100000 steps with 16666 reset in 189 ms.
Product exploration explored 100000 steps with 16654 reset in 145 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 434 edges and 214 vertex of which 213 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge based reduction with 1 factoid took 60 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 8064 steps (16 resets) in 99 ms. (80 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 395 ms.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 214 /214 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2026-05-24 06:12:12] [INFO ] Invariant cache hit.
[2026-05-24 06:12:12] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-24 06:12:12] [INFO ] Invariant cache hit.
[2026-05-24 06:12:12] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 214/214 places, 253/253 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 434 edges and 214 vertex of which 213 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 5586 steps (10 resets) in 52 ms. (105 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 395 ms.
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 16682 reset in 84 ms.
Product exploration explored 100000 steps with 16670 reset in 104 ms.
Spot run failed in 79 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin9070722341712031140
[2026-05-24 06:12:13] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9070722341712031140
Running compilation step : cd /tmp/ltsmin9070722341712031140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 494 ms.
Running link step : cd /tmp/ltsmin9070722341712031140;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin9070722341712031140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased5064330590831421395.hoa' '--buchi-type=spotba'
LTSmin run took 9427 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-00 finished in 50380 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))&&F(p1)))'
Support contains 3 out of 242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 287/287 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 237 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 237 transition count 282
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 232 transition count 274
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 232 transition count 274
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 228 transition count 270
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 228 transition count 270
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 224 transition count 265
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 224 transition count 265
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 223 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 223 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 222 transition count 263
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 222 transition count 263
Applied a total of 40 rules in 26 ms. Remains 222 /242 variables (removed 20) and now considering 263/287 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18399944159723784587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17876954620587214225.kers'
[2026-05-24 06:12:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18399944159723784587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17876954620587214225.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 263 rows 222 cols 709 entries
Finished phase 1 with 220 SingleSign rule and 0 generalized
[2026-05-24 06:12:23] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-17876954620587214225.kers
Total runtime 8 ms.
[2026-05-24 06:12:23] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-24 06:12:23] [INFO ] Invariant cache hit.
[2026-05-24 06:12:24] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2026-05-24 06:12:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 263/485 variables, 222/224 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 13/237 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/485 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 237 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17268 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/485 variables, 222/237 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 262/499 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 499 constraints, problems are : Problem set: 0 solved, 262 unsolved in 23635 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40954ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 40955ms
Starting structural reductions in LTL mode, iteration 1 : 222/242 places, 263/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41227 ms. Remains : 222/242 places, 263/287 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))&&F(p1)))'
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-01 finished in 41426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(X(p1)))))))'
Support contains 2 out of 242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 287/287 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 234 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 234 transition count 278
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 226 transition count 266
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 226 transition count 266
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 219 transition count 258
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 219 transition count 258
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 213 transition count 251
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 213 transition count 251
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 211 transition count 249
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 211 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 210 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 210 transition count 248
Applied a total of 64 rules in 21 ms. Remains 210 /242 variables (removed 32) and now considering 248/287 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5406301130975363266.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7433588369013033099.kers'
[2026-05-24 06:13:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5406301130975363266.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7433588369013033099.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 210 cols 671 entries
Finished phase 1 with 208 SingleSign rule and 0 generalized
[2026-05-24 06:13:05] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7433588369013033099.kers
Total runtime 3 ms.
[2026-05-24 06:13:05] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-24 06:13:05] [INFO ] Invariant cache hit.
[2026-05-24 06:13:05] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2026-05-24 06:13:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/458 variables, 210/212 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 13/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 0/458 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 225 constraints, problems are : Problem set: 0 solved, 247 unsolved in 15776 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/458 variables, 210/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 247/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 0/458 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 472 constraints, problems are : Problem set: 0 solved, 247 unsolved in 20326 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36139ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 36140ms
Starting structural reductions in LTL mode, iteration 1 : 210/242 places, 248/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36358 ms. Remains : 210/242 places, 248/287 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((X(X(X(X(p0))))||p1)))'
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-03
Product exploration explored 100000 steps with 16609 reset in 88 ms.
Product exploration explored 100000 steps with 16645 reset in 98 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 427 edges and 210 vertex of which 209 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge based reduction with 1 factoid took 56 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 446 steps (0 resets) in 12 ms. (34 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 392 ms.
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 248/248 transitions.
Applied a total of 0 rules in 7 ms. Remains 210 /210 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2026-05-24 06:13:42] [INFO ] Invariant cache hit.
[2026-05-24 06:13:42] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-24 06:13:42] [INFO ] Invariant cache hit.
[2026-05-24 06:13:42] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 210/210 places, 248/248 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 427 edges and 210 vertex of which 209 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge based reduction with 1 factoid took 58 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 852 steps (0 resets) in 15 ms. (53 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 367 ms.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 16639 reset in 127 ms.
Product exploration explored 100000 steps with 16687 reset in 123 ms.
Spot run failed in 50 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin5662809282577399036
[2026-05-24 06:13:43] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5662809282577399036
Running compilation step : cd /tmp/ltsmin5662809282577399036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 376 ms.
Running link step : cd /tmp/ltsmin5662809282577399036;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5662809282577399036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased842458965652856785.hoa' '--buchi-type=spotba'
LTSmin run took 392 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-03 finished in 39584 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(p0))&&F(p1)&&F(p2)))'
Support contains 5 out of 242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 287/287 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 234 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 234 transition count 278
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 226 transition count 266
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 226 transition count 266
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 219 transition count 258
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 219 transition count 258
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 213 transition count 251
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 213 transition count 251
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 211 transition count 249
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 211 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 210 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 210 transition count 248
Applied a total of 64 rules in 19 ms. Remains 210 /242 variables (removed 32) and now considering 248/287 (removed 39) transitions.
[2026-05-24 06:13:44] [INFO ] Invariant cache hit.
[2026-05-24 06:13:44] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-24 06:13:44] [INFO ] Invariant cache hit.
[2026-05-24 06:13:44] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 210/242 places, 248/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 210/242 places, 248/287 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(p0))&&F(p1)&&F(p2)))'
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-04
Product exploration explored 100000 steps with 795 reset in 186 ms.
Stack based approach found an accepted trace after 129 steps with 0 reset with depth 130 and stack size 130 in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-04 finished in 640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 287/287 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 234 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 234 transition count 278
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 226 transition count 266
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 226 transition count 266
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 219 transition count 258
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 219 transition count 258
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 213 transition count 251
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 213 transition count 251
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 211 transition count 249
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 211 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 210 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 210 transition count 248
Applied a total of 64 rules in 17 ms. Remains 210 /242 variables (removed 32) and now considering 248/287 (removed 39) transitions.
[2026-05-24 06:13:45] [INFO ] Invariant cache hit.
[2026-05-24 06:13:45] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-24 06:13:45] [INFO ] Invariant cache hit.
[2026-05-24 06:13:45] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 210/242 places, 248/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 210/242 places, 248/287 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-05
Product exploration explored 100000 steps with 491 reset in 185 ms.
Stack based approach found an accepted trace after 251 steps with 1 reset with depth 112 and stack size 112 in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-05 finished in 588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G((p0||G((p0||X(p1)))))||(p2&&(p0||G((p0||X(p1))))))))'
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 287/287 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 235 transition count 279
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 235 transition count 279
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 228 transition count 268
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 228 transition count 268
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 221 transition count 260
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 221 transition count 260
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 216 transition count 254
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 216 transition count 254
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 214 transition count 252
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 214 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 213 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 213 transition count 251
Applied a total of 58 rules in 18 ms. Remains 213 /242 variables (removed 29) and now considering 251/287 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8931260844579044595.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14764182056137860519.kers'
[2026-05-24 06:13:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8931260844579044595.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14764182056137860519.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 251 rows 213 cols 679 entries
Finished phase 1 with 211 SingleSign rule and 0 generalized
[2026-05-24 06:13:46] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14764182056137860519.kers
Total runtime 4 ms.
[2026-05-24 06:13:46] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-24 06:13:46] [INFO ] Invariant cache hit.
[2026-05-24 06:13:46] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 250 sub problems to find dead transitions.
[2026-05-24 06:13:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 251/464 variables, 213/215 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 13/228 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 0/464 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 228 constraints, problems are : Problem set: 0 solved, 250 unsolved in 15965 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 251/464 variables, 213/228 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 250/478 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/464 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 478 constraints, problems are : Problem set: 0 solved, 250 unsolved in 22840 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38836ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 38837ms
Starting structural reductions in LTL mode, iteration 1 : 213/242 places, 251/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39066 ms. Remains : 213/242 places, 251/287 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G((p0||G((p0||X(p1)))))||(p2&&(G((p0||X(p1)))||p0)))))'
Stuttering acceptance computed with spot in 141 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 180 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-06 finished in 39252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(G(p1)) U (F((G(!p0)||(!p0&&F(p2)))) U !p2))))'
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 287/287 transitions.
Graph (complete) has 486 edges and 242 vertex of which 241 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 240 transition count 249
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 204 transition count 249
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 73 place count 204 transition count 207
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 157 place count 162 transition count 207
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 164 place count 155 transition count 196
Iterating global reduction 2 with 7 rules applied. Total rules applied 171 place count 155 transition count 196
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 176 place count 150 transition count 191
Iterating global reduction 2 with 5 rules applied. Total rules applied 181 place count 150 transition count 191
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 182 place count 149 transition count 189
Iterating global reduction 2 with 1 rules applied. Total rules applied 183 place count 149 transition count 189
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 184 place count 148 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 185 place count 148 transition count 188
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 297 place count 92 transition count 132
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 309 place count 80 transition count 109
Iterating global reduction 2 with 12 rules applied. Total rules applied 321 place count 80 transition count 109
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 332 place count 69 transition count 97
Iterating global reduction 2 with 11 rules applied. Total rules applied 343 place count 69 transition count 97
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 354 place count 58 transition count 76
Iterating global reduction 2 with 11 rules applied. Total rules applied 365 place count 58 transition count 76
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 375 place count 48 transition count 65
Iterating global reduction 2 with 10 rules applied. Total rules applied 385 place count 48 transition count 65
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 395 place count 38 transition count 46
Iterating global reduction 2 with 10 rules applied. Total rules applied 405 place count 38 transition count 46
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 415 place count 28 transition count 35
Iterating global reduction 2 with 10 rules applied. Total rules applied 425 place count 28 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 426 place count 27 transition count 34
Iterating global reduction 2 with 1 rules applied. Total rules applied 427 place count 27 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 429 place count 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 41 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 433 place count 23 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 435 place count 21 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 437 place count 20 transition count 28
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 439 place count 19 transition count 28
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 442 place count 16 transition count 25
Applied a total of 442 rules in 78 ms. Remains 16 /242 variables (removed 226) and now considering 25/287 (removed 262) transitions.
[2026-05-24 06:14:25] [INFO ] Flow matrix only has 21 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-332651233525534814.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1179212478628947495.kers'
[2026-05-24 06:14:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-332651233525534814.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1179212478628947495.kers]
Normalized transition count is 20 out of 21 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 20 rows 15 cols 43 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-24 06:14:25] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1179212478628947495.kers
Total runtime 0 ms.
[2026-05-24 06:14:25] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-24 06:14:25] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2026-05-24 06:14:25] [INFO ] Invariant cache hit.
[2026-05-24 06:14:25] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2026-05-24 06:14:25] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2026-05-24 06:14:25] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2026-05-24 06:14:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 20/33 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 3/36 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/36 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/37 variables, and 17 constraints, problems are : Problem set: 0 solved, 18 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 20/33 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/37 variables, and 35 constraints, problems are : Problem set: 0 solved, 18 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 580ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 580ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/242 places, 25/287 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 724 ms. Remains : 16/242 places, 25/287 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(G(p1)) U (F((G(!p0)||(!p0&&F(p2)))) U !p2))))'
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) p2), (NOT p0), p2, (AND p0 (NOT p1)), (AND p0 (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-10 finished in 981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 287/287 transitions.
Graph (complete) has 486 edges and 242 vertex of which 241 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 240 transition count 247
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 202 transition count 247
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 77 place count 202 transition count 204
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 163 place count 159 transition count 204
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 170 place count 152 transition count 193
Iterating global reduction 2 with 7 rules applied. Total rules applied 177 place count 152 transition count 193
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 182 place count 147 transition count 188
Iterating global reduction 2 with 5 rules applied. Total rules applied 187 place count 147 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 188 place count 146 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 189 place count 146 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 190 place count 145 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 191 place count 145 transition count 185
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 303 place count 89 transition count 129
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 315 place count 77 transition count 106
Iterating global reduction 2 with 12 rules applied. Total rules applied 327 place count 77 transition count 106
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 339 place count 65 transition count 92
Iterating global reduction 2 with 12 rules applied. Total rules applied 351 place count 65 transition count 92
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 363 place count 53 transition count 69
Iterating global reduction 2 with 12 rules applied. Total rules applied 375 place count 53 transition count 69
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 387 place count 41 transition count 56
Iterating global reduction 2 with 12 rules applied. Total rules applied 399 place count 41 transition count 56
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 411 place count 29 transition count 33
Iterating global reduction 2 with 12 rules applied. Total rules applied 423 place count 29 transition count 33
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 435 place count 17 transition count 20
Iterating global reduction 2 with 12 rules applied. Total rules applied 447 place count 17 transition count 20
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 449 place count 15 transition count 17
Iterating global reduction 2 with 2 rules applied. Total rules applied 451 place count 15 transition count 17
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 452 place count 14 transition count 16
Iterating global reduction 2 with 1 rules applied. Total rules applied 453 place count 14 transition count 16
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 454 place count 14 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 455 place count 13 transition count 14
Applied a total of 455 rules in 39 ms. Remains 13 /242 variables (removed 229) and now considering 14/287 (removed 273) transitions.
[2026-05-24 06:14:26] [INFO ] Flow matrix only has 13 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-8540685012880950682.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-83378954091722844.kers'
[2026-05-24 06:14:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8540685012880950682.kers, --Pflows, --basisKERS=/tmp/petrispot-output-83378954091722844.kers]
Normalized transition count is 12 out of 13 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 12 rows 12 cols 22 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-24 06:14:26] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-83378954091722844.kers
Total runtime 0 ms.
[2026-05-24 06:14:26] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 06:14:26] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2026-05-24 06:14:26] [INFO ] Invariant cache hit.
[2026-05-24 06:14:26] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-24 06:14:26] [INFO ] Implicit Places using invariants and state equation in 26 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/242 places, 14/287 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 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 11 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 11 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 9 transition count 11
Applied a total of 6 rules in 2 ms. Remains 9 /12 variables (removed 3) and now considering 11/14 (removed 3) transitions.
[2026-05-24 06:14:26] [INFO ] Flow matrix only has 10 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-5119675422628896229.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9583952260972979654.kers'
[2026-05-24 06:14:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5119675422628896229.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9583952260972979654.kers]
Normalized transition count is 9 out of 10 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 9 cols 16 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-24 06:14:26] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9583952260972979654.kers
Total runtime 0 ms.
[2026-05-24 06:14:26] [INFO ] Implicit Places using invariants in 280 ms returned []
[2026-05-24 06:14:26] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2026-05-24 06:14:26] [INFO ] Invariant cache hit.
[2026-05-24 06:14:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-24 06:14:26] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/242 places, 11/287 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 390 ms. Remains : 9/242 places, 11/287 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 41 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-11
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-11 finished in 453 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(G(p0))||G(!p0)))))'
Support contains 2 out of 242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 287/287 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 234 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 234 transition count 278
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 226 transition count 266
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 226 transition count 266
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 219 transition count 258
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 219 transition count 258
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 213 transition count 251
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 213 transition count 251
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 211 transition count 249
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 211 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 210 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 210 transition count 248
Applied a total of 64 rules in 29 ms. Remains 210 /242 variables (removed 32) and now considering 248/287 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17445544095391128597.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17551895307787059054.kers'
[2026-05-24 06:14:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17445544095391128597.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17551895307787059054.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 210 cols 671 entries
Finished phase 1 with 208 SingleSign rule and 0 generalized
[2026-05-24 06:14:26] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17551895307787059054.kers
Total runtime 3 ms.
[2026-05-24 06:14:26] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-24 06:14:26] [INFO ] Invariant cache hit.
[2026-05-24 06:14:26] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2026-05-24 06:14:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/458 variables, 210/212 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 13/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 0/458 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 225 constraints, problems are : Problem set: 0 solved, 247 unsolved in 16166 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/458 variables, 210/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 247/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 0/458 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 472 constraints, problems are : Problem set: 0 solved, 247 unsolved in 20684 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36892ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 36892ms
Starting structural reductions in LTL mode, iteration 1 : 210/242 places, 248/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37203 ms. Remains : 210/242 places, 248/287 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(G(p0))||G(!p0)))))'
Stuttering acceptance computed with spot in 157 ms :[false, (NOT p0), false, false]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-12
Stuttering criterion allowed to conclude after 442 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-12 finished in 37406 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(G((p0 U p1)))||G(p2)))))'
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 287/287 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 235 transition count 279
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 235 transition count 279
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 228 transition count 268
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 228 transition count 268
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 222 transition count 261
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 222 transition count 261
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 218 transition count 257
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 218 transition count 257
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 217 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 217 transition count 256
Applied a total of 50 rules in 23 ms. Remains 217 /242 variables (removed 25) and now considering 256/287 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18322982999749058749.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8739177816335023186.kers'
[2026-05-24 06:15:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18322982999749058749.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8739177816335023186.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 256 rows 217 cols 693 entries
Finished phase 1 with 215 SingleSign rule and 0 generalized
[2026-05-24 06:15:04] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8739177816335023186.kers
Total runtime 3 ms.
[2026-05-24 06:15:04] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-24 06:15:04] [INFO ] Invariant cache hit.
[2026-05-24 06:15:04] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2026-05-24 06:15:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 256/473 variables, 217/219 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 13/232 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 0/473 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 232 constraints, problems are : Problem set: 0 solved, 255 unsolved in 16853 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/473 variables, 217/232 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 255/487 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 0/473 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 473/473 variables, and 487 constraints, problems are : Problem set: 0 solved, 255 unsolved in 18950 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35843ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 35844ms
Starting structural reductions in LTL mode, iteration 1 : 217/242 places, 256/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36078 ms. Remains : 217/242 places, 256/287 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(G((p0 U p1)))||G(p2)))))'
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-13
Stuttering criterion allowed to conclude after 363 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-13 finished in 36313 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((G((p0||X(X(F(p1)))))||(!p1&&((p0||X(X(F(p1)))) U (G((p0||X(X(F(p1)))))||(!p2&&(p0||X(X(F(p1))))))))))))'
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 287/287 transitions.
Graph (complete) has 486 edges and 242 vertex of which 241 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 240 transition count 249
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 204 transition count 249
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 73 place count 204 transition count 208
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 155 place count 163 transition count 208
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 160 place count 158 transition count 201
Iterating global reduction 2 with 5 rules applied. Total rules applied 165 place count 158 transition count 201
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 168 place count 155 transition count 198
Iterating global reduction 2 with 3 rules applied. Total rules applied 171 place count 155 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 154 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 154 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 174 place count 153 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 153 transition count 195
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 289 place count 96 transition count 138
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 299 place count 86 transition count 119
Iterating global reduction 2 with 10 rules applied. Total rules applied 309 place count 86 transition count 119
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 319 place count 76 transition count 107
Iterating global reduction 2 with 10 rules applied. Total rules applied 329 place count 76 transition count 107
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 339 place count 66 transition count 88
Iterating global reduction 2 with 10 rules applied. Total rules applied 349 place count 66 transition count 88
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 359 place count 56 transition count 77
Iterating global reduction 2 with 10 rules applied. Total rules applied 369 place count 56 transition count 77
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 379 place count 46 transition count 58
Iterating global reduction 2 with 10 rules applied. Total rules applied 389 place count 46 transition count 58
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 399 place count 36 transition count 47
Iterating global reduction 2 with 10 rules applied. Total rules applied 409 place count 36 transition count 47
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 411 place count 34 transition count 44
Iterating global reduction 2 with 2 rules applied. Total rules applied 413 place count 34 transition count 44
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 414 place count 33 transition count 43
Iterating global reduction 2 with 1 rules applied. Total rules applied 415 place count 33 transition count 43
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 416 place count 33 transition count 42
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 418 place count 33 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 420 place count 31 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 421 place count 30 transition count 40
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 421 place count 30 transition count 37
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 427 place count 27 transition count 37
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 3 with 8 rules applied. Total rules applied 435 place count 23 transition count 33
Applied a total of 435 rules in 31 ms. Remains 23 /242 variables (removed 219) and now considering 33/287 (removed 254) transitions.
[2026-05-24 06:15:40] [INFO ] Flow matrix only has 29 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-17514624261095914307.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9052766104986398233.kers'
[2026-05-24 06:15:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17514624261095914307.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9052766104986398233.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 22 cols 74 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-24 06:15:40] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9052766104986398233.kers
Total runtime 3 ms.
[2026-05-24 06:15:40] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-24 06:15:40] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
[2026-05-24 06:15:40] [INFO ] Invariant cache hit.
[2026-05-24 06:15:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 06:15:40] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2026-05-24 06:15:40] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2026-05-24 06:15:40] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
[2026-05-24 06:15:40] [INFO ] Invariant cache hit.
[2026-05-24 06:15:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 29/52 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 25 constraints, problems are : Problem set: 0 solved, 32 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 29/52 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 32/57 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 57 constraints, problems are : Problem set: 0 solved, 32 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 809ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 809ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/242 places, 33/287 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 913 ms. Remains : 23/242 places, 33/287 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((G((p0||X(X(F(p1)))))||(!p1&&((p0||X(X(F(p1)))) U (G((p0||X(X(F(p1)))))||(!p2&&(p0||X(X(F(p1))))))))))))'
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-14
Product exploration explored 100000 steps with 729 reset in 154 ms.
Stack based approach found an accepted trace after 83 steps with 1 reset with depth 33 and stack size 28 in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-14 finished in 1207 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 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 287/287 transitions.
Graph (complete) has 486 edges and 242 vertex of which 241 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 240 transition count 247
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 202 transition count 247
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 77 place count 202 transition count 206
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 159 place count 161 transition count 206
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 166 place count 154 transition count 195
Iterating global reduction 2 with 7 rules applied. Total rules applied 173 place count 154 transition count 195
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 178 place count 149 transition count 190
Iterating global reduction 2 with 5 rules applied. Total rules applied 183 place count 149 transition count 190
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 184 place count 148 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 185 place count 148 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 186 place count 147 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 187 place count 147 transition count 187
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 301 place count 90 transition count 130
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 313 place count 78 transition count 107
Iterating global reduction 2 with 12 rules applied. Total rules applied 325 place count 78 transition count 107
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 337 place count 66 transition count 93
Iterating global reduction 2 with 12 rules applied. Total rules applied 349 place count 66 transition count 93
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 361 place count 54 transition count 70
Iterating global reduction 2 with 12 rules applied. Total rules applied 373 place count 54 transition count 70
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 385 place count 42 transition count 57
Iterating global reduction 2 with 12 rules applied. Total rules applied 397 place count 42 transition count 57
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 409 place count 30 transition count 34
Iterating global reduction 2 with 12 rules applied. Total rules applied 421 place count 30 transition count 34
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 433 place count 18 transition count 21
Iterating global reduction 2 with 12 rules applied. Total rules applied 445 place count 18 transition count 21
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 447 place count 16 transition count 18
Iterating global reduction 2 with 2 rules applied. Total rules applied 449 place count 16 transition count 18
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 450 place count 16 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 452 place count 14 transition count 15
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 454 place count 13 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 455 place count 12 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 455 place count 12 transition count 12
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 459 place count 10 transition count 12
Applied a total of 459 rules in 25 ms. Remains 10 /242 variables (removed 232) and now considering 12/287 (removed 275) transitions.
[2026-05-24 06:15:41] [INFO ] Flow matrix only has 11 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-6382477973411406622.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9229180369064524664.kers'
[2026-05-24 06:15:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6382477973411406622.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9229180369064524664.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 11 rows 9 cols 26 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-24 06:15:41] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9229180369064524664.kers
Total runtime 0 ms.
[2026-05-24 06:15:41] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-24 06:15:41] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2026-05-24 06:15:41] [INFO ] Invariant cache hit.
[2026-05-24 06:15:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 06:15:41] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2026-05-24 06:15:41] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-24 06:15:41] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2026-05-24 06:15:41] [INFO ] Invariant cache hit.
[2026-05-24 06:15:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 11/20 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1/21 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 12 constraints, problems are : Problem set: 0 solved, 10 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 11/20 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/21 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 223ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 223ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/242 places, 12/287 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 301 ms. Remains : 10/242 places, 12/287 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 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-15
Stuttering criterion allowed to conclude after 174 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-15 finished in 432 ms.
All properties solved by simple procedures.
Total runtime 301033 ms.
BK_STOP 1779603342078
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-13b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-13b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-tall-177955695500356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-13b.tgz
mv DiscoveryGPU-PT-13b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;