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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 8.1K Mar 6 16:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 6 16:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 6 16:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 16:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 09:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Mar 6 16:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 6 16:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 6 16:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 6 16:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:14 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 89K 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-12b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779601885054

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-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 05:51:26] [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 05:51:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 05:51:26] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2026-05-24 05:51:26] [INFO ] Transformed 352 places.
[2026-05-24 05:51:26] [INFO ] Transformed 374 transitions.
[2026-05-24 05:51:26] [INFO ] Found NUPN structural information;
[2026-05-24 05:51:26] [INFO ] Parsed PT model containing 352 places and 374 transitions and 977 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 374/374 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 328 transition count 374
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 82 place count 270 transition count 316
Iterating global reduction 1 with 58 rules applied. Total rules applied 140 place count 270 transition count 316
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 152 place count 258 transition count 304
Iterating global reduction 1 with 12 rules applied. Total rules applied 164 place count 258 transition count 304
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 175 place count 247 transition count 293
Iterating global reduction 1 with 11 rules applied. Total rules applied 186 place count 247 transition count 293
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 197 place count 236 transition count 282
Iterating global reduction 1 with 11 rules applied. Total rules applied 208 place count 236 transition count 282
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 214 place count 230 transition count 270
Iterating global reduction 1 with 6 rules applied. Total rules applied 220 place count 230 transition count 270
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 225 place count 225 transition count 265
Iterating global reduction 1 with 5 rules applied. Total rules applied 230 place count 225 transition count 265
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 235 place count 220 transition count 260
Iterating global reduction 1 with 5 rules applied. Total rules applied 240 place count 220 transition count 260
Applied a total of 240 rules in 111 ms. Remains 220 /352 variables (removed 132) and now considering 260/374 (removed 114) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10295513207961369714.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1009479447826238160.kers'
[2026-05-24 05:51:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10295513207961369714.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1009479447826238160.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 220 cols 693 entries
Finished phase 1 with 218 SingleSign rule and 0 generalized
[2026-05-24 05:51:26] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1009479447826238160.kers
Total runtime 1 ms.
[2026-05-24 05:51:26] [INFO ] Implicit Places using invariants in 244 ms returned []
[2026-05-24 05:51:26] [INFO ] Invariant cache hit.
[2026-05-24 05:51:27] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2026-05-24 05:51:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 260/480 variables, 220/222 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/247 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 0/480 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 247 constraints, problems are : Problem set: 0 solved, 259 unsolved in 18566 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 260/480 variables, 220/247 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 259/506 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 0/480 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 506 constraints, problems are : Problem set: 0 solved, 259 unsolved in 26648 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45348ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 45371ms
Starting structural reductions in LTL mode, iteration 1 : 220/352 places, 260/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45999 ms. Remains : 220/352 places, 260/374 transitions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Applied a total of 0 rules in 4 ms. Remains 220 /220 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2026-05-24 05:52:12] [INFO ] Invariant cache hit.
[2026-05-24 05:52:12] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-24 05:52:12] [INFO ] Invariant cache hit.
[2026-05-24 05:52:12] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 257 ms. Remains : 220/220 places, 260/260 transitions.
Support contains 26 out of 220 places after structural reductions.
[2026-05-24 05:52:12] [INFO ] Flatten gal took : 38 ms
[2026-05-24 05:52:12] [INFO ] Flatten gal took : 15 ms
[2026-05-24 05:52:13] [INFO ] Input system was already deterministic with 260 transitions.
Support contains 24 out of 220 places (down from 26) after GAL structural reductions.
RANDOM walk for 11028 steps (26 resets) in 533 ms. (20 steps per ms) remains 0/21 properties
FORMULA DiscoveryGPU-PT-12b-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 437 edges and 220 vertex of which 218 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 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 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Graph (complete) has 437 edges and 220 vertex of which 218 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 217 transition count 222
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 182 transition count 222
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 71 place count 182 transition count 187
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 141 place count 147 transition count 187
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 147 place count 141 transition count 178
Iterating global reduction 2 with 6 rules applied. Total rules applied 153 place count 141 transition count 178
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 156 place count 138 transition count 175
Iterating global reduction 2 with 3 rules applied. Total rules applied 159 place count 138 transition count 175
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 271 place count 82 transition count 119
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 281 place count 72 transition count 99
Iterating global reduction 2 with 10 rules applied. Total rules applied 291 place count 72 transition count 99
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 301 place count 62 transition count 88
Iterating global reduction 2 with 10 rules applied. Total rules applied 311 place count 62 transition count 88
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 321 place count 52 transition count 69
Iterating global reduction 2 with 10 rules applied. Total rules applied 331 place count 52 transition count 69
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 341 place count 42 transition count 58
Iterating global reduction 2 with 10 rules applied. Total rules applied 351 place count 42 transition count 58
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 361 place count 32 transition count 39
Iterating global reduction 2 with 10 rules applied. Total rules applied 371 place count 32 transition count 39
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 381 place count 22 transition count 28
Iterating global reduction 2 with 10 rules applied. Total rules applied 391 place count 22 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 392 place count 21 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 21 transition count 27
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 394 place count 21 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 396 place count 19 transition count 24
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 21 edges and 17 vertex of which 14 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 403 place count 14 transition count 17
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 408 place count 10 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 412 place count 8 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 413 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 415 place count 6 transition count 11
Applied a total of 415 rules in 56 ms. Remains 6 /220 variables (removed 214) and now considering 11/260 (removed 249) transitions.
[2026-05-24 05:52:13] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2865757846217794346.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1018029178187012897.kers'
[2026-05-24 05:52:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2865757846217794346.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1018029178187012897.kers]
Normalized transition count is 7 out of 8 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 6 cols 11 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-24 05:52:13] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1018029178187012897.kers
Total runtime 3 ms.
[2026-05-24 05:52:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 05:52:13] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2026-05-24 05:52:13] [INFO ] Invariant cache hit.
[2026-05-24 05:52:13] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2026-05-24 05:52:13] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-24 05:52:13] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2026-05-24 05:52:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/13 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/220 places, 11/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 208 ms. Remains : 6/220 places, 11/260 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 209 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 8 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-00 finished in 495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((p1&&X(p1))))))'
Support contains 2 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 208 transition count 245
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 208 transition count 245
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 203 transition count 239
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 203 transition count 239
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 199 transition count 235
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 199 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 198 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 198 transition count 234
Applied a total of 44 rules in 33 ms. Remains 198 /220 variables (removed 22) and now considering 234/260 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10528200526743132911.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6403013461559999074.kers'
[2026-05-24 05:52:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10528200526743132911.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6403013461559999074.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 234 rows 198 cols 632 entries
Finished phase 1 with 196 SingleSign rule and 0 generalized
[2026-05-24 05:52:14] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6403013461559999074.kers
Total runtime 1 ms.
[2026-05-24 05:52:14] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-24 05:52:14] [INFO ] Invariant cache hit.
[2026-05-24 05:52:14] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2026-05-24 05:52:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (OVERLAPS) 234/432 variables, 198/200 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 12/212 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (OVERLAPS) 0/432 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 212 constraints, problems are : Problem set: 0 solved, 233 unsolved in 13834 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/432 variables, 198/212 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 233/445 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/432 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 445 constraints, problems are : Problem set: 0 solved, 233 unsolved in 17013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30889ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 30892ms
Starting structural reductions in LTL mode, iteration 1 : 198/220 places, 234/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31130 ms. Remains : 198/220 places, 234/260 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((p1&&X(p1))))))'
Stuttering acceptance computed with spot in 143 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 938 steps with 2 reset in 17 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-01 finished in 31326 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 220 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Graph (complete) has 437 edges and 220 vertex of which 218 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 217 transition count 222
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 182 transition count 222
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 71 place count 182 transition count 187
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 141 place count 147 transition count 187
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 147 place count 141 transition count 178
Iterating global reduction 2 with 6 rules applied. Total rules applied 153 place count 141 transition count 178
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 156 place count 138 transition count 175
Iterating global reduction 2 with 3 rules applied. Total rules applied 159 place count 138 transition count 175
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 271 place count 82 transition count 119
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 281 place count 72 transition count 99
Iterating global reduction 2 with 10 rules applied. Total rules applied 291 place count 72 transition count 99
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 301 place count 62 transition count 88
Iterating global reduction 2 with 10 rules applied. Total rules applied 311 place count 62 transition count 88
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 321 place count 52 transition count 69
Iterating global reduction 2 with 10 rules applied. Total rules applied 331 place count 52 transition count 69
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 341 place count 42 transition count 58
Iterating global reduction 2 with 10 rules applied. Total rules applied 351 place count 42 transition count 58
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 361 place count 32 transition count 39
Iterating global reduction 2 with 10 rules applied. Total rules applied 371 place count 32 transition count 39
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 381 place count 22 transition count 28
Iterating global reduction 2 with 10 rules applied. Total rules applied 391 place count 22 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 392 place count 21 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 21 transition count 27
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 394 place count 21 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 396 place count 19 transition count 24
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 21 edges and 17 vertex of which 14 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 403 place count 14 transition count 17
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 408 place count 10 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 412 place count 8 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 413 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 415 place count 6 transition count 11
Applied a total of 415 rules in 31 ms. Remains 6 /220 variables (removed 214) and now considering 11/260 (removed 249) transitions.
[2026-05-24 05:52:45] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4357799419029570679.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8581381310355910030.kers'
[2026-05-24 05:52:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4357799419029570679.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8581381310355910030.kers]
Normalized transition count is 7 out of 8 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 6 cols 11 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-24 05:52:45] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8581381310355910030.kers
Total runtime 0 ms.
[2026-05-24 05:52:45] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-24 05:52:45] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2026-05-24 05:52:45] [INFO ] Invariant cache hit.
[2026-05-24 05:52:45] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2026-05-24 05:52:45] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-24 05:52:45] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2026-05-24 05:52:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/13 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 100ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/220 places, 11/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 6/220 places, 11/260 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 31 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-05
Stuttering criterion allowed to conclude after 88 steps with 2 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-05 finished in 223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (!p1||(G(p2) U G(p3))))))'
Support contains 5 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 210 transition count 247
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 210 transition count 247
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 206 transition count 243
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 206 transition count 243
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 203 transition count 240
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 203 transition count 240
Applied a total of 34 rules in 22 ms. Remains 203 /220 variables (removed 17) and now considering 240/260 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10092259168598376249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2359641102014378740.kers'
[2026-05-24 05:52:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10092259168598376249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2359641102014378740.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 240 rows 203 cols 646 entries
Finished phase 1 with 201 SingleSign rule and 0 generalized
[2026-05-24 05:52:45] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2359641102014378740.kers
Total runtime 1 ms.
[2026-05-24 05:52:45] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-24 05:52:45] [INFO ] Invariant cache hit.
[2026-05-24 05:52:45] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2026-05-24 05:52:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 240/443 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 12/217 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 0/443 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 217 constraints, problems are : Problem set: 0 solved, 239 unsolved in 14322 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 240/443 variables, 203/217 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 239/456 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 456 constraints, problems are : Problem set: 0 solved, 239 unsolved in 17996 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32363ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 32364ms
Starting structural reductions in LTL mode, iteration 1 : 203/220 places, 240/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32574 ms. Remains : 203/220 places, 240/260 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (!p1||(G(p2) U G(p3))))))'
Stuttering acceptance computed with spot in 245 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (AND p3 (NOT p2)), (NOT p3), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Graph (complete) has 410 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 38 stabilizing places and 38 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 25 factoid took 21 ms. Proved property starting from automaton with 6 states, 17 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 33 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-07 finished in 33241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||G(p2))))'
Support contains 2 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 207 transition count 243
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 207 transition count 243
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 201 transition count 236
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 201 transition count 236
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 196 transition count 231
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 196 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 195 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 195 transition count 230
Applied a total of 50 rules in 12 ms. Remains 195 /220 variables (removed 25) and now considering 230/260 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9634130174442663889.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2498063763930707348.kers'
[2026-05-24 05:53:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9634130174442663889.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2498063763930707348.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 230 rows 195 cols 622 entries
Finished phase 1 with 193 SingleSign rule and 0 generalized
[2026-05-24 05:53:18] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2498063763930707348.kers
Total runtime 4 ms.
[2026-05-24 05:53:18] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-24 05:53:18] [INFO ] Invariant cache hit.
[2026-05-24 05:53:19] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2026-05-24 05:53:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 230/425 variables, 195/197 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/425 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 209 constraints, problems are : Problem set: 0 solved, 229 unsolved in 13707 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/425 variables, 195/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 229/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 438 constraints, problems are : Problem set: 0 solved, 229 unsolved in 16668 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30408ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 30411ms
Starting structural reductions in LTL mode, iteration 1 : 195/220 places, 230/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30637 ms. Remains : 195/220 places, 230/260 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||G(p2))))'
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-08 finished in 30844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 220 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Graph (complete) has 437 edges and 220 vertex of which 218 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 217 transition count 223
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 183 transition count 223
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 69 place count 183 transition count 189
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 137 place count 149 transition count 189
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 143 place count 143 transition count 179
Iterating global reduction 2 with 6 rules applied. Total rules applied 149 place count 143 transition count 179
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 153 place count 139 transition count 175
Iterating global reduction 2 with 4 rules applied. Total rules applied 157 place count 139 transition count 175
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 267 place count 84 transition count 120
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 276 place count 75 transition count 102
Iterating global reduction 2 with 9 rules applied. Total rules applied 285 place count 75 transition count 102
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 294 place count 66 transition count 93
Iterating global reduction 2 with 9 rules applied. Total rules applied 303 place count 66 transition count 93
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 312 place count 57 transition count 75
Iterating global reduction 2 with 9 rules applied. Total rules applied 321 place count 57 transition count 75
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 330 place count 48 transition count 66
Iterating global reduction 2 with 9 rules applied. Total rules applied 339 place count 48 transition count 66
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 348 place count 39 transition count 48
Iterating global reduction 2 with 9 rules applied. Total rules applied 357 place count 39 transition count 48
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 366 place count 30 transition count 39
Iterating global reduction 2 with 9 rules applied. Total rules applied 375 place count 30 transition count 39
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 2 with 2 rules applied. Total rules applied 377 place count 29 transition count 39
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 378 place count 28 transition count 37
Iterating global reduction 2 with 1 rules applied. Total rules applied 379 place count 28 transition count 37
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 380 place count 27 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 381 place count 27 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 382 place count 26 transition count 34
Iterating global reduction 2 with 1 rules applied. Total rules applied 383 place count 26 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 384 place count 25 transition count 32
Iterating global reduction 2 with 1 rules applied. Total rules applied 385 place count 25 transition count 32
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 386 place count 24 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 387 place count 24 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 388 place count 23 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 389 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 390 place count 22 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 391 place count 22 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 393 place count 20 transition count 26
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 33 edges and 19 vertex of which 18 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 397 place count 18 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 399 place count 16 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 403 place count 14 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 405 place count 12 transition count 19
Applied a total of 405 rules in 31 ms. Remains 12 /220 variables (removed 208) and now considering 19/260 (removed 241) transitions.
[2026-05-24 05:53:49] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11486552326754901829.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6864559692358217170.kers'
[2026-05-24 05:53:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11486552326754901829.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6864559692358217170.kers]
Normalized transition count is 15 out of 16 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 15 rows 11 cols 33 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-24 05:53:49] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6864559692358217170.kers
Total runtime 1 ms.
[2026-05-24 05:53:49] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-24 05:53:49] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2026-05-24 05:53:49] [INFO ] Invariant cache hit.
[2026-05-24 05:53:49] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2026-05-24 05:53:49] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2026-05-24 05:53:49] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2026-05-24 05:53:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/27 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/28 variables, and 13 constraints, problems are : Problem set: 0 solved, 14 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 2/27 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/28 variables, and 27 constraints, problems are : Problem set: 0 solved, 14 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 306ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 307ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/220 places, 19/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 385 ms. Remains : 12/220 places, 19/260 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-09 finished in 445 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((G(p0) U X((G(p1)&&X(X(p2))))))))'
Support contains 3 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 208 transition count 244
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 208 transition count 244
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 202 transition count 237
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 202 transition count 237
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 197 transition count 232
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 197 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 196 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 196 transition count 231
Applied a total of 48 rules in 14 ms. Remains 196 /220 variables (removed 24) and now considering 231/260 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4174582784224019228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1300441660539440470.kers'
[2026-05-24 05:53:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4174582784224019228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1300441660539440470.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 231 rows 196 cols 624 entries
Finished phase 1 with 194 SingleSign rule and 0 generalized
[2026-05-24 05:53:50] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1300441660539440470.kers
Total runtime 2 ms.
[2026-05-24 05:53:50] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-24 05:53:50] [INFO ] Invariant cache hit.
[2026-05-24 05:53:50] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2026-05-24 05:53:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 231/427 variables, 196/198 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 12/210 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 0/427 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 210 constraints, problems are : Problem set: 0 solved, 230 unsolved in 13670 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 231/427 variables, 196/210 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 230/440 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 0/427 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 440 constraints, problems are : Problem set: 0 solved, 230 unsolved in 17049 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30745ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 30746ms
Starting structural reductions in LTL mode, iteration 1 : 196/220 places, 231/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30937 ms. Remains : 196/220 places, 231/260 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((G(p0) U X((G(p1)&&X(X(p2))))))))'
Stuttering acceptance computed with spot in 887 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p2), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0) p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 225 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-10 finished in 31920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 2 out of 220 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Graph (complete) has 437 edges and 220 vertex of which 218 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 217 transition count 223
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 183 transition count 223
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 69 place count 183 transition count 188
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 139 place count 148 transition count 188
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 146 place count 141 transition count 177
Iterating global reduction 2 with 7 rules applied. Total rules applied 153 place count 141 transition count 177
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 157 place count 137 transition count 173
Iterating global reduction 2 with 4 rules applied. Total rules applied 161 place count 137 transition count 173
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 269 place count 83 transition count 119
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 279 place count 73 transition count 99
Iterating global reduction 2 with 10 rules applied. Total rules applied 289 place count 73 transition count 99
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 298 place count 64 transition count 90
Iterating global reduction 2 with 9 rules applied. Total rules applied 307 place count 64 transition count 90
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 316 place count 55 transition count 72
Iterating global reduction 2 with 9 rules applied. Total rules applied 325 place count 55 transition count 72
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 334 place count 46 transition count 63
Iterating global reduction 2 with 9 rules applied. Total rules applied 343 place count 46 transition count 63
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 352 place count 37 transition count 45
Iterating global reduction 2 with 9 rules applied. Total rules applied 361 place count 37 transition count 45
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 370 place count 28 transition count 36
Iterating global reduction 2 with 9 rules applied. Total rules applied 379 place count 28 transition count 36
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 380 place count 28 transition count 35
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 381 place count 28 transition count 35
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 383 place count 26 transition count 33
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 29 edges and 24 vertex of which 21 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 392 place count 21 transition count 24
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 398 place count 15 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 404 place count 12 transition count 21
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 406 place count 11 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 407 place count 11 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 408 place count 11 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 411 place count 8 transition count 16
Applied a total of 411 rules in 28 ms. Remains 8 /220 variables (removed 212) and now considering 16/260 (removed 244) transitions.
[2026-05-24 05:54:22] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2534430022689762914.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10239066237076683514.kers'
[2026-05-24 05:54:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2534430022689762914.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10239066237076683514.kers]
Normalized transition count is 12 out of 13 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 8 cols 19 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-24 05:54:22] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10239066237076683514.kers
Total runtime 0 ms.
[2026-05-24 05:54:22] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-24 05:54:22] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2026-05-24 05:54:22] [INFO ] Invariant cache hit.
[2026-05-24 05:54:22] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2026-05-24 05:54:22] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-24 05:54:22] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2026-05-24 05:54:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 5/20 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/21 variables, and 8 constraints, problems are : Problem set: 0 solved, 8 unsolved in 61 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 5/20 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/21 variables, and 16 constraints, problems are : Problem set: 0 solved, 8 unsolved in 71 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 134ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 134ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/220 places, 16/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 216 ms. Remains : 8/220 places, 16/260 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-11 finished in 330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U X(X(p1)))&&X(F(p2)))))'
Support contains 5 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 211 transition count 247
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 211 transition count 247
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 205 transition count 240
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 205 transition count 240
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 200 transition count 235
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 200 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 199 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 199 transition count 234
Applied a total of 42 rules in 17 ms. Remains 199 /220 variables (removed 21) and now considering 234/260 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14679168194048444449.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9125342218666319530.kers'
[2026-05-24 05:54:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14679168194048444449.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9125342218666319530.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 234 rows 199 cols 629 entries
Finished phase 1 with 197 SingleSign rule and 0 generalized
[2026-05-24 05:54:22] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9125342218666319530.kers
Total runtime 2 ms.
[2026-05-24 05:54:22] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-24 05:54:22] [INFO ] Invariant cache hit.
[2026-05-24 05:54:22] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2026-05-24 05:54:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (OVERLAPS) 234/433 variables, 199/201 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 5/226 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/433 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 226 constraints, problems are : Problem set: 0 solved, 233 unsolved in 14961 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/433 variables, 199/226 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 233/459 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 0/433 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 460 constraints, problems are : Problem set: 0 solved, 233 unsolved in 24382 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39371ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 39373ms
Starting structural reductions in LTL mode, iteration 1 : 199/220 places, 234/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39594 ms. Remains : 199/220 places, 234/260 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U X(X(p1)))&&X(F(p2)))))'
Stuttering acceptance computed with spot in 376 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-13
Stuttering criterion allowed to conclude after 563 steps with 1 reset in 5 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-13 finished in 40025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 207 transition count 243
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 207 transition count 243
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 201 transition count 236
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 201 transition count 236
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 196 transition count 231
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 196 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 195 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 195 transition count 230
Applied a total of 50 rules in 12 ms. Remains 195 /220 variables (removed 25) and now considering 230/260 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13005917994334692514.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13353911380089572587.kers'
[2026-05-24 05:55:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13005917994334692514.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13353911380089572587.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 230 rows 195 cols 622 entries
Finished phase 1 with 193 SingleSign rule and 0 generalized
[2026-05-24 05:55:02] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13353911380089572587.kers
Total runtime 2 ms.
[2026-05-24 05:55:02] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-24 05:55:02] [INFO ] Invariant cache hit.
[2026-05-24 05:55:02] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2026-05-24 05:55:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 230/425 variables, 195/197 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/425 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 209 constraints, problems are : Problem set: 0 solved, 229 unsolved in 13387 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/425 variables, 195/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 229/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 438 constraints, problems are : Problem set: 0 solved, 229 unsolved in 16876 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30286ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 30286ms
Starting structural reductions in LTL mode, iteration 1 : 195/220 places, 230/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30481 ms. Remains : 195/220 places, 230/260 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-14 finished in 30704 ms.
All properties solved by simple procedures.
Total runtime 246868 ms.

BK_STOP 1779602133137

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

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-12b.tgz
mv DiscoveryGPU-PT-12b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;