fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r098-tall-177955695600587
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for DLCround-PT-08a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
447.831 106921.00 140162.00 871.90 FFFFTFFTFFTFFTTT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 4.6K Mar 6 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Mar 6 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 6 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 6 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 09:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 09:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Mar 6 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 6 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 6 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:24 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 479K 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 DLCround-PT-08a-LTLCardinality-00
FORMULA_NAME DLCround-PT-08a-LTLCardinality-01
FORMULA_NAME DLCround-PT-08a-LTLCardinality-02
FORMULA_NAME DLCround-PT-08a-LTLCardinality-03
FORMULA_NAME DLCround-PT-08a-LTLCardinality-04
FORMULA_NAME DLCround-PT-08a-LTLCardinality-05
FORMULA_NAME DLCround-PT-08a-LTLCardinality-06
FORMULA_NAME DLCround-PT-08a-LTLCardinality-07
FORMULA_NAME DLCround-PT-08a-LTLCardinality-08
FORMULA_NAME DLCround-PT-08a-LTLCardinality-09
FORMULA_NAME DLCround-PT-08a-LTLCardinality-10
FORMULA_NAME DLCround-PT-08a-LTLCardinality-11
FORMULA_NAME DLCround-PT-08a-LTLCardinality-12
FORMULA_NAME DLCround-PT-08a-LTLCardinality-13
FORMULA_NAME DLCround-PT-08a-LTLCardinality-14
FORMULA_NAME DLCround-PT-08a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779635998064

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 15:19:59] [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 15:19:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 15:19:59] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2026-05-24 15:19:59] [INFO ] Transformed 263 places.
[2026-05-24 15:19:59] [INFO ] Transformed 1907 transitions.
[2026-05-24 15:19:59] [INFO ] Found NUPN structural information;
[2026-05-24 15:19:59] [INFO ] Parsed PT model containing 263 places and 1907 transitions and 7354 arcs in 419 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.
Ensure Unique test removed 187 transitions
Reduce redundant transitions removed 187 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA DLCround-PT-08a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-08a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-08a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-08a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-08a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-08a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-08a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-08a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 1720/1720 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 245 transition count 1484
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 245 transition count 1484
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 245 transition count 1482
Drop transitions (Redundant composition of simpler transitions.) removed 444 transitions
Redundant transition composition rules discarded 444 transitions
Iterating global reduction 1 with 444 rules applied. Total rules applied 482 place count 245 transition count 1038
Applied a total of 482 rules in 150 ms. Remains 245 /263 variables (removed 18) and now considering 1038/1720 (removed 682) transitions.
[2026-05-24 15:20:00] [INFO ] Flow matrix only has 166 transitions (discarded 872 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10678884999358058005.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5278487457924389042.kers'
[2026-05-24 15:20:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10678884999358058005.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5278487457924389042.kers]
Normalized transition count is 165 out of 166 initially.
Culling duplicate invariants (modulo rational): removing 144 columns.
Culled 144 columns in 0 ms.
// Phase 1: matrix 165 rows 101 cols 342 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-24 15:20:00] [INFO ] Computed 157 invariants in 1 ms
Computed 157 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5278487457924389042.kers
Total runtime 2 ms.
[2026-05-24 15:20:01] [INFO ] Implicit Places using invariants in 1424 ms returned [101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 118, 120, 121, 122, 123, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 166, 167, 168, 169, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 188, 189, 190, 191, 192, 193, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 218, 219, 220, 221, 222, 223, 224, 225, 226, 228, 229, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244]
Discarding 130 places :
Ensure Unique test removed 734 transitions
Reduce isomorphic transitions removed 734 transitions.
Implicit Place search using SMT only with invariants took 1469 ms to find 130 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/263 places, 304/1720 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 87 transitions
Redundant transition composition rules discarded 87 transitions
Iterating global reduction 0 with 87 rules applied. Total rules applied 87 place count 115 transition count 217
Applied a total of 87 rules in 5 ms. Remains 115 /115 variables (removed 0) and now considering 217/304 (removed 87) transitions.
[2026-05-24 15:20:01] [INFO ] Flow matrix only has 166 transitions (discarded 51 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13507729180562489686.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5024474753324406355.kers'
[2026-05-24 15:20:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13507729180562489686.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5024474753324406355.kers]
Normalized transition count is 165 out of 166 initially.
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 165 rows 101 cols 342 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-24 15:20:01] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5024474753324406355.kers
Total runtime 1 ms.
[2026-05-24 15:20:01] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-24 15:20:01] [INFO ] Flow matrix only has 166 transitions (discarded 51 similar events)
[2026-05-24 15:20:01] [INFO ] Invariant cache hit.
[2026-05-24 15:20:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 15:20:02] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/263 places, 217/1720 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2054 ms. Remains : 115/263 places, 217/1720 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 217/217 transitions.
Applied a total of 0 rules in 2 ms. Remains 115 /115 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2026-05-24 15:20:02] [INFO ] Flow matrix only has 166 transitions (discarded 51 similar events)
[2026-05-24 15:20:02] [INFO ] Invariant cache hit.
[2026-05-24 15:20:02] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-24 15:20:02] [INFO ] Flow matrix only has 166 transitions (discarded 51 similar events)
[2026-05-24 15:20:02] [INFO ] Invariant cache hit.
[2026-05-24 15:20:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 15:20:02] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2026-05-24 15:20:03] [INFO ] Flow matrix only has 166 transitions (discarded 51 similar events)
[2026-05-24 15:20:03] [INFO ] Invariant cache hit.
[2026-05-24 15:20:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 14/115 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 165/280 variables, 115/142 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 1/281 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 0/281 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 143 constraints, problems are : Problem set: 0 solved, 216 unsolved in 11225 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 14/115 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 165/280 variables, 115/142 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 216/358 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 1/281 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (OVERLAPS) 0/281 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 359 constraints, problems are : Problem set: 0 solved, 216 unsolved in 9730 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21053ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 21075ms
Finished structural reductions in LTL mode , in 1 iterations and 22182 ms. Remains : 115/115 places, 217/217 transitions.
Support contains 29 out of 115 places after structural reductions.
[2026-05-24 15:20:24] [INFO ] Flatten gal took : 31 ms
[2026-05-24 15:20:24] [INFO ] Flatten gal took : 12 ms
[2026-05-24 15:20:24] [INFO ] Input system was already deterministic with 217 transitions.
RANDOM walk for 40000 steps (8 resets) in 1557 ms. (25 steps per ms) remains 4/20 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
[2026-05-24 15:20:25] [INFO ] Flow matrix only has 166 transitions (discarded 51 similar events)
[2026-05-24 15:20:25] [INFO ] Invariant cache hit.
[2026-05-24 15:20:25] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 15/23 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 92/115 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 165/280 variables, 115/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/281 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/281 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 143 constraints, problems are : Problem set: 0 solved, 4 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Int declared 23/281 variables, and 8 constraints, problems are : Problem set: 4 solved, 0 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 8/27 constraints, State Equation: 0/115 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 212ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DLCround-PT-08a-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 7 simplifications.
Computed a total of 15 stabilizing places and 1 stable transitions
Graph (complete) has 243 edges and 115 vertex of which 101 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.6 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&&F(G(p1)))))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 217/217 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 102 transition count 217
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 96 transition count 205
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 96 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 96 transition count 204
Applied a total of 26 rules in 5 ms. Remains 96 /115 variables (removed 19) and now considering 204/217 (removed 13) transitions.
[2026-05-24 15:20:25] [INFO ] Flow matrix only has 159 transitions (discarded 45 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11917606250276515934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14165658439116721378.kers'
[2026-05-24 15:20:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11917606250276515934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14165658439116721378.kers]
Normalized transition count is 158 out of 159 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 158 rows 95 cols 328 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-24 15:20:25] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14165658439116721378.kers
Total runtime 0 ms.
[2026-05-24 15:20:25] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-24 15:20:25] [INFO ] Flow matrix only has 159 transitions (discarded 45 similar events)
[2026-05-24 15:20:25] [INFO ] Invariant cache hit.
[2026-05-24 15:20:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 15:20:25] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2026-05-24 15:20:25] [INFO ] Flow matrix only has 159 transitions (discarded 45 similar events)
[2026-05-24 15:20:25] [INFO ] Invariant cache hit.
[2026-05-24 15:20:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 158/254 variables, 96/110 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 1/255 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/255 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 111 constraints, problems are : Problem set: 0 solved, 203 unsolved in 8247 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 96/96 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 158/254 variables, 96/110 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 203/313 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 1/255 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 0/255 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 314 constraints, problems are : Problem set: 0 solved, 203 unsolved in 7502 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 96/96 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15773ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 15774ms
Starting structural reductions in LTL mode, iteration 1 : 96/115 places, 204/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15915 ms. Remains : 96/115 places, 204/217 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(G(p0))&&p1)))'
Stuttering acceptance computed with spot in 1213 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DLCround-PT-08a-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA DLCround-PT-08a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08a-LTLCardinality-03 finished in 17224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0))) U (p1&&X(X(G(p0)))))))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 217/217 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 103 transition count 217
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 20 place count 95 transition count 201
Iterating global reduction 1 with 8 rules applied. Total rules applied 28 place count 95 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 95 transition count 199
Applied a total of 30 rules in 3 ms. Remains 95 /115 variables (removed 20) and now considering 199/217 (removed 18) transitions.
[2026-05-24 15:20:43] [INFO ] Flow matrix only has 156 transitions (discarded 43 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18397109608842192995.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15444577679927739785.kers'
[2026-05-24 15:20:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18397109608842192995.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15444577679927739785.kers]
Normalized transition count is 155 out of 156 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 155 rows 93 cols 322 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-24 15:20:43] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15444577679927739785.kers
Total runtime 1 ms.
[2026-05-24 15:20:43] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-24 15:20:43] [INFO ] Flow matrix only has 156 transitions (discarded 43 similar events)
[2026-05-24 15:20:43] [INFO ] Invariant cache hit.
[2026-05-24 15:20:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 15:20:43] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2026-05-24 15:20:43] [INFO ] Flow matrix only has 156 transitions (discarded 43 similar events)
[2026-05-24 15:20:43] [INFO ] Invariant cache hit.
[2026-05-24 15:20:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 2/95 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 155/250 variables, 95/110 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 1/251 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/251 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 111 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7961 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 95/95 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 2/95 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 155/250 variables, 95/110 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 198/308 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 1/251 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 309 constraints, problems are : Problem set: 0 solved, 198 unsolved in 6998 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 95/95 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15001ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 15002ms
Starting structural reductions in LTL mode, iteration 1 : 95/115 places, 199/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15100 ms. Remains : 95/115 places, 199/217 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0))) U (p1&&X(X(G(p0)))))))'
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true]
Running random walk in product with property : DLCround-PT-08a-LTLCardinality-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-08a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08a-LTLCardinality-05 finished in 15265 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)||p1) U G((p0 U p2))))'
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 217/217 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 102 transition count 217
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 97 transition count 207
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 97 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 97 transition count 205
Applied a total of 25 rules in 3 ms. Remains 97 /115 variables (removed 18) and now considering 205/217 (removed 12) transitions.
[2026-05-24 15:20:58] [INFO ] Flow matrix only has 159 transitions (discarded 46 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5929777756613546823.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6991667360491587079.kers'
[2026-05-24 15:20:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5929777756613546823.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6991667360491587079.kers]
Normalized transition count is 158 out of 159 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 158 rows 96 cols 328 entries
Finished phase 1 with 83 SingleSign rule and 0 generalized
[2026-05-24 15:20:58] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6991667360491587079.kers
Total runtime 0 ms.
[2026-05-24 15:20:58] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-24 15:20:58] [INFO ] Flow matrix only has 159 transitions (discarded 46 similar events)
[2026-05-24 15:20:58] [INFO ] Invariant cache hit.
[2026-05-24 15:20:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 15:20:58] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2026-05-24 15:20:58] [INFO ] Flow matrix only has 159 transitions (discarded 46 similar events)
[2026-05-24 15:20:58] [INFO ] Invariant cache hit.
[2026-05-24 15:20:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 1/97 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 158/255 variables, 97/111 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 1/256 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 112 constraints, problems are : Problem set: 0 solved, 204 unsolved in 8107 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 97/97 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 1/97 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 158/255 variables, 97/111 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 204/315 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 1/256 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 316 constraints, problems are : Problem set: 0 solved, 204 unsolved in 7289 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 97/97 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15409ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 15410ms
Starting structural reductions in LTL mode, iteration 1 : 97/115 places, 205/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15579 ms. Remains : 97/115 places, 205/217 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)||p1) U G((p0 U p2))))'
Stuttering acceptance computed with spot in 138 ms :[p2, p2, (AND p0 p2)]
Running random walk in product with property : DLCround-PT-08a-LTLCardinality-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-08a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08a-LTLCardinality-06 finished in 15747 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(p0))||X(G(p0)))) U (G((X(p0) U ((!p1&&X(p0))||X(G(p0)))))||(X(X(!p1))&&(X(p0) U ((!p1&&X(p0))||X(G(p0))))))))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 217/217 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 103 transition count 217
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 20 place count 95 transition count 201
Iterating global reduction 1 with 8 rules applied. Total rules applied 28 place count 95 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 95 transition count 199
Applied a total of 30 rules in 8 ms. Remains 95 /115 variables (removed 20) and now considering 199/217 (removed 18) transitions.
[2026-05-24 15:21:14] [INFO ] Flow matrix only has 156 transitions (discarded 43 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-193948261571003448.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3735047649464355439.kers'
[2026-05-24 15:21:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-193948261571003448.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3735047649464355439.kers]
Normalized transition count is 155 out of 156 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 155 rows 93 cols 322 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-24 15:21:14] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3735047649464355439.kers
Total runtime 1 ms.
[2026-05-24 15:21:14] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 15:21:14] [INFO ] Flow matrix only has 156 transitions (discarded 43 similar events)
[2026-05-24 15:21:14] [INFO ] Invariant cache hit.
[2026-05-24 15:21:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 15:21:14] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2026-05-24 15:21:14] [INFO ] Flow matrix only has 156 transitions (discarded 43 similar events)
[2026-05-24 15:21:14] [INFO ] Invariant cache hit.
[2026-05-24 15:21:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 2/95 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 155/250 variables, 95/110 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 1/251 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/251 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 111 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7863 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 95/95 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 2/95 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 155/250 variables, 95/110 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 198/308 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 1/251 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 309 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7074 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 95/95 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14948ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 14948ms
Starting structural reductions in LTL mode, iteration 1 : 95/115 places, 199/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15048 ms. Remains : 95/115 places, 199/217 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 (X(G(p0))||(!p1&&X(p0)))) U (G((X(p0) U ((!p1&&X(p0))||X(G(p0)))))||(X(X(!p1))&&(X(p0) U ((!p1&&X(p0))||X(G(p0))))))))'
Stuttering acceptance computed with spot in 312 ms :[(NOT p0), (AND p1 (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), true]
Running random walk in product with property : DLCround-PT-08a-LTLCardinality-07
Product exploration explored 100000 steps with 37472 reset in 330 ms.
Product exploration explored 100000 steps with 37495 reset in 196 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 213 edges and 95 vertex of which 93 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 3 stabilizing places and 1 stable transitions
Detected a total of 3/95 stabilizing places and 1/199 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 10 factoid took 23 ms. Proved property starting from automaton with 8 states, 16 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 34 ms.
FORMULA DLCround-PT-08a-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-08a-LTLCardinality-07 finished in 15987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !p1)||G(p1)))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 217/217 transitions.
Graph (trivial) has 207 edges and 115 vertex of which 97 / 115 are part of one of the 13 SCC in 4 ms
Free SCC test removed 84 places
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Graph (complete) has 49 edges and 31 vertex of which 17 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 6 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 6 transition count 7
Applied a total of 27 rules in 12 ms. Remains 6 /115 variables (removed 109) and now considering 7/217 (removed 210) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-704703275689443659.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11598616276935286405.kers'
[2026-05-24 15:21:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-704703275689443659.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11598616276935286405.kers]
Normalized transition count is 6 out of 7 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 6 rows 3 cols 6 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-24 15:21:30] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11598616276935286405.kers
Total runtime 0 ms.
[2026-05-24 15:21:30] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-24 15:21:30] [INFO ] Invariant cache hit.
[2026-05-24 15:21:30] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2026-05-24 15:21:30] [INFO ] Redundant transitions in 1 ms returned []
Running 3 sub problems to find dead transitions.
[2026-05-24 15:21:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 65ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/115 places, 7/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 6/115 places, 7/217 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !p1)||G(p1)))'
Stuttering acceptance computed with spot in 73 ms :[true, false, (NOT p1)]
Running random walk in product with property : DLCround-PT-08a-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-08a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08a-LTLCardinality-09 finished in 225 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 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 217/217 transitions.
Graph (trivial) has 210 edges and 115 vertex of which 96 / 115 are part of one of the 14 SCC in 0 ms
Free SCC test removed 82 places
Ensure Unique test removed 193 transitions
Reduce isomorphic transitions removed 193 transitions.
Graph (complete) has 50 edges and 33 vertex of which 19 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 23
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 18 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 17 transition count 21
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 17 place count 7 transition count 11
Iterating global reduction 3 with 10 rules applied. Total rules applied 27 place count 7 transition count 11
Applied a total of 27 rules in 8 ms. Remains 7 /115 variables (removed 108) and now considering 11/217 (removed 206) transitions.
[2026-05-24 15:21:30] [INFO ] Flow matrix only has 7 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-3391466965373407765.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11633731159095258797.kers'
[2026-05-24 15:21:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3391466965373407765.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11633731159095258797.kers]
Normalized transition count is 6 out of 7 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 6 rows 6 cols 13 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-24 15:21:30] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11633731159095258797.kers
Total runtime 0 ms.
[2026-05-24 15:21:30] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-24 15:21:30] [INFO ] Flow matrix only has 7 transitions (discarded 4 similar events)
[2026-05-24 15:21:30] [INFO ] Invariant cache hit.
[2026-05-24 15:21:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 15:21:30] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2026-05-24 15:21:30] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-24 15:21:30] [INFO ] Flow matrix only has 7 transitions (discarded 4 similar events)
[2026-05-24 15:21:30] [INFO ] Invariant cache hit.
[2026-05-24 15:21:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/14 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 10 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1/14 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/14 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 21 constraints, problems are : Problem set: 0 solved, 10 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 192ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 193ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/115 places, 11/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 247 ms. Remains : 7/115 places, 11/217 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 39 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-08a-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Product exploration explored 100000 steps with 50000 reset in 55 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 18 ms. Proved property starting from automaton with 1 states, 1 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 18 ms.
FORMULA DLCround-PT-08a-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-08a-LTLCardinality-13 finished in 448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p0))&&F(p1)))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 217/217 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 101 transition count 217
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 22 place count 93 transition count 201
Iterating global reduction 1 with 8 rules applied. Total rules applied 30 place count 93 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 93 transition count 199
Applied a total of 32 rules in 5 ms. Remains 93 /115 variables (removed 22) and now considering 199/217 (removed 18) transitions.
[2026-05-24 15:21:30] [INFO ] Flow matrix only has 156 transitions (discarded 43 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6041694661843468814.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14143543632461297594.kers'
[2026-05-24 15:21:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6041694661843468814.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14143543632461297594.kers]
Normalized transition count is 155 out of 156 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 155 rows 93 cols 322 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-24 15:21:30] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14143543632461297594.kers
Total runtime 2 ms.
[2026-05-24 15:21:30] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-24 15:21:30] [INFO ] Flow matrix only has 156 transitions (discarded 43 similar events)
[2026-05-24 15:21:30] [INFO ] Invariant cache hit.
[2026-05-24 15:21:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 15:21:30] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2026-05-24 15:21:30] [INFO ] Flow matrix only has 156 transitions (discarded 43 similar events)
[2026-05-24 15:21:30] [INFO ] Invariant cache hit.
[2026-05-24 15:21:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 155/248 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 1/249 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 107 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7004 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 155/248 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 198/304 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 1/249 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 305 constraints, problems are : Problem set: 0 solved, 198 unsolved in 6531 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13555ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 13556ms
Starting structural reductions in LTL mode, iteration 1 : 93/115 places, 199/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13669 ms. Remains : 93/115 places, 199/217 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p0))&&F(p1)))'
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : DLCround-PT-08a-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 20 ms. Proved property starting from automaton with 5 states, 7 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 22 ms.
FORMULA DLCround-PT-08a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-08a-LTLCardinality-14 finished in 14223 ms.
All properties solved by simple procedures.
Total runtime 105449 ms.

BK_STOP 1779636104985

--------------------
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="DLCround-PT-08a"
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 DLCround-PT-08a, 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-177955695600587"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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