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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 8.6K Mar 6 16:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 6 16:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 6 16:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 6 16:24 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.3K Mar 15 09:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 09:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Mar 6 16:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 6 16:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 6 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 6 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 50K 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-14a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779603351262

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-14a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 06:15:52] [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:15:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 06:15:52] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2026-05-24 06:15:52] [INFO ] Transformed 143 places.
[2026-05-24 06:15:52] [INFO ] Transformed 197 transitions.
[2026-05-24 06:15:52] [INFO ] Found NUPN structural information;
[2026-05-24 06:15:52] [INFO ] Parsed PT model containing 143 places and 197 transitions and 633 arcs in 149 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 1 formulas.
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 197/197 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 132 transition count 186
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 132 transition count 186
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 124 transition count 178
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 124 transition count 178
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 116 transition count 162
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 116 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 116 transition count 156
Applied a total of 60 rules in 38 ms. Remains 116 /143 variables (removed 27) and now considering 156/197 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4549703821486570742.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12510758720688206937.kers'
[2026-05-24 06:15:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4549703821486570742.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12510758720688206937.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 156 rows 114 cols 308 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-24 06:15:52] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12510758720688206937.kers
Total runtime 1 ms.
[2026-05-24 06:15:53] [INFO ] Implicit Places using invariants in 222 ms returned []
[2026-05-24 06:15:53] [INFO ] Invariant cache hit.
[2026-05-24 06:15:53] [INFO ] State equation strengthened by 104 read => feed constraints.
[2026-05-24 06:15:53] [INFO ] Implicit Places using invariants and state equation in 270 ms returned [115]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 535 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/143 places, 156/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 115 /115 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 606 ms. Remains : 115/143 places, 156/197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 115 /115 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-482256824381350941.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12104712575229903283.kers'
[2026-05-24 06:15:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-482256824381350941.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12104712575229903283.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 156 rows 114 cols 308 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-24 06:15:53] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12104712575229903283.kers
Total runtime 0 ms.
[2026-05-24 06:15:53] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-24 06:15:53] [INFO ] Invariant cache hit.
[2026-05-24 06:15:53] [INFO ] State equation strengthened by 76 read => feed constraints.
[2026-05-24 06:15:53] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2026-05-24 06:15:53] [INFO ] Invariant cache hit.
[2026-05-24 06:15:53] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 156/271 variables, 115/116 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 76/192 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 0/271 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 192 constraints, problems are : Problem set: 0 solved, 155 unsolved in 5172 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 156/271 variables, 115/116 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 76/192 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 155/347 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/271 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 347 constraints, problems are : Problem set: 0 solved, 155 unsolved in 5399 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10647ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 10658ms
Finished structural reductions in LTL mode , in 1 iterations and 10926 ms. Remains : 115/115 places, 156/156 transitions.
Support contains 20 out of 115 places after structural reductions.
[2026-05-24 06:16:04] [INFO ] Flatten gal took : 29 ms
[2026-05-24 06:16:04] [INFO ] Flatten gal took : 12 ms
[2026-05-24 06:16:04] [INFO ] Input system was already deterministic with 156 transitions.
RANDOM walk for 10645 steps (65 resets) in 250 ms. (42 steps per ms) remains 0/13 properties
Computed a total of 16 stabilizing places and 15 stable transitions
Graph (complete) has 303 edges and 115 vertex of which 112 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 156/156 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 110 transition count 151
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 110 transition count 151
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 105 transition count 146
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 105 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 103 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 103 transition count 144
Applied a total of 24 rules in 13 ms. Remains 103 /115 variables (removed 12) and now considering 144/156 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13676378922777739282.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17583262730775533135.kers'
[2026-05-24 06:16:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13676378922777739282.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17583262730775533135.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 144 rows 102 cols 286 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-24 06:16:04] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17583262730775533135.kers
Total runtime 0 ms.
[2026-05-24 06:16:04] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-24 06:16:04] [INFO ] Invariant cache hit.
[2026-05-24 06:16:04] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 06:16:05] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2026-05-24 06:16:05] [INFO ] Invariant cache hit.
[2026-05-24 06:16:05] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 144/247 variables, 103/104 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 71/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/247 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 175 constraints, problems are : Problem set: 0 solved, 143 unsolved in 3735 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 144/247 variables, 103/104 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 71/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 143/318 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/247 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 318 constraints, problems are : Problem set: 0 solved, 143 unsolved in 4332 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8095ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 8096ms
Starting structural reductions in LTL mode, iteration 1 : 103/115 places, 144/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8357 ms. Remains : 103/115 places, 144/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-01
Stuttering criterion allowed to conclude after 378 steps with 3 reset in 9 ms.
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-01 finished in 8643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 156/156 transitions.
Graph (complete) has 303 edges and 115 vertex of which 112 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 112 transition count 148
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 107 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 107 transition count 147
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 106 transition count 147
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 18 place count 101 transition count 142
Iterating global reduction 2 with 5 rules applied. Total rules applied 23 place count 101 transition count 142
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 77 place count 74 transition count 115
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 89 place count 62 transition count 91
Iterating global reduction 2 with 12 rules applied. Total rules applied 101 place count 62 transition count 91
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 113 place count 50 transition count 67
Iterating global reduction 2 with 12 rules applied. Total rules applied 125 place count 50 transition count 67
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 137 place count 38 transition count 55
Iterating global reduction 2 with 12 rules applied. Total rules applied 149 place count 38 transition count 55
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 161 place count 26 transition count 31
Iterating global reduction 2 with 12 rules applied. Total rules applied 173 place count 26 transition count 31
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 184 place count 15 transition count 20
Iterating global reduction 2 with 11 rules applied. Total rules applied 195 place count 15 transition count 20
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 196 place count 15 transition count 20
Applied a total of 196 rules in 38 ms. Remains 15 /115 variables (removed 100) and now considering 20/156 (removed 136) transitions.
[2026-05-24 06:16:13] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3377787712704331401.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13000598866258255348.kers'
[2026-05-24 06:16:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3377787712704331401.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13000598866258255348.kers]
Normalized transition count is 17 out of 18 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 17 rows 14 cols 33 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-24 06:16:13] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13000598866258255348.kers
Total runtime 0 ms.
[2026-05-24 06:16:13] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-24 06:16:13] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2026-05-24 06:16:13] [INFO ] Invariant cache hit.
[2026-05-24 06:16:13] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-24 06:16:13] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2026-05-24 06:16:13] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2026-05-24 06:16:13] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2026-05-24 06:16:13] [INFO ] Invariant cache hit.
[2026-05-24 06:16:13] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 17/32 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/33 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/33 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 30 constraints, problems are : Problem set: 0 solved, 19 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 17/32 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/33 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/33 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 49 constraints, problems are : Problem set: 0 solved, 19 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 436ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 437ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/115 places, 20/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 555 ms. Remains : 15/115 places, 20/156 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 56 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-02
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-02 finished in 643 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)&&F(p1))))'
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 156/156 transitions.
Graph (complete) has 303 edges and 115 vertex of which 112 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
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 0 with 4 rules applied. Total rules applied 5 place count 112 transition count 149
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 108 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 107 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 107 transition count 147
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 106 transition count 147
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 18 place count 101 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 23 place count 101 transition count 142
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 77 place count 74 transition count 115
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 89 place count 62 transition count 91
Iterating global reduction 3 with 12 rules applied. Total rules applied 101 place count 62 transition count 91
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 112 place count 51 transition count 69
Iterating global reduction 3 with 11 rules applied. Total rules applied 123 place count 51 transition count 69
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 134 place count 40 transition count 58
Iterating global reduction 3 with 11 rules applied. Total rules applied 145 place count 40 transition count 58
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 156 place count 29 transition count 36
Iterating global reduction 3 with 11 rules applied. Total rules applied 167 place count 29 transition count 36
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 177 place count 19 transition count 26
Iterating global reduction 3 with 10 rules applied. Total rules applied 187 place count 19 transition count 26
Applied a total of 187 rules in 35 ms. Remains 19 /115 variables (removed 96) and now considering 26/156 (removed 130) transitions.
[2026-05-24 06:16:14] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8627774145033727207.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13490241348771459025.kers'
[2026-05-24 06:16:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8627774145033727207.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13490241348771459025.kers]
Normalized transition count is 22 out of 23 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 22 rows 18 cols 43 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-24 06:16:14] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13490241348771459025.kers
Total runtime 0 ms.
[2026-05-24 06:16:14] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-24 06:16:14] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
[2026-05-24 06:16:14] [INFO ] Invariant cache hit.
[2026-05-24 06:16:14] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-24 06:16:14] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2026-05-24 06:16:14] [INFO ] Redundant transitions in 0 ms returned []
Running 25 sub problems to find dead transitions.
[2026-05-24 06:16:14] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
[2026-05-24 06:16:14] [INFO ] Invariant cache hit.
[2026-05-24 06:16:14] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 1/42 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 37 constraints, problems are : Problem set: 0 solved, 25 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 1/42 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 0/42 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 62 constraints, problems are : Problem set: 0 solved, 25 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 655ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 655ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/115 places, 26/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 764 ms. Remains : 19/115 places, 26/156 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)&&F(p1))))'
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-03
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-03 finished in 925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U p1)&&X(X(X(F(X(!p1)))))))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 156/156 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 111 transition count 152
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 111 transition count 152
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 107 transition count 148
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 107 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 106 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 106 transition count 147
Applied a total of 18 rules in 14 ms. Remains 106 /115 variables (removed 9) and now considering 147/156 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1191086393520469169.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3100238511872530430.kers'
[2026-05-24 06:16:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1191086393520469169.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3100238511872530430.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 147 rows 105 cols 291 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-24 06:16:15] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3100238511872530430.kers
Total runtime 0 ms.
[2026-05-24 06:16:15] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 06:16:15] [INFO ] Invariant cache hit.
[2026-05-24 06:16:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-24 06:16:15] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-24 06:16:15] [INFO ] Invariant cache hit.
[2026-05-24 06:16:15] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/253 variables, 106/107 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 72/179 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/253 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 179 constraints, problems are : Problem set: 0 solved, 146 unsolved in 3981 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/253 variables, 106/107 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 72/179 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 146/325 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/253 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 325 constraints, problems are : Problem set: 0 solved, 146 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9016ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 9016ms
Starting structural reductions in LTL mode, iteration 1 : 106/115 places, 147/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9180 ms. Remains : 106/115 places, 147/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U p1)&&X(X(X(F(X(!p1)))))))'
Stuttering acceptance computed with spot in 253 ms :[true, (OR (NOT p1) p0), p1, true, p1, p1, p1]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-05 finished in 9478 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)) U G(p1)))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 156/156 transitions.
Graph (complete) has 303 edges and 115 vertex of which 112 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 132 edges and 110 vertex of which 100 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Graph (trivial) has 107 edges and 100 vertex of which 52 / 100 are part of one of the 26 SCC in 3 ms
Free SCC test removed 26 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 74 transition count 128
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 58 place count 60 transition count 102
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 70 place count 48 transition count 78
Iterating global reduction 2 with 12 rules applied. Total rules applied 82 place count 48 transition count 78
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 93 place count 37 transition count 56
Iterating global reduction 2 with 11 rules applied. Total rules applied 104 place count 37 transition count 56
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 114 place count 27 transition count 36
Iterating global reduction 2 with 10 rules applied. Total rules applied 124 place count 27 transition count 36
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 134 place count 17 transition count 26
Iterating global reduction 2 with 10 rules applied. Total rules applied 144 place count 17 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 146 place count 16 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 15 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 15 transition count 23
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 151 place count 15 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 152 place count 14 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 14 transition count 22
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 156 place count 11 transition count 19
Applied a total of 156 rules in 23 ms. Remains 11 /115 variables (removed 104) and now considering 19/156 (removed 137) transitions.
[2026-05-24 06:16:24] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4732609134874983996.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11526209695194623692.kers'
[2026-05-24 06:16:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4732609134874983996.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11526209695194623692.kers]
Normalized transition count is 14 out of 15 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 14 rows 11 cols 24 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-24 06:16:24] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11526209695194623692.kers
Total runtime 0 ms.
[2026-05-24 06:16:24] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-24 06:16:24] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2026-05-24 06:16:24] [INFO ] Invariant cache hit.
[2026-05-24 06:16:24] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2026-05-24 06:16:24] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2026-05-24 06:16:24] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2026-05-24 06:16:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 5/25 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/26 variables, and 11 constraints, problems are : Problem set: 0 solved, 11 unsolved in 102 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 5/25 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/26 variables, and 22 constraints, problems are : Problem set: 0 solved, 11 unsolved in 86 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 200ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 200ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/115 places, 19/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 280 ms. Remains : 11/115 places, 19/156 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)) U G(p1)))'
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-10 finished in 426 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(X((!X(X(!X(p0))) U p0))))'
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 156/156 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 110 transition count 151
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 110 transition count 151
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 105 transition count 146
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 105 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 103 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 103 transition count 144
Applied a total of 24 rules in 8 ms. Remains 103 /115 variables (removed 12) and now considering 144/156 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7274366792553574005.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14293816521144663521.kers'
[2026-05-24 06:16:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7274366792553574005.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14293816521144663521.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 144 rows 102 cols 286 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-24 06:16:24] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14293816521144663521.kers
Total runtime 0 ms.
[2026-05-24 06:16:25] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-24 06:16:25] [INFO ] Invariant cache hit.
[2026-05-24 06:16:25] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 06:16:25] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2026-05-24 06:16:25] [INFO ] Invariant cache hit.
[2026-05-24 06:16:25] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 144/247 variables, 103/104 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 71/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/247 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 175 constraints, problems are : Problem set: 0 solved, 143 unsolved in 3718 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 144/247 variables, 103/104 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 71/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 143/318 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/247 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 318 constraints, problems are : Problem set: 0 solved, 143 unsolved in 4269 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8013ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 8014ms
Starting structural reductions in LTL mode, iteration 1 : 103/115 places, 144/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8188 ms. Remains : 103/115 places, 144/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((!X(X(!X(p0))) U p0))))'
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 451 steps with 3 reset in 3 ms.
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-11 finished in 8403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||(!p1 U (p2||G(!p1))))))))'
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 156/156 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 112 transition count 153
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 112 transition count 153
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 110 transition count 151
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 110 transition count 151
Applied a total of 10 rules in 2 ms. Remains 110 /115 variables (removed 5) and now considering 151/156 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2195562926265492570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8818262549611732860.kers'
[2026-05-24 06:16:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2195562926265492570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8818262549611732860.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 151 rows 109 cols 299 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-24 06:16:33] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8818262549611732860.kers
Total runtime 0 ms.
[2026-05-24 06:16:33] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-24 06:16:33] [INFO ] Invariant cache hit.
[2026-05-24 06:16:33] [INFO ] State equation strengthened by 74 read => feed constraints.
[2026-05-24 06:16:33] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2026-05-24 06:16:33] [INFO ] Invariant cache hit.
[2026-05-24 06:16:33] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 151/261 variables, 110/111 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 74/185 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/261 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 185 constraints, problems are : Problem set: 0 solved, 150 unsolved in 4908 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 151/261 variables, 110/111 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 74/185 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 150/335 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/261 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/261 variables, and 335 constraints, problems are : Problem set: 0 solved, 150 unsolved in 4979 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9929ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 9929ms
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 151/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10126 ms. Remains : 110/115 places, 151/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||(!p1 U (p2||G(!p1))))))))'
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-12
Product exploration explored 100000 steps with 678 reset in 348 ms.
Stack based approach found an accepted trace after 103 steps with 0 reset with depth 104 and stack size 100 in 0 ms.
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-12 finished in 10610 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 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 156/156 transitions.
Graph (complete) has 303 edges and 115 vertex of which 112 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 132 edges and 110 vertex of which 100 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Graph (trivial) has 111 edges and 100 vertex of which 56 / 100 are part of one of the 28 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 72 transition count 129
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 58 place count 59 transition count 101
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 70 place count 47 transition count 77
Iterating global reduction 2 with 12 rules applied. Total rules applied 82 place count 47 transition count 77
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 94 place count 35 transition count 53
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 35 transition count 53
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 118 place count 23 transition count 29
Iterating global reduction 2 with 12 rules applied. Total rules applied 130 place count 23 transition count 29
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 142 place count 11 transition count 17
Iterating global reduction 2 with 12 rules applied. Total rules applied 154 place count 11 transition count 17
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 2 with 4 rules applied. Total rules applied 158 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 2 with 1 rules applied. Total rules applied 159 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 161 place count 7 transition count 12
Applied a total of 161 rules in 25 ms. Remains 7 /115 variables (removed 108) and now considering 12/156 (removed 144) transitions.
[2026-05-24 06:16:43] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17686670290057096616.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5818115775628841048.kers'
[2026-05-24 06:16:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17686670290057096616.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5818115775628841048.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 7 cols 13 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 06:16:43] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-5818115775628841048.kers
Total runtime 10 ms.
[2026-05-24 06:16:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-24 06:16:44] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2026-05-24 06:16:44] [INFO ] Invariant cache hit.
[2026-05-24 06:16:44] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2026-05-24 06:16:44] [INFO ] Redundant transitions in 1 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-24 06:16:44] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2026-05-24 06:16:44] [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) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 8 unsolved in 180 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) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/15 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 105 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 290ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 290ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/115 places, 12/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 417 ms. Remains : 7/115 places, 12/156 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 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-13
Stuttering criterion allowed to conclude after 68 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-13 finished in 515 ms.
All properties solved by simple procedures.
Total runtime 52013 ms.

BK_STOP 1779603404540

--------------------
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-14a"
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-14a, 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-177955695500363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-14a.tgz
mv DiscoveryGPU-PT-14a 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 ;