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-177955695500355.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DiscoveryGPU-PT-13b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.6K Mar 6 16:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Mar 6 16:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 6 16:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 6 16:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 09:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 09:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 09:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 6 16:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 6 16:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 6 16:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 6 16:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 97K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779602801413

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-13b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 06:06:42] [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 06:06:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 06:06:42] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2026-05-24 06:06:42] [INFO ] Transformed 380 places.
[2026-05-24 06:06:42] [INFO ] Transformed 404 transitions.
[2026-05-24 06:06:42] [INFO ] Found NUPN structural information;
[2026-05-24 06:06:42] [INFO ] Parsed PT model containing 380 places and 404 transitions and 1056 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 404/404 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 355 transition count 404
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 85 place count 295 transition count 344
Iterating global reduction 1 with 60 rules applied. Total rules applied 145 place count 295 transition count 344
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 158 place count 282 transition count 331
Iterating global reduction 1 with 13 rules applied. Total rules applied 171 place count 282 transition count 331
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 181 place count 272 transition count 321
Iterating global reduction 1 with 10 rules applied. Total rules applied 191 place count 272 transition count 321
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 200 place count 263 transition count 312
Iterating global reduction 1 with 9 rules applied. Total rules applied 209 place count 263 transition count 312
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 217 place count 255 transition count 296
Iterating global reduction 1 with 8 rules applied. Total rules applied 225 place count 255 transition count 296
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 233 place count 247 transition count 288
Iterating global reduction 1 with 8 rules applied. Total rules applied 241 place count 247 transition count 288
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 249 place count 239 transition count 280
Iterating global reduction 1 with 8 rules applied. Total rules applied 257 place count 239 transition count 280
Applied a total of 257 rules in 114 ms. Remains 239 /380 variables (removed 141) and now considering 280/404 (removed 124) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5271040377833333616.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-125449517099925645.kers'
[2026-05-24 06:06:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5271040377833333616.kers, --Pflows, --basisKERS=/tmp/petrispot-output-125449517099925645.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 280 rows 239 cols 751 entries
Finished phase 1 with 237 SingleSign rule and 0 generalized
[2026-05-24 06:06:43] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-125449517099925645.kers
Total runtime 2 ms.
[2026-05-24 06:06:43] [INFO ] Implicit Places using invariants in 283 ms returned []
[2026-05-24 06:06:43] [INFO ] Invariant cache hit.
[2026-05-24 06:06:43] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2026-05-24 06:06:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 280/518 variables, 238/240 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 13/253 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (OVERLAPS) 1/519 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 8 (OVERLAPS) 0/519 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 519/519 variables, and 254 constraints, problems are : Problem set: 0 solved, 279 unsolved in 24962 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 280/518 variables, 238/253 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 278/531 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (OVERLAPS) 1/519 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/519 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/519 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/519 variables, and 533 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55117ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 55129ms
Starting structural reductions in LTL mode, iteration 1 : 239/380 places, 280/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55803 ms. Remains : 239/380 places, 280/404 transitions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 280/280 transitions.
Applied a total of 0 rules in 5 ms. Remains 239 /239 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2026-05-24 06:07:38] [INFO ] Invariant cache hit.
[2026-05-24 06:07:38] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-24 06:07:38] [INFO ] Invariant cache hit.
[2026-05-24 06:07:39] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 239/239 places, 280/280 transitions.
Support contains 21 out of 239 places after structural reductions.
[2026-05-24 06:07:39] [INFO ] Flatten gal took : 42 ms
[2026-05-24 06:07:39] [INFO ] Flatten gal took : 18 ms
[2026-05-24 06:07:39] [INFO ] Input system was already deterministic with 280 transitions.
Support contains 20 out of 239 places (down from 21) after GAL structural reductions.
RANDOM walk for 11445 steps (26 resets) in 322 ms. (35 steps per ms) remains 0/12 properties
Computed a total of 45 stabilizing places and 45 stable transitions
Graph (complete) has 473 edges and 239 vertex of which 234 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.14 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 ((p1 U !p2)||X(!p0))))))'
Support contains 6 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 280/280 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 230 transition count 271
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 230 transition count 271
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 227 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 227 transition count 268
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 224 transition count 264
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 224 transition count 264
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 221 transition count 259
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 221 transition count 259
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 218 transition count 256
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 218 transition count 256
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 216 transition count 254
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 216 transition count 254
Applied a total of 46 rules in 32 ms. Remains 216 /239 variables (removed 23) and now considering 254/280 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1051152173459079917.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7858443030188154632.kers'
[2026-05-24 06:07:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1051152173459079917.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7858443030188154632.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 254 rows 216 cols 685 entries
Finished phase 1 with 214 SingleSign rule and 0 generalized
[2026-05-24 06:07:39] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7858443030188154632.kers
Total runtime 1 ms.
[2026-05-24 06:07:39] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-24 06:07:39] [INFO ] Invariant cache hit.
[2026-05-24 06:07:39] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2026-05-24 06:07:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (OVERLAPS) 254/469 variables, 215/217 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 13/230 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 1/470 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 0/470 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 231 constraints, problems are : Problem set: 0 solved, 253 unsolved in 19983 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 254/469 variables, 215/230 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 252/482 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 1/470 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
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 470/470 variables, and 484 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50062ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 50067ms
Starting structural reductions in LTL mode, iteration 1 : 216/239 places, 254/280 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50322 ms. Remains : 216/239 places, 254/280 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 ((p1 U !p2)||X(!p0))))))'
Stuttering acceptance computed with spot in 439 ms :[p0, (AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2), p2, true, (AND p0 p2)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-01
Product exploration explored 100000 steps with 1340 reset in 316 ms.
Stack based approach found an accepted trace after 202 steps with 3 reset with depth 45 and stack size 45 in 1 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-01 finished in 51159 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&&X(!p0)))))'
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 280/280 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 280
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 227 transition count 268
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 227 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 224 transition count 265
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 224 transition count 265
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 221 transition count 261
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 221 transition count 261
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 219 transition count 258
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 219 transition count 258
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 256
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 216 transition count 255
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 216 transition count 255
Applied a total of 45 rules in 41 ms. Remains 216 /239 variables (removed 23) and now considering 255/280 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8778665912264819378.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15558807655771326250.kers'
[2026-05-24 06:08:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8778665912264819378.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15558807655771326250.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 255 rows 216 cols 691 entries
Finished phase 1 with 214 SingleSign rule and 0 generalized
[2026-05-24 06:08:30] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15558807655771326250.kers
Total runtime 1 ms.
[2026-05-24 06:08:30] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-24 06:08:30] [INFO ] Invariant cache hit.
[2026-05-24 06:08:31] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2026-05-24 06:08:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 255/471 variables, 216/218 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 13/231 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 0/471 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 231 constraints, problems are : Problem set: 0 solved, 254 unsolved in 16557 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 255/471 variables, 216/231 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 254/485 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/471 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 485 constraints, problems are : Problem set: 0 solved, 254 unsolved in 23616 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40226ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 40227ms
Starting structural reductions in LTL mode, iteration 1 : 216/239 places, 255/280 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40473 ms. Remains : 216/239 places, 255/280 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((X(p1)&&p0))))'
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-04
Stuttering criterion allowed to conclude after 361 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-04 finished in 40642 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 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 280/280 transitions.
Graph (complete) has 473 edges and 239 vertex of which 234 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 233 transition count 242
Reduce places removed 33 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 200 transition count 240
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 198 transition count 240
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 71 place count 198 transition count 201
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 149 place count 159 transition count 201
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 152 place count 156 transition count 197
Iterating global reduction 3 with 3 rules applied. Total rules applied 155 place count 156 transition count 197
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 157 place count 154 transition count 195
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 154 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 160 place count 153 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 161 place count 153 transition count 193
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 162 place count 152 transition count 192
Iterating global reduction 3 with 1 rules applied. Total rules applied 163 place count 152 transition count 192
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 285 place count 91 transition count 131
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 296 place count 80 transition count 110
Iterating global reduction 3 with 11 rules applied. Total rules applied 307 place count 80 transition count 110
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 318 place count 69 transition count 98
Iterating global reduction 3 with 11 rules applied. Total rules applied 329 place count 69 transition count 98
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 340 place count 58 transition count 76
Iterating global reduction 3 with 11 rules applied. Total rules applied 351 place count 58 transition count 76
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 362 place count 47 transition count 65
Iterating global reduction 3 with 11 rules applied. Total rules applied 373 place count 47 transition count 65
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 384 place count 36 transition count 43
Iterating global reduction 3 with 11 rules applied. Total rules applied 395 place count 36 transition count 43
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 406 place count 25 transition count 32
Iterating global reduction 3 with 11 rules applied. Total rules applied 417 place count 25 transition count 32
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 418 place count 24 transition count 30
Iterating global reduction 3 with 1 rules applied. Total rules applied 419 place count 24 transition count 30
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 420 place count 23 transition count 29
Iterating global reduction 3 with 1 rules applied. Total rules applied 421 place count 23 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 422 place count 23 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 424 place count 21 transition count 26
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 23 edges and 19 vertex of which 16 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 7 rules applied. Total rules applied 431 place count 16 transition count 19
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 435 place count 12 transition count 19
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 5 with 6 rules applied. Total rules applied 441 place count 9 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 442 place count 9 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 444 place count 7 transition count 13
Applied a total of 444 rules in 72 ms. Remains 7 /239 variables (removed 232) and now considering 13/280 (removed 267) transitions.
[2026-05-24 06:09:11] [INFO ] Flow matrix only has 11 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-13235776650592226126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3027269715885218504.kers'
[2026-05-24 06:09:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13235776650592226126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3027269715885218504.kers]
Normalized transition count is 10 out of 11 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 7 cols 16 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 06:09:11] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3027269715885218504.kers
Total runtime 1 ms.
[2026-05-24 06:09:11] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 06:09:11] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
[2026-05-24 06:09:11] [INFO ] Invariant cache hit.
[2026-05-24 06:09:11] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2026-05-24 06:09:11] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-24 06:09:11] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
[2026-05-24 06:09:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 3/17 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 7 constraints, problems are : Problem set: 0 solved, 8 unsolved in 63 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/17 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 72 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 138ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/239 places, 13/280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 254 ms. Remains : 7/239 places, 13/280 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-05 finished in 346 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)&&X(G(p1)))))'
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 280/280 transitions.
Graph (complete) has 473 edges and 239 vertex of which 234 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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 233 transition count 241
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 199 transition count 241
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 69 place count 199 transition count 201
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 149 place count 159 transition count 201
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 153 place count 155 transition count 196
Iterating global reduction 2 with 4 rules applied. Total rules applied 157 place count 155 transition count 196
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 161 place count 151 transition count 192
Iterating global reduction 2 with 4 rules applied. Total rules applied 165 place count 151 transition count 192
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 168 place count 148 transition count 186
Iterating global reduction 2 with 3 rules applied. Total rules applied 171 place count 148 transition count 186
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 174 place count 145 transition count 183
Iterating global reduction 2 with 3 rules applied. Total rules applied 177 place count 145 transition count 183
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 291 place count 88 transition count 126
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 302 place count 77 transition count 104
Iterating global reduction 2 with 11 rules applied. Total rules applied 313 place count 77 transition count 104
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 324 place count 66 transition count 93
Iterating global reduction 2 with 11 rules applied. Total rules applied 335 place count 66 transition count 93
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 346 place count 55 transition count 71
Iterating global reduction 2 with 11 rules applied. Total rules applied 357 place count 55 transition count 71
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 368 place count 44 transition count 60
Iterating global reduction 2 with 11 rules applied. Total rules applied 379 place count 44 transition count 60
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 390 place count 33 transition count 38
Iterating global reduction 2 with 11 rules applied. Total rules applied 401 place count 33 transition count 38
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 411 place count 23 transition count 28
Iterating global reduction 2 with 10 rules applied. Total rules applied 421 place count 23 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 422 place count 23 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 423 place count 23 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 425 place count 21 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 22 edges and 19 vertex of which 16 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 432 place count 16 transition count 18
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 436 place count 12 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 440 place count 10 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 442 place count 9 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 443 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 444 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 446 place count 7 transition count 12
Applied a total of 446 rules in 46 ms. Remains 7 /239 variables (removed 232) and now considering 12/280 (removed 268) transitions.
[2026-05-24 06:09:11] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6100900215492791567.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2695956954106617496.kers'
[2026-05-24 06:09:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6100900215492791567.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2695956954106617496.kers]
Normalized transition count is 9 out of 10 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 7 cols 15 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 06:09:11] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2695956954106617496.kers
Total runtime 0 ms.
[2026-05-24 06:09:11] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-24 06:09:11] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2026-05-24 06:09:11] [INFO ] Invariant cache hit.
[2026-05-24 06:09:11] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2026-05-24 06:09:11] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-24 06:09:11] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2026-05-24 06:09:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 4/16 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 107ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/239 places, 12/280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 7/239 places, 12/280 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)&&X(G(p1)))))'
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-06 finished in 357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(p1)||G(p2))))'
Support contains 5 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 280/280 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 280
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 228 transition count 269
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 228 transition count 269
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 224 transition count 265
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 224 transition count 265
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 220 transition count 260
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 220 transition count 260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 217 transition count 255
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 217 transition count 255
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 214 transition count 252
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 214 transition count 252
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 212 transition count 250
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 212 transition count 250
Applied a total of 53 rules in 29 ms. Remains 212 /239 variables (removed 27) and now considering 250/280 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-257117184358691324.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16838724965550733018.kers'
[2026-05-24 06:09:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-257117184358691324.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16838724965550733018.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 250 rows 212 cols 673 entries
Finished phase 1 with 210 SingleSign rule and 0 generalized
[2026-05-24 06:09:12] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16838724965550733018.kers
Total runtime 1 ms.
[2026-05-24 06:09:12] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-24 06:09:12] [INFO ] Invariant cache hit.
[2026-05-24 06:09:12] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2026-05-24 06:09:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (OVERLAPS) 250/462 variables, 212/214 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 13/227 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 0/462 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 227 constraints, problems are : Problem set: 0 solved, 249 unsolved in 16238 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/462 variables, 212/227 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 249/476 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 0/462 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 476 constraints, problems are : Problem set: 0 solved, 249 unsolved in 19677 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35956ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 35958ms
Starting structural reductions in LTL mode, iteration 1 : 212/239 places, 250/280 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36195 ms. Remains : 212/239 places, 250/280 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(p1)||G(p2))))'
Stuttering acceptance computed with spot in 206 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-10 finished in 36446 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 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 280/280 transitions.
Graph (complete) has 473 edges and 239 vertex of which 234 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 233 transition count 241
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 199 transition count 241
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 69 place count 199 transition count 201
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 149 place count 159 transition count 201
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 153 place count 155 transition count 196
Iterating global reduction 2 with 4 rules applied. Total rules applied 157 place count 155 transition count 196
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 161 place count 151 transition count 192
Iterating global reduction 2 with 4 rules applied. Total rules applied 165 place count 151 transition count 192
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 168 place count 148 transition count 186
Iterating global reduction 2 with 3 rules applied. Total rules applied 171 place count 148 transition count 186
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 174 place count 145 transition count 183
Iterating global reduction 2 with 3 rules applied. Total rules applied 177 place count 145 transition count 183
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 295 place count 86 transition count 124
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 307 place count 74 transition count 100
Iterating global reduction 2 with 12 rules applied. Total rules applied 319 place count 74 transition count 100
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 331 place count 62 transition count 88
Iterating global reduction 2 with 12 rules applied. Total rules applied 343 place count 62 transition count 88
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 355 place count 50 transition count 64
Iterating global reduction 2 with 12 rules applied. Total rules applied 367 place count 50 transition count 64
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 378 place count 39 transition count 53
Iterating global reduction 2 with 11 rules applied. Total rules applied 389 place count 39 transition count 53
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 400 place count 28 transition count 31
Iterating global reduction 2 with 11 rules applied. Total rules applied 411 place count 28 transition count 31
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 422 place count 17 transition count 20
Iterating global reduction 2 with 11 rules applied. Total rules applied 433 place count 17 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 434 place count 17 transition count 19
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 436 place count 15 transition count 17
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 15 edges and 13 vertex of which 10 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 441 place count 10 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 443 place count 8 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 445 place count 7 transition count 12
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 447 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 449 place count 5 transition count 8
Applied a total of 449 rules in 35 ms. Remains 5 /239 variables (removed 234) and now considering 8/280 (removed 272) transitions.
[2026-05-24 06:09:48] [INFO ] Flow matrix only has 6 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-17634421520971103662.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2554231646524776031.kers'
[2026-05-24 06:09:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17634421520971103662.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2554231646524776031.kers]
Normalized transition count is 5 out of 6 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 5 cols 9 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-24 06:09:48] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2554231646524776031.kers
Total runtime 1 ms.
[2026-05-24 06:09:48] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-24 06:09:48] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2026-05-24 06:09:48] [INFO ] Invariant cache hit.
[2026-05-24 06:09:48] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2026-05-24 06:09:48] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-24 06:09:48] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2026-05-24 06:09:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 39 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/10 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 38 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 79ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 80ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/239 places, 8/280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165 ms. Remains : 5/239 places, 8/280 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 43 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-14 finished in 238 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))&&(p0 U p1))||X(X(G(p0))))))'
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 280/280 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 280
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 228 transition count 269
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 228 transition count 269
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 225 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 225 transition count 266
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 222 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 222 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 220 transition count 259
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 220 transition count 259
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 218 transition count 257
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 218 transition count 257
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 217 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 217 transition count 256
Applied a total of 43 rules in 28 ms. Remains 217 /239 variables (removed 22) and now considering 256/280 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-172126657633994329.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15567084230497697613.kers'
[2026-05-24 06:09:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-172126657633994329.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15567084230497697613.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 256 rows 217 cols 693 entries
Finished phase 1 with 215 SingleSign rule and 0 generalized
[2026-05-24 06:09:48] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15567084230497697613.kers
Total runtime 2 ms.
[2026-05-24 06:09:48] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-24 06:09:48] [INFO ] Invariant cache hit.
[2026-05-24 06:09:49] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2026-05-24 06:09:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 256/473 variables, 217/219 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 13/232 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 0/473 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 232 constraints, problems are : Problem set: 0 solved, 255 unsolved in 16842 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/473 variables, 217/232 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 255/487 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 0/473 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 473/473 variables, and 487 constraints, problems are : Problem set: 0 solved, 255 unsolved in 23285 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40157ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 40158ms
Starting structural reductions in LTL mode, iteration 1 : 217/239 places, 256/280 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40405 ms. Remains : 217/239 places, 256/280 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))&&(p0 U p1)))))'
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-15 finished in 40720 ms.
All properties solved by simple procedures.
Total runtime 226863 ms.

BK_STOP 1779603029599

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

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-13b.tgz
mv DiscoveryGPU-PT-13b execution
cd execution
if [ "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 ;