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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.9K Mar 6 16:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 6 16:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 6 16:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 6 16:31 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.7K Mar 15 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Mar 6 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 6 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 6 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:12 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 32K 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-09a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779597853103

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-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 04:44:14] [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 04:44:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 04:44:14] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2026-05-24 04:44:14] [INFO ] Transformed 93 places.
[2026-05-24 04:44:14] [INFO ] Transformed 127 transitions.
[2026-05-24 04:44:14] [INFO ] Found NUPN structural information;
[2026-05-24 04:44:14] [INFO ] Parsed PT model containing 93 places and 127 transitions and 408 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 127/127 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 90 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 90 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 89 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 89 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 88 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 88 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 88 transition count 113
Applied a total of 18 rules in 28 ms. Remains 88 /93 variables (removed 5) and now considering 113/127 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1086814727039648958.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7742199686262297852.kers'
[2026-05-24 04:44:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1086814727039648958.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7742199686262297852.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 113 rows 86 cols 219 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-24 04:44:14] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7742199686262297852.kers
Total runtime 1 ms.
[2026-05-24 04:44:14] [INFO ] Implicit Places using invariants in 189 ms returned []
[2026-05-24 04:44:14] [INFO ] Invariant cache hit.
[2026-05-24 04:44:14] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 04:44:14] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 360 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 87/93 places, 113/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 404 ms. Remains : 87/93 places, 113/127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 113/113 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 113/113 (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-6650259034931402483.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14341589200427587061.kers'
[2026-05-24 04:44:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6650259034931402483.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14341589200427587061.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 113 rows 86 cols 219 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-24 04:44:14] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14341589200427587061.kers
Total runtime 0 ms.
[2026-05-24 04:44:14] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-24 04:44:14] [INFO ] Invariant cache hit.
[2026-05-24 04:44:15] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-24 04:44:15] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2026-05-24 04:44:15] [INFO ] Invariant cache hit.
[2026-05-24 04:44:15] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 113/200 variables, 87/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 53/141 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 141 constraints, problems are : Problem set: 0 solved, 112 unsolved in 3165 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 113/200 variables, 87/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 53/141 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 112/253 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 253 constraints, problems are : Problem set: 0 solved, 112 unsolved in 3052 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6256ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 6268ms
Finished structural reductions in LTL mode , in 1 iterations and 6443 ms. Remains : 87/87 places, 113/113 transitions.
Support contains 26 out of 87 places after structural reductions.
[2026-05-24 04:44:21] [INFO ] Flatten gal took : 30 ms
[2026-05-24 04:44:21] [INFO ] Flatten gal took : 11 ms
[2026-05-24 04:44:21] [INFO ] Input system was already deterministic with 113 transitions.
RANDOM walk for 40000 steps (406 resets) in 691 ms. (57 steps per ms) remains 1/18 properties
BEST_FIRST walk for 40003 steps (43 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
[2026-05-24 04:44:21] [INFO ] Invariant cache hit.
[2026-05-24 04:44:21] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/7 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 7/200 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/87 constraints, ReadFeed: 2/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 212 edges and 87 vertex of which 81 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 113/113 transitions.
Graph (complete) has 212 edges and 87 vertex of which 81 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 81 transition count 101
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 75 transition count 101
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 75 transition count 100
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 15 place count 74 transition count 100
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 21 place count 68 transition count 94
Iterating global reduction 2 with 6 rules applied. Total rules applied 27 place count 68 transition count 94
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 61 place count 51 transition count 77
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 68 place count 44 transition count 63
Iterating global reduction 2 with 7 rules applied. Total rules applied 75 place count 44 transition count 63
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 82 place count 37 transition count 49
Iterating global reduction 2 with 7 rules applied. Total rules applied 89 place count 37 transition count 49
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 96 place count 30 transition count 42
Iterating global reduction 2 with 7 rules applied. Total rules applied 103 place count 30 transition count 42
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 109 place count 24 transition count 30
Iterating global reduction 2 with 6 rules applied. Total rules applied 115 place count 24 transition count 30
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 120 place count 19 transition count 25
Iterating global reduction 2 with 5 rules applied. Total rules applied 125 place count 19 transition count 25
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 126 place count 19 transition count 25
Applied a total of 126 rules in 28 ms. Remains 19 /87 variables (removed 68) and now considering 25/113 (removed 88) transitions.
[2026-05-24 04:44:22] [INFO ] Flow matrix only has 22 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-8673326152095433501.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7508803700765174000.kers'
[2026-05-24 04:44:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8673326152095433501.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7508803700765174000.kers]
Normalized transition count is 21 out of 22 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 21 rows 18 cols 41 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-24 04:44:22] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7508803700765174000.kers
Total runtime 0 ms.
[2026-05-24 04:44:22] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-24 04:44:22] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2026-05-24 04:44:22] [INFO ] Invariant cache hit.
[2026-05-24 04:44:22] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-24 04:44:22] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2026-05-24 04:44:22] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2026-05-24 04:44:22] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2026-05-24 04:44:22] [INFO ] Invariant cache hit.
[2026-05-24 04:44:22] [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, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 1/41 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/41 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 37 constraints, problems are : Problem set: 0 solved, 24 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 1/41 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 0/41 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 61 constraints, problems are : Problem set: 0 solved, 24 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 732ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 732ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/87 places, 25/113 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 832 ms. Remains : 19/87 places, 25/113 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 249 ms.
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Detected a total of 13/19 stabilizing places and 13/25 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 18 ms. Proved property starting from automaton with 3 states, 5 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 38 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-00 finished in 1597 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(F(p0)))||(!p1&&G(!p2))) U X(p1))))'
Support contains 5 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 113/113 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 82 transition count 108
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 82 transition count 108
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 77 transition count 103
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 77 transition count 103
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 74 transition count 100
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 74 transition count 100
Applied a total of 26 rules in 9 ms. Remains 74 /87 variables (removed 13) and now considering 100/113 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10066047258158271675.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14194504520865573370.kers'
[2026-05-24 04:44:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10066047258158271675.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14194504520865573370.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 100 rows 73 cols 196 entries
Finished phase 1 with 73 SingleSign rule and 0 generalized
[2026-05-24 04:44:23] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14194504520865573370.kers
Total runtime 1 ms.
[2026-05-24 04:44:23] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 04:44:23] [INFO ] Invariant cache hit.
[2026-05-24 04:44:23] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-24 04:44:23] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2026-05-24 04:44:23] [INFO ] Invariant cache hit.
[2026-05-24 04:44:23] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/174 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 48/123 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/174 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 123 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1954 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/174 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 48/123 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 99/222 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/174 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 222 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2374 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4346ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 4346ms
Starting structural reductions in LTL mode, iteration 1 : 74/87 places, 100/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4468 ms. Remains : 74/87 places, 100/113 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(F(p0)))||(!p1&&G(!p2))) U X(p1))))'
Stuttering acceptance computed with spot in 387 ms :[(NOT p1), (AND (NOT p0) (NOT p1) p2), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) p2)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-04
Product exploration explored 100000 steps with 40153 reset in 177 ms.
Product exploration explored 100000 steps with 40025 reset in 234 ms.
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 74 vertex of which 71 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 10 stable transitions
Knowledge based reduction with 12 factoid took 64 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 25276 steps (255 resets) in 289 ms. (87 steps per ms) remains 0/7 properties
Knowledge based reduction with 12 factoid took 164 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (AND (NOT p0) (NOT p1) p2), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) p2)]
Knowledge-based reduction took 611 ms.
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (AND (NOT p0) (NOT p1) p2), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) p2)]
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-24 04:44:30] [INFO ] Invariant cache hit.
[2026-05-24 04:44:30] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-24 04:44:30] [INFO ] Invariant cache hit.
[2026-05-24 04:44:30] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-24 04:44:30] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 74/74 places, 100/100 transitions.
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 74 vertex of which 71 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Computed a total of 11 stabilizing places and 10 stable transitions
Knowledge based reduction with 12 factoid took 68 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 22034 steps (220 resets) in 79 ms. (275 steps per ms) remains 0/7 properties
Knowledge based reduction with 12 factoid took 175 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(NOT p1), (AND (NOT p0) (NOT p1) p2), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) p2)]
Knowledge-based reduction took 553 ms.
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (AND (NOT p0) (NOT p1) p2), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (AND (NOT p0) (NOT p1) p2), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 40113 reset in 131 ms.
Product exploration explored 100000 steps with 40009 reset in 172 ms.
Spot run failed in 78 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin2899032153313066904
[2026-05-24 04:44:31] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2899032153313066904
Running compilation step : cd /tmp/ltsmin2899032153313066904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 280 ms.
Running link step : cd /tmp/ltsmin2899032153313066904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin2899032153313066904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased11797138145788350710.hoa' '--buchi-type=spotba'
LTSmin run took 56 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-04 finished in 8250 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)&&p1)) U X(X(!(G(p0)||p2)))))'
Support contains 6 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 113/113 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 81 transition count 107
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 81 transition count 107
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 75 transition count 101
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 75 transition count 101
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 71 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 71 transition count 97
Applied a total of 32 rules in 12 ms. Remains 71 /87 variables (removed 16) and now considering 97/113 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15250200458045734019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1718294642220278951.kers'
[2026-05-24 04:44:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15250200458045734019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1718294642220278951.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 97 rows 70 cols 191 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-24 04:44:32] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1718294642220278951.kers
Total runtime 0 ms.
[2026-05-24 04:44:32] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-24 04:44:32] [INFO ] Invariant cache hit.
[2026-05-24 04:44:32] [INFO ] State equation strengthened by 47 read => feed constraints.
[2026-05-24 04:44:32] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2026-05-24 04:44:32] [INFO ] Invariant cache hit.
[2026-05-24 04:44:32] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/168 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 47/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/168 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 119 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1989 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/168 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 47/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 96/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/168 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 215 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2311 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4308ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4309ms
Starting structural reductions in LTL mode, iteration 1 : 71/87 places, 97/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4441 ms. Remains : 71/87 places, 97/113 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)&&p1)) U X(X(!(G(p0)||p2)))))'
Stuttering acceptance computed with spot in 532 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-06 finished in 5027 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))'
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 113/113 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 80 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 80 transition count 106
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 73 transition count 99
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 73 transition count 99
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 68 transition count 94
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 68 transition count 94
Applied a total of 38 rules in 11 ms. Remains 68 /87 variables (removed 19) and now considering 94/113 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6470074679005747588.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-67653167457889028.kers'
[2026-05-24 04:44:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6470074679005747588.kers, --Pflows, --basisKERS=/tmp/petrispot-output-67653167457889028.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 94 rows 67 cols 186 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-24 04:44:37] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-67653167457889028.kers
Total runtime 0 ms.
[2026-05-24 04:44:37] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-24 04:44:37] [INFO ] Invariant cache hit.
[2026-05-24 04:44:37] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-24 04:44:37] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2026-05-24 04:44:37] [INFO ] Invariant cache hit.
[2026-05-24 04:44:37] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/162 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 46/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/162 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 115 constraints, problems are : Problem set: 0 solved, 93 unsolved in 1900 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/162 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 46/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 93/208 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 208 constraints, problems are : Problem set: 0 solved, 93 unsolved in 2143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4049ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 4051ms
Starting structural reductions in LTL mode, iteration 1 : 68/87 places, 94/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4156 ms. Remains : 68/87 places, 94/113 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))'
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 10 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 9 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 10 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-07 finished in 4545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 113/113 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 81 transition count 107
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 81 transition count 107
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 75 transition count 101
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 75 transition count 101
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 71 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 71 transition count 97
Applied a total of 32 rules in 5 ms. Remains 71 /87 variables (removed 16) and now considering 97/113 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16214411643560315071.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14337223344496739303.kers'
[2026-05-24 04:44:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16214411643560315071.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14337223344496739303.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 97 rows 70 cols 191 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-24 04:44:41] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14337223344496739303.kers
Total runtime 0 ms.
[2026-05-24 04:44:41] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 04:44:41] [INFO ] Invariant cache hit.
[2026-05-24 04:44:41] [INFO ] State equation strengthened by 47 read => feed constraints.
[2026-05-24 04:44:41] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2026-05-24 04:44:41] [INFO ] Invariant cache hit.
[2026-05-24 04:44:41] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/168 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 47/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/168 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 119 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1911 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/168 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 47/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 96/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/168 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 215 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2357 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4275ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4276ms
Starting structural reductions in LTL mode, iteration 1 : 71/87 places, 97/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4388 ms. Remains : 71/87 places, 97/113 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 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Product exploration explored 100000 steps with 50000 reset in 119 ms.
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 190 edges and 71 vertex of which 69 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 10 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 19 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 20 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-10 finished in 4766 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)||(p1&&(F(G(p2))||G(p3))))))'
Support contains 5 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 113/113 transitions.
Graph (complete) has 212 edges and 87 vertex of which 82 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 90 edges and 80 vertex of which 68 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Graph (trivial) has 67 edges and 68 vertex of which 32 / 68 are part of one of the 16 SCC in 2 ms
Free SCC test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 52 transition count 88
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 25 rules applied. Total rules applied 36 place count 45 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 43 transition count 70
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 44 place count 37 transition count 58
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 37 transition count 58
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 55 place count 32 transition count 48
Iterating global reduction 3 with 5 rules applied. Total rules applied 60 place count 32 transition count 48
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 64 place count 28 transition count 40
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 28 transition count 40
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 72 place count 24 transition count 36
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 24 transition count 36
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 3 with 4 rules applied. Total rules applied 80 place count 22 transition count 34
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 3 with 2 rules applied. Total rules applied 82 place count 21 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 21 transition count 31
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 90 place count 16 transition count 26
Applied a total of 90 rules in 25 ms. Remains 16 /87 variables (removed 71) and now considering 26/113 (removed 87) transitions.
[2026-05-24 04:44:46] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10943207718537443239.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8329846410241993090.kers'
[2026-05-24 04:44:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10943207718537443239.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8329846410241993090.kers]
Normalized transition count is 20 out of 21 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 16 cols 35 entries
Finished phase 1 with 16 SingleSign rule and 0 generalized
[2026-05-24 04:44:46] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8329846410241993090.kers
Total runtime 0 ms.
[2026-05-24 04:44:46] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-24 04:44:46] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2026-05-24 04:44:46] [INFO ] Invariant cache hit.
[2026-05-24 04:44:46] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2026-05-24 04:44:46] [INFO ] Redundant transitions in 1 ms returned []
Running 17 sub problems to find dead transitions.
[2026-05-24 04:44:46] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2026-05-24 04:44:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 19/30 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 6/36 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/37 variables, and 16 constraints, problems are : Problem set: 0 solved, 17 unsolved in 140 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 19/30 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 6/36 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/37 variables, and 33 constraints, problems are : Problem set: 0 solved, 17 unsolved in 147 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 290ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 291ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/87 places, 26/113 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 370 ms. Remains : 16/87 places, 26/113 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)||(p1&&(F(G(p2))||G(p3))))))'
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-14
Stuttering criterion allowed to conclude after 193 steps with 5 reset in 3 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-14 finished in 555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 113/113 transitions.
Graph (complete) has 212 edges and 87 vertex of which 81 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 89 edges and 79 vertex of which 65 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Graph (trivial) has 71 edges and 65 vertex of which 36 / 65 are part of one of the 18 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 47 transition count 84
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 38 place count 39 transition count 66
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 45 place count 32 transition count 52
Iterating global reduction 2 with 7 rules applied. Total rules applied 52 place count 32 transition count 52
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 59 place count 25 transition count 38
Iterating global reduction 2 with 7 rules applied. Total rules applied 66 place count 25 transition count 38
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 72 place count 19 transition count 26
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 19 transition count 26
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 13 transition count 20
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 13 transition count 20
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 92 place count 12 transition count 19
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 94 place count 11 transition count 19
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 96 place count 11 transition count 17
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 99 place count 8 transition count 14
Applied a total of 99 rules in 15 ms. Remains 8 /87 variables (removed 79) and now considering 14/113 (removed 99) transitions.
[2026-05-24 04:44:46] [INFO ] Flow matrix only has 10 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-1515498981719325954.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1124472389317814918.kers'
[2026-05-24 04:44:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1515498981719325954.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1124472389317814918.kers]
Normalized transition count is 9 out of 10 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 8 cols 15 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-24 04:44:46] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1124472389317814918.kers
Total runtime 0 ms.
[2026-05-24 04:44:47] [INFO ] Implicit Places using invariants in 14 ms returned []
[2026-05-24 04:44:47] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
[2026-05-24 04:44:47] [INFO ] Invariant cache hit.
[2026-05-24 04:44:47] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2026-05-24 04:44:47] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-24 04:44:47] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
[2026-05-24 04:44:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4/17 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 8 constraints, problems are : Problem set: 0 solved, 7 unsolved in 60 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 4/17 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 15 constraints, problems are : Problem set: 0 solved, 7 unsolved in 67 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 129ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/87 places, 14/113 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 8/87 places, 14/113 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-15 finished in 256 ms.
All properties solved by simple procedures.
Total runtime 32979 ms.

BK_STOP 1779597887291

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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-09a"
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-09a, 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-177955695500283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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