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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 9.0K Mar 6 16:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 6 16:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 6 16:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 6 16:25 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 4.0K Mar 15 09:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 09:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 16:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 6 16:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Mar 6 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 6 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:16 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 111K 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-15b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-15b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-15b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-15b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-15b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-15b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-15b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-15b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-15b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-15b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-15b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-15b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-15b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-15b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-15b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-15b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779606304292

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-15b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 07:05:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 07:05:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 07:05:05] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2026-05-24 07:05:05] [INFO ] Transformed 436 places.
[2026-05-24 07:05:05] [INFO ] Transformed 464 transitions.
[2026-05-24 07:05:05] [INFO ] Found NUPN structural information;
[2026-05-24 07:05:05] [INFO ] Parsed PT model containing 436 places and 464 transitions and 1214 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-15b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 464/464 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 408 transition count 464
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 96 place count 340 transition count 396
Iterating global reduction 1 with 68 rules applied. Total rules applied 164 place count 340 transition count 396
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 177 place count 327 transition count 383
Iterating global reduction 1 with 13 rules applied. Total rules applied 190 place count 327 transition count 383
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 200 place count 317 transition count 373
Iterating global reduction 1 with 10 rules applied. Total rules applied 210 place count 317 transition count 373
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 219 place count 308 transition count 364
Iterating global reduction 1 with 9 rules applied. Total rules applied 228 place count 308 transition count 364
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 236 place count 300 transition count 348
Iterating global reduction 1 with 8 rules applied. Total rules applied 244 place count 300 transition count 348
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 252 place count 292 transition count 340
Iterating global reduction 1 with 8 rules applied. Total rules applied 260 place count 292 transition count 340
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 268 place count 284 transition count 332
Iterating global reduction 1 with 8 rules applied. Total rules applied 276 place count 284 transition count 332
Applied a total of 276 rules in 131 ms. Remains 284 /436 variables (removed 152) and now considering 332/464 (removed 132) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2225087435082255363.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7464924849940248910.kers'
[2026-05-24 07:05:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2225087435082255363.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7464924849940248910.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 332 rows 284 cols 891 entries
Finished phase 1 with 282 SingleSign rule and 0 generalized
[2026-05-24 07:05:06] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7464924849940248910.kers
Total runtime 2 ms.
[2026-05-24 07:05:06] [INFO ] Implicit Places using invariants in 292 ms returned []
[2026-05-24 07:05:06] [INFO ] Invariant cache hit.
[2026-05-24 07:05:06] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Running 331 sub problems to find dead transitions.
[2026-05-24 07:05:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/282 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (OVERLAPS) 332/614 variables, 282/284 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 15/299 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (OVERLAPS) 2/616 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/616 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 616/616 variables, and 301 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/282 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (OVERLAPS) 332/614 variables, 282/299 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 329/628 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (OVERLAPS) 2/616 variables, 2/630 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/616 variables, 2/632 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 616/616 variables, and 632 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 60194ms
Starting structural reductions in LTL mode, iteration 1 : 284/436 places, 332/464 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60943 ms. Remains : 284/436 places, 332/464 transitions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 332/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 284 /284 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2026-05-24 07:06:06] [INFO ] Invariant cache hit.
[2026-05-24 07:06:06] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-24 07:06:06] [INFO ] Invariant cache hit.
[2026-05-24 07:06:07] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 284/284 places, 332/332 transitions.
Support contains 32 out of 284 places after structural reductions.
[2026-05-24 07:06:07] [INFO ] Flatten gal took : 44 ms
[2026-05-24 07:06:07] [INFO ] Flatten gal took : 19 ms
[2026-05-24 07:06:07] [INFO ] Input system was already deterministic with 332 transitions.
RANDOM walk for 16196 steps (31 resets) in 464 ms. (34 steps per ms) remains 0/19 properties
Computed a total of 51 stabilizing places and 51 stable transitions
Graph (complete) has 561 edges and 284 vertex of which 277 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.12 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 332/332 transitions.
Graph (complete) has 561 edges and 284 vertex of which 277 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 276 transition count 283
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 233 transition count 283
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 87 place count 233 transition count 238
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 177 place count 188 transition count 238
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 184 place count 181 transition count 230
Iterating global reduction 2 with 7 rules applied. Total rules applied 191 place count 181 transition count 230
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 191 place count 181 transition count 229
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 193 place count 180 transition count 229
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 198 place count 175 transition count 223
Iterating global reduction 2 with 5 rules applied. Total rules applied 203 place count 175 transition count 223
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 206 place count 172 transition count 219
Iterating global reduction 2 with 3 rules applied. Total rules applied 209 place count 172 transition count 219
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 211 place count 170 transition count 216
Iterating global reduction 2 with 2 rules applied. Total rules applied 213 place count 170 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 214 place count 169 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 215 place count 169 transition count 215
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 349 place count 102 transition count 148
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 363 place count 88 transition count 121
Iterating global reduction 2 with 14 rules applied. Total rules applied 377 place count 88 transition count 121
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 390 place count 75 transition count 106
Iterating global reduction 2 with 13 rules applied. Total rules applied 403 place count 75 transition count 106
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 416 place count 62 transition count 81
Iterating global reduction 2 with 13 rules applied. Total rules applied 429 place count 62 transition count 81
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 442 place count 49 transition count 67
Iterating global reduction 2 with 13 rules applied. Total rules applied 455 place count 49 transition count 67
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 468 place count 36 transition count 42
Iterating global reduction 2 with 13 rules applied. Total rules applied 481 place count 36 transition count 42
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 493 place count 24 transition count 29
Iterating global reduction 2 with 12 rules applied. Total rules applied 505 place count 24 transition count 29
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 507 place count 22 transition count 26
Iterating global reduction 2 with 2 rules applied. Total rules applied 509 place count 22 transition count 26
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 510 place count 21 transition count 25
Iterating global reduction 2 with 1 rules applied. Total rules applied 511 place count 21 transition count 25
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 512 place count 21 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 514 place count 19 transition count 22
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 19 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 520 place count 14 transition count 16
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 523 place count 11 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 527 place count 9 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 528 place count 9 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 530 place count 7 transition count 11
Applied a total of 530 rules in 84 ms. Remains 7 /284 variables (removed 277) and now considering 11/332 (removed 321) transitions.
[2026-05-24 07:06:07] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1666337758651015815.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14986866902306506146.kers'
[2026-05-24 07:06:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1666337758651015815.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14986866902306506146.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 7 cols 14 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 07:06:07] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14986866902306506146.kers
Total runtime 0 ms.
[2026-05-24 07:06:07] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-24 07:06:07] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2026-05-24 07:06:07] [INFO ] Invariant cache hit.
[2026-05-24 07:06:07] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2026-05-24 07:06:07] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-24 07:06:07] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2026-05-24 07:06:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/15 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 5 unsolved in 46 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 4/15 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 12 constraints, problems are : Problem set: 0 solved, 5 unsolved in 46 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 95ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/284 places, 11/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 222 ms. Remains : 7/284 places, 11/332 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 194 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLCardinality-00 finished in 483 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) U X(X((G(F(p2))||p1)))))'
Support contains 6 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 332/332 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 332
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 269 transition count 319
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 269 transition count 319
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 263 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 263 transition count 312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 258 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 258 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 55 place count 253 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 253 transition count 300
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 249 transition count 294
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 249 transition count 294
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 246 transition count 291
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 246 transition count 291
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 76 place count 244 transition count 289
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 244 transition count 289
Applied a total of 78 rules in 37 ms. Remains 244 /284 variables (removed 40) and now considering 289/332 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8712229149559710524.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4181866460702266090.kers'
[2026-05-24 07:06:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8712229149559710524.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4181866460702266090.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 289 rows 244 cols 781 entries
Finished phase 1 with 242 SingleSign rule and 0 generalized
[2026-05-24 07:06:08] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4181866460702266090.kers
Total runtime 1 ms.
[2026-05-24 07:06:08] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-24 07:06:08] [INFO ] Invariant cache hit.
[2026-05-24 07:06:08] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2026-05-24 07:06:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/244 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 289/533 variables, 244/246 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 15/261 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (OVERLAPS) 0/533 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 533/533 variables, and 261 constraints, problems are : Problem set: 0 solved, 288 unsolved in 21334 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/244 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 289/533 variables, 244/261 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 288/549 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 0/533 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Int declared 533/533 variables, and 549 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51441ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 51444ms
Starting structural reductions in LTL mode, iteration 1 : 244/284 places, 289/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51727 ms. Remains : 244/284 places, 289/332 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) U X(X((G(F(p2))||p1)))))'
Stuttering acceptance computed with spot in 466 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 230 ms.
Product exploration explored 100000 steps with 33333 reset in 132 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Graph (complete) has 496 edges and 244 vertex of which 243 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge based reduction with 8 factoid took 51 ms. Proved property starting from automaton with 11 states, 18 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 69 ms.
FORMULA DiscoveryGPU-PT-15b-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-15b-LTLCardinality-01 finished in 52671 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(F(p0)))'
Support contains 2 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 332/332 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 332
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 269 transition count 318
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 269 transition count 318
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 263 transition count 311
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 263 transition count 311
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 258 transition count 305
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 258 transition count 305
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 254 transition count 300
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 254 transition count 300
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 251 transition count 296
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 251 transition count 296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 249 transition count 294
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 249 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 248 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 248 transition count 293
Applied a total of 70 rules in 35 ms. Remains 248 /284 variables (removed 36) and now considering 293/332 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4743467511622207641.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15963588790582029558.kers'
[2026-05-24 07:07:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4743467511622207641.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15963588790582029558.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 293 rows 248 cols 791 entries
Finished phase 1 with 246 SingleSign rule and 0 generalized
[2026-05-24 07:07:00] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15963588790582029558.kers
Total runtime 4 ms.
[2026-05-24 07:07:01] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-24 07:07:01] [INFO ] Invariant cache hit.
[2026-05-24 07:07:01] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2026-05-24 07:07:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/248 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 293/541 variables, 248/250 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 15/265 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (OVERLAPS) 0/541 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 265 constraints, problems are : Problem set: 0 solved, 292 unsolved in 21753 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/248 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 293/541 variables, 248/265 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 292/557 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 0/541 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 557 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51814ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 51817ms
Starting structural reductions in LTL mode, iteration 1 : 248/284 places, 293/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52113 ms. Remains : 248/284 places, 293/332 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(F(p0)))'
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 502 edges and 248 vertex of which 245 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 47 stabilizing places and 47 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 19 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 24 ms.
FORMULA DiscoveryGPU-PT-15b-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-15b-LTLCardinality-02 finished in 52439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G(p0)))'
Support contains 2 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 332/332 transitions.
Graph (complete) has 561 edges and 284 vertex of which 277 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 276 transition count 282
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 89 place count 232 transition count 282
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 89 place count 232 transition count 237
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 179 place count 187 transition count 237
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 186 place count 180 transition count 229
Iterating global reduction 2 with 7 rules applied. Total rules applied 193 place count 180 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 193 place count 180 transition count 228
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 179 transition count 228
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 199 place count 175 transition count 223
Iterating global reduction 2 with 4 rules applied. Total rules applied 203 place count 175 transition count 223
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 205 place count 173 transition count 220
Iterating global reduction 2 with 2 rules applied. Total rules applied 207 place count 173 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 208 place count 172 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 209 place count 172 transition count 219
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 345 place count 104 transition count 151
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 357 place count 92 transition count 128
Iterating global reduction 2 with 12 rules applied. Total rules applied 369 place count 92 transition count 128
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 381 place count 80 transition count 114
Iterating global reduction 2 with 12 rules applied. Total rules applied 393 place count 80 transition count 114
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 405 place count 68 transition count 91
Iterating global reduction 2 with 12 rules applied. Total rules applied 417 place count 68 transition count 91
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 429 place count 56 transition count 78
Iterating global reduction 2 with 12 rules applied. Total rules applied 441 place count 56 transition count 78
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 453 place count 44 transition count 55
Iterating global reduction 2 with 12 rules applied. Total rules applied 465 place count 44 transition count 55
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 477 place count 32 transition count 42
Iterating global reduction 2 with 12 rules applied. Total rules applied 489 place count 32 transition count 42
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 491 place count 30 transition count 39
Iterating global reduction 2 with 2 rules applied. Total rules applied 493 place count 30 transition count 39
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 494 place count 29 transition count 38
Iterating global reduction 2 with 1 rules applied. Total rules applied 495 place count 29 transition count 38
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 496 place count 29 transition count 37
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 498 place count 27 transition count 35
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 31 edges and 25 vertex of which 22 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 507 place count 22 transition count 26
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 513 place count 16 transition count 26
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 521 place count 12 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 523 place count 12 transition count 20
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 526 place count 9 transition count 17
Applied a total of 526 rules in 49 ms. Remains 9 /284 variables (removed 275) and now considering 17/332 (removed 315) transitions.
[2026-05-24 07:07:53] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17359601709750866391.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13642972098682833336.kers'
[2026-05-24 07:07:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17359601709750866391.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13642972098682833336.kers]
Normalized transition count is 12 out of 13 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 9 cols 19 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-24 07:07:53] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13642972098682833336.kers
Total runtime 2 ms.
[2026-05-24 07:07:53] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-24 07:07:53] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2026-05-24 07:07:53] [INFO ] Invariant cache hit.
[2026-05-24 07:07:53] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2026-05-24 07:07:53] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-24 07:07:53] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2026-05-24 07:07:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/21 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/22 variables, and 9 constraints, problems are : Problem set: 0 solved, 10 unsolved in 68 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 4/21 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/22 variables, and 19 constraints, problems are : Problem set: 0 solved, 10 unsolved in 86 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 156ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/284 places, 17/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259 ms. Remains : 9/284 places, 17/332 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G(p0)))'
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 310 steps with 6 reset in 2 ms.
FORMULA DiscoveryGPU-PT-15b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLCardinality-03 finished in 358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U ((X(X(p0))&&(X(p1)||G((X(!p3)||p2))))||X(X(G(p0))))))'
Support contains 7 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 332/332 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 283 transition count 332
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 271 transition count 319
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 271 transition count 319
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 265 transition count 313
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 265 transition count 313
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 261 transition count 309
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 261 transition count 309
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 259 transition count 307
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 259 transition count 307
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 257 transition count 303
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 257 transition count 303
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 255 transition count 301
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 255 transition count 301
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 253 transition count 299
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 253 transition count 299
Applied a total of 61 rules in 27 ms. Remains 253 /284 variables (removed 31) and now considering 299/332 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4349131922107873569.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7028056908557909653.kers'
[2026-05-24 07:07:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4349131922107873569.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7028056908557909653.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 299 rows 253 cols 807 entries
Finished phase 1 with 251 SingleSign rule and 0 generalized
[2026-05-24 07:07:53] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7028056908557909653.kers
Total runtime 1 ms.
[2026-05-24 07:07:53] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-24 07:07:53] [INFO ] Invariant cache hit.
[2026-05-24 07:07:53] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 298 sub problems to find dead transitions.
[2026-05-24 07:07:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (OVERLAPS) 299/551 variables, 252/254 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 15/269 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (OVERLAPS) 1/552 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (OVERLAPS) 0/552 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 270 constraints, problems are : Problem set: 0 solved, 298 unsolved in 27882 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 299/551 variables, 252/269 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 297/566 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 1/552 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 568 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57949ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 57951ms
Starting structural reductions in LTL mode, iteration 1 : 253/284 places, 299/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58206 ms. Remains : 253/284 places, 299/332 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U (X(X(G(p0)))||(X(X(p0))&&(X(p1)||G((X(!p3)||p2)))))))'
Stuttering acceptance computed with spot in 448 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3 (NOT p2)), (AND (NOT p0) p3), (AND p3 (NOT p2) (NOT p0)), true, (AND (NOT p0) p3), (AND (NOT p2) (NOT p0) p3), p3, (AND (NOT p2) p3)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLCardinality-05
Product exploration explored 100000 steps with 40050 reset in 111 ms.
Product exploration explored 100000 steps with 40020 reset in 110 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 511 edges and 253 vertex of which 250 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 47 stabilizing places and 47 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 29 factoid took 18 ms. Proved property starting from automaton with 12 states, 26 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 22 ms.
FORMULA DiscoveryGPU-PT-15b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-15b-LTLCardinality-05 finished in 58947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 1 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 332/332 transitions.
Graph (complete) has 561 edges and 284 vertex of which 277 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 276 transition count 283
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 233 transition count 283
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 87 place count 233 transition count 238
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 177 place count 188 transition count 238
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 184 place count 181 transition count 230
Iterating global reduction 2 with 7 rules applied. Total rules applied 191 place count 181 transition count 230
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 191 place count 181 transition count 229
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 193 place count 180 transition count 229
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 198 place count 175 transition count 223
Iterating global reduction 2 with 5 rules applied. Total rules applied 203 place count 175 transition count 223
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 206 place count 172 transition count 219
Iterating global reduction 2 with 3 rules applied. Total rules applied 209 place count 172 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 210 place count 171 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 171 transition count 218
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 347 place count 103 transition count 150
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 360 place count 90 transition count 125
Iterating global reduction 2 with 13 rules applied. Total rules applied 373 place count 90 transition count 125
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 386 place count 77 transition count 110
Iterating global reduction 2 with 13 rules applied. Total rules applied 399 place count 77 transition count 110
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 412 place count 64 transition count 85
Iterating global reduction 2 with 13 rules applied. Total rules applied 425 place count 64 transition count 85
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 438 place count 51 transition count 71
Iterating global reduction 2 with 13 rules applied. Total rules applied 451 place count 51 transition count 71
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 464 place count 38 transition count 46
Iterating global reduction 2 with 13 rules applied. Total rules applied 477 place count 38 transition count 46
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 490 place count 25 transition count 32
Iterating global reduction 2 with 13 rules applied. Total rules applied 503 place count 25 transition count 32
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 505 place count 23 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 507 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 508 place count 22 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 509 place count 22 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 510 place count 22 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 511 place count 22 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 513 place count 20 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 22 edges and 18 vertex of which 15 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 520 place count 15 transition count 18
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 524 place count 11 transition count 18
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 530 place count 8 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 532 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 534 place count 6 transition count 11
Applied a total of 534 rules in 42 ms. Remains 6 /284 variables (removed 278) and now considering 11/332 (removed 321) transitions.
[2026-05-24 07:08:52] [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-11703800880977487520.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13782476497068930911.kers'
[2026-05-24 07:08:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11703800880977487520.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13782476497068930911.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 07:08:52] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13782476497068930911.kers
Total runtime 0 ms.
[2026-05-24 07:08:52] [INFO ] Implicit Places using invariants in 15 ms returned []
[2026-05-24 07:08:52] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2026-05-24 07:08:52] [INFO ] Invariant cache hit.
[2026-05-24 07:08:52] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2026-05-24 07:08:52] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-24 07:08:52] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2026-05-24 07:08:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 7 unsolved in 66 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/13 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 48 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 117ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/284 places, 11/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 6/284 places, 11/332 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLCardinality-06
Stuttering criterion allowed to conclude after 182 steps with 3 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLCardinality-06 finished in 291 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 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 332/332 transitions.
Graph (complete) has 561 edges and 284 vertex of which 279 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 278 transition count 283
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 89 place count 234 transition count 283
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 89 place count 234 transition count 238
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 179 place count 189 transition count 238
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 185 place count 183 transition count 231
Iterating global reduction 2 with 6 rules applied. Total rules applied 191 place count 183 transition count 231
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 191 place count 183 transition count 230
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 193 place count 182 transition count 230
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 197 place count 178 transition count 225
Iterating global reduction 2 with 4 rules applied. Total rules applied 201 place count 178 transition count 225
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 203 place count 176 transition count 223
Iterating global reduction 2 with 2 rules applied. Total rules applied 205 place count 176 transition count 223
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 206 place count 175 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 207 place count 175 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 208 place count 174 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 209 place count 174 transition count 220
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 347 place count 105 transition count 151
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 360 place count 92 transition count 126
Iterating global reduction 2 with 13 rules applied. Total rules applied 373 place count 92 transition count 126
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 386 place count 79 transition count 111
Iterating global reduction 2 with 13 rules applied. Total rules applied 399 place count 79 transition count 111
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 412 place count 66 transition count 86
Iterating global reduction 2 with 13 rules applied. Total rules applied 425 place count 66 transition count 86
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 438 place count 53 transition count 72
Iterating global reduction 2 with 13 rules applied. Total rules applied 451 place count 53 transition count 72
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 464 place count 40 transition count 47
Iterating global reduction 2 with 13 rules applied. Total rules applied 477 place count 40 transition count 47
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 490 place count 27 transition count 33
Iterating global reduction 2 with 13 rules applied. Total rules applied 503 place count 27 transition count 33
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 505 place count 25 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 507 place count 25 transition count 30
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 508 place count 24 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 509 place count 24 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 511 place count 24 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 513 place count 22 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 22 edges and 20 vertex of which 17 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 10 rules applied. Total rules applied 523 place count 17 transition count 15
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 530 place count 10 transition count 15
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 534 place count 8 transition count 13
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 535 place count 8 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 537 place count 6 transition count 10
Applied a total of 537 rules in 48 ms. Remains 6 /284 variables (removed 278) and now considering 10/332 (removed 322) transitions.
[2026-05-24 07:08:52] [INFO ] Flow matrix only has 7 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-10160344146855456244.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12993125043869240562.kers'
[2026-05-24 07:08:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10160344146855456244.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12993125043869240562.kers]
Normalized transition count is 6 out of 7 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 6 cols 10 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-24 07:08:52] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12993125043869240562.kers
Total runtime 0 ms.
[2026-05-24 07:08:52] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-24 07:08:52] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2026-05-24 07:08:52] [INFO ] Invariant cache hit.
[2026-05-24 07:08:53] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2026-05-24 07:08:53] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-24 07:08:53] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2026-05-24 07:08:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/12 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 6 constraints, problems are : Problem set: 0 solved, 5 unsolved in 36 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 4/12 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 41 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 79ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 79ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/284 places, 10/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 6/284 places, 10/332 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 28 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLCardinality-07 finished in 222 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(G(p0))||(X(p2)&&p1))))'
Support contains 5 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 332/332 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 332
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 268 transition count 317
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 268 transition count 317
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 262 transition count 310
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 262 transition count 310
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 257 transition count 305
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 257 transition count 305
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 253 transition count 300
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 253 transition count 300
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 250 transition count 295
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 250 transition count 295
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 247 transition count 292
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 247 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 245 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 245 transition count 290
Applied a total of 76 rules in 23 ms. Remains 245 /284 variables (removed 39) and now considering 290/332 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15566407270806381095.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18164070225208060621.kers'
[2026-05-24 07:08:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15566407270806381095.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18164070225208060621.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 245 cols 785 entries
Finished phase 1 with 243 SingleSign rule and 0 generalized
[2026-05-24 07:08:53] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18164070225208060621.kers
Total runtime 4 ms.
[2026-05-24 07:08:53] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-24 07:08:53] [INFO ] Invariant cache hit.
[2026-05-24 07:08:53] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2026-05-24 07:08:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 290/535 variables, 245/247 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 15/262 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 0/535 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 262 constraints, problems are : Problem set: 0 solved, 289 unsolved in 22235 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 290/535 variables, 245/262 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 289/551 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 0/535 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 551 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52280ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 52280ms
Starting structural reductions in LTL mode, iteration 1 : 245/284 places, 290/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52532 ms. Remains : 245/284 places, 290/332 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(G(p0))||(X(p2)&&p1))))'
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLCardinality-08 finished in 52735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 332/332 transitions.
Graph (complete) has 561 edges and 284 vertex of which 277 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 276 transition count 284
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 234 transition count 284
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 85 place count 234 transition count 239
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 175 place count 189 transition count 239
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 181 place count 183 transition count 232
Iterating global reduction 2 with 6 rules applied. Total rules applied 187 place count 183 transition count 232
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 192 place count 178 transition count 226
Iterating global reduction 2 with 5 rules applied. Total rules applied 197 place count 178 transition count 226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 200 place count 175 transition count 222
Iterating global reduction 2 with 3 rules applied. Total rules applied 203 place count 175 transition count 222
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 205 place count 173 transition count 219
Iterating global reduction 2 with 2 rules applied. Total rules applied 207 place count 173 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 208 place count 172 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 209 place count 172 transition count 218
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 347 place count 103 transition count 149
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 360 place count 90 transition count 124
Iterating global reduction 2 with 13 rules applied. Total rules applied 373 place count 90 transition count 124
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 386 place count 77 transition count 109
Iterating global reduction 2 with 13 rules applied. Total rules applied 399 place count 77 transition count 109
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 412 place count 64 transition count 84
Iterating global reduction 2 with 13 rules applied. Total rules applied 425 place count 64 transition count 84
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 438 place count 51 transition count 70
Iterating global reduction 2 with 13 rules applied. Total rules applied 451 place count 51 transition count 70
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 464 place count 38 transition count 45
Iterating global reduction 2 with 13 rules applied. Total rules applied 477 place count 38 transition count 45
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 490 place count 25 transition count 31
Iterating global reduction 2 with 13 rules applied. Total rules applied 503 place count 25 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 505 place count 23 transition count 28
Iterating global reduction 2 with 2 rules applied. Total rules applied 507 place count 23 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 508 place count 22 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 509 place count 22 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 510 place count 22 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 512 place count 20 transition count 24
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 514 place count 19 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 515 place count 18 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 515 place count 18 transition count 20
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 521 place count 15 transition count 20
Applied a total of 521 rules in 30 ms. Remains 15 /284 variables (removed 269) and now considering 20/332 (removed 312) transitions.
[2026-05-24 07:09:45] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4806638340209908598.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6738674377373311986.kers'
[2026-05-24 07:09:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4806638340209908598.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6738674377373311986.kers]
Normalized transition count is 17 out of 18 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 17 rows 15 cols 31 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-24 07:09:45] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6738674377373311986.kers
Total runtime 0 ms.
[2026-05-24 07:09:45] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-24 07:09:45] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2026-05-24 07:09:45] [INFO ] Invariant cache hit.
[2026-05-24 07:09:45] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-24 07:09:45] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2026-05-24 07:09:45] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2026-05-24 07:09:45] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2026-05-24 07:09:45] [INFO ] Invariant cache hit.
[2026-05-24 07:09:45] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 17/32 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 1/33 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/33 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 31 constraints, problems are : Problem set: 0 solved, 19 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 17/32 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/33 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/33 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 50 constraints, problems are : Problem set: 0 solved, 19 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 438ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 438ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/284 places, 20/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 517 ms. Remains : 15/284 places, 20/332 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 46 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLCardinality-09
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLCardinality-09 finished in 584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)&&F(!p0)))'
Support contains 4 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 332/332 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 332
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 270 transition count 319
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 270 transition count 319
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 264 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 264 transition count 312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 259 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 259 transition count 306
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 255 transition count 302
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 255 transition count 302
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 252 transition count 297
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 252 transition count 297
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 250 transition count 295
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 250 transition count 295
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 248 transition count 293
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 248 transition count 293
Applied a total of 70 rules in 31 ms. Remains 248 /284 variables (removed 36) and now considering 293/332 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9444512090917043376.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2110912002819240271.kers'
[2026-05-24 07:09:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9444512090917043376.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2110912002819240271.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 293 rows 248 cols 793 entries
Finished phase 1 with 246 SingleSign rule and 0 generalized
[2026-05-24 07:09:46] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2110912002819240271.kers
Total runtime 5 ms.
[2026-05-24 07:09:46] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-24 07:09:46] [INFO ] Invariant cache hit.
[2026-05-24 07:09:46] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2026-05-24 07:09:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/248 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 293/541 variables, 248/250 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 15/265 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (OVERLAPS) 0/541 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 265 constraints, problems are : Problem set: 0 solved, 292 unsolved in 22155 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/248 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 293/541 variables, 248/265 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 292/557 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 0/541 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 557 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52208ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 52209ms
Starting structural reductions in LTL mode, iteration 1 : 248/284 places, 293/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52465 ms. Remains : 248/284 places, 293/332 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)&&F(!p0)))'
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p1), p0, true]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLCardinality-15
Stuttering criterion allowed to conclude after 30903 steps with 402 reset in 63 ms.
FORMULA DiscoveryGPU-PT-15b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLCardinality-15 finished in 52723 ms.
All properties solved by simple procedures.
Total runtime 333712 ms.

BK_STOP 1779606639219

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-15b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-15b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-tall-177955695500387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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