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.r066-tall-177946967600323.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 CO4-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967600323
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 5.7K Mar 6 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 6 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 6 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 6 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 6 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 6 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 6 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 97K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779521268902

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 07:27:50] [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-23 07:27:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:27:50] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2026-05-23 07:27:50] [INFO ] Transformed 383 places.
[2026-05-23 07:27:50] [INFO ] Transformed 454 transitions.
[2026-05-23 07:27:50] [INFO ] Found NUPN structural information;
[2026-05-23 07:27:50] [INFO ] Parsed PT model containing 383 places and 454 transitions and 1016 arcs in 166 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.
Deduced a syphon composed of 100 places in 5 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-06-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 334/334 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 273 transition count 333
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 69 place count 215 transition count 273
Iterating global reduction 1 with 58 rules applied. Total rules applied 127 place count 215 transition count 273
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 130 place count 215 transition count 270
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 157 place count 188 transition count 243
Iterating global reduction 2 with 27 rules applied. Total rules applied 184 place count 188 transition count 243
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 189 place count 183 transition count 236
Iterating global reduction 2 with 5 rules applied. Total rules applied 194 place count 183 transition count 236
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 196 place count 181 transition count 234
Iterating global reduction 2 with 2 rules applied. Total rules applied 198 place count 181 transition count 234
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 199 place count 180 transition count 233
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 180 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 180 transition count 232
Applied a total of 201 rules in 82 ms. Remains 180 /283 variables (removed 103) and now considering 232/334 (removed 102) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13061205138003465761.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12705560141568880348.kers'
[2026-05-23 07:27:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13061205138003465761.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12705560141568880348.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 232 rows 180 cols 531 entries
Finished phase 1 with 176 SingleSign rule and 0 generalized
[2026-05-23 07:27:50] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12705560141568880348.kers
Total runtime 1 ms.
[2026-05-23 07:27:50] [INFO ] Implicit Places using invariants in 244 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 277 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 179/283 places, 232/334 transitions.
Applied a total of 0 rules in 3 ms. Remains 179 /179 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 377 ms. Remains : 179/283 places, 232/334 transitions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 232/232 transitions.
Applied a total of 0 rules in 3 ms. Remains 179 /179 variables (removed 0) and now considering 232/232 (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-4234202141196682950.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14449970860473486278.kers'
[2026-05-23 07:27:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4234202141196682950.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14449970860473486278.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 232 rows 179 cols 529 entries
Finished phase 1 with 176 SingleSign rule and 0 generalized
[2026-05-23 07:27:50] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14449970860473486278.kers
Total runtime 1 ms.
[2026-05-23 07:27:50] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-23 07:27:50] [INFO ] Invariant cache hit.
[2026-05-23 07:27:50] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2026-05-23 07:27:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (OVERLAPS) 232/411 variables, 179/182 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 0/411 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 184 constraints, problems are : Problem set: 0 solved, 231 unsolved in 17097 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 232/411 variables, 179/184 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 231/415 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (OVERLAPS) 0/411 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 416 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47193ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 47204ms
Finished structural reductions in LTL mode , in 1 iterations and 47471 ms. Remains : 179/179 places, 232/232 transitions.
Support contains 12 out of 179 places after structural reductions.
[2026-05-23 07:28:38] [INFO ] Flatten gal took : 36 ms
[2026-05-23 07:28:38] [INFO ] Flatten gal took : 15 ms
[2026-05-23 07:28:38] [INFO ] Input system was already deterministic with 232 transitions.
RANDOM walk for 40000 steps (60 resets) in 1039 ms. (38 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40000 steps (41 resets) in 333 ms. (119 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (24 resets) in 159 ms. (250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (34 resets) in 195 ms. (204 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (50 resets) in 175 ms. (227 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (20 resets) in 156 ms. (254 steps per ms) remains 4/5 properties
[2026-05-23 07:28:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 82/101 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 11/112 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/116 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 165/281 variables, 78/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 108/389 variables, 64/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/389 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 15/404 variables, 10/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/404 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 5/409 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/409 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/411 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/411 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/411 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 182 constraints, problems are : Problem set: 0 solved, 4 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 179/179 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 82/101 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 11/112 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 4/116 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 165/281 variables, 78/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 108/389 variables, 64/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 15/404 variables, 10/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/404 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 5/409 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/409 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/411 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/411 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/411 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 186 constraints, problems are : Problem set: 0 solved, 4 unsolved in 680 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1051ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 48 ms.
Computed a total of 10 stabilizing places and 12 stable transitions
Graph (complete) has 300 edges and 179 vertex of which 175 are kept as prefixes of interest. Removing 4 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(G(p0)))'
Support contains 2 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 232/232 transitions.
Graph (trivial) has 187 edges and 179 vertex of which 2 / 179 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 299 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 176 transition count 168
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 115 transition count 167
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 125 place count 115 transition count 148
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 163 place count 96 transition count 148
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 165 place count 94 transition count 146
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 94 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 94 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 168 place count 94 transition count 144
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 93 transition count 144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 92 transition count 143
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 92 transition count 143
Performed 30 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 232 place count 62 transition count 106
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 237 place count 62 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 239 place count 60 transition count 99
Iterating global reduction 4 with 2 rules applied. Total rules applied 241 place count 60 transition count 99
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 245 place count 58 transition count 97
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 273 place count 44 transition count 98
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 281 place count 44 transition count 90
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 292 place count 33 transition count 68
Iterating global reduction 5 with 11 rules applied. Total rules applied 303 place count 33 transition count 68
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 310 place count 33 transition count 61
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 313 place count 30 transition count 52
Iterating global reduction 6 with 3 rules applied. Total rules applied 316 place count 30 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 318 place count 30 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 323 place count 30 transition count 45
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 327 place count 30 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 329 place count 28 transition count 43
Applied a total of 329 rules in 53 ms. Remains 28 /179 variables (removed 151) and now considering 43/232 (removed 189) transitions.
[2026-05-23 07:28:40] [INFO ] Flow matrix only has 40 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-12082794650315361478.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16488580822188988453.kers'
[2026-05-23 07:28:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12082794650315361478.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16488580822188988453.kers]
Normalized transition count is 39 out of 40 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 39 rows 28 cols 91 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-05-23 07:28:40] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16488580822188988453.kers
Total runtime 0 ms.
[2026-05-23 07:28:40] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-23 07:28:40] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
[2026-05-23 07:28:40] [INFO ] Invariant cache hit.
[2026-05-23 07:28:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:28:40] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2026-05-23 07:28:40] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2026-05-23 07:28:40] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
[2026-05-23 07:28:40] [INFO ] Invariant cache hit.
[2026-05-23 07:28:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 39/67 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/68 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 0/68 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 32 constraints, problems are : Problem set: 0 solved, 33 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 39/67 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 33/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/68 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 65 constraints, problems are : Problem set: 0 solved, 33 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1109ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 1110ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/179 places, 43/232 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1232 ms. Remains : 28/179 places, 43/232 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 161 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLCardinality-00
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA CO4-PT-06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLCardinality-00 finished in 1472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 232/232 transitions.
Graph (trivial) has 188 edges and 179 vertex of which 2 / 179 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 299 edges and 178 vertex of which 174 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 173 transition count 166
Reduce places removed 59 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 61 rules applied. Total rules applied 122 place count 114 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 113 transition count 164
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 123 place count 113 transition count 145
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 161 place count 94 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 163 place count 92 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 165 place count 92 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 166 place count 92 transition count 142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 166 place count 92 transition count 141
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 168 place count 91 transition count 141
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 169 place count 90 transition count 140
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 90 transition count 140
Performed 30 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 230 place count 60 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 233 place count 60 transition count 98
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 235 place count 58 transition count 96
Iterating global reduction 5 with 2 rules applied. Total rules applied 237 place count 58 transition count 96
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 5 with 4 rules applied. Total rules applied 241 place count 56 transition count 94
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 269 place count 42 transition count 95
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 278 place count 42 transition count 86
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 289 place count 31 transition count 64
Iterating global reduction 6 with 11 rules applied. Total rules applied 300 place count 31 transition count 64
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 308 place count 31 transition count 56
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 311 place count 28 transition count 47
Iterating global reduction 7 with 3 rules applied. Total rules applied 314 place count 28 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 315 place count 28 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 319 place count 28 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 321 place count 26 transition count 40
Applied a total of 321 rules in 32 ms. Remains 26 /179 variables (removed 153) and now considering 40/232 (removed 192) transitions.
[2026-05-23 07:28:42] [INFO ] Flow matrix only has 37 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-8292443672385466436.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6590371871004136097.kers'
[2026-05-23 07:28:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8292443672385466436.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6590371871004136097.kers]
Normalized transition count is 36 out of 37 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 36 rows 26 cols 92 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-23 07:28:42] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6590371871004136097.kers
Total runtime 2 ms.
[2026-05-23 07:28:42] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-23 07:28:42] [INFO ] Flow matrix only has 37 transitions (discarded 3 similar events)
[2026-05-23 07:28:42] [INFO ] Invariant cache hit.
[2026-05-23 07:28:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:28:42] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2026-05-23 07:28:42] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2026-05-23 07:28:42] [INFO ] Flow matrix only has 37 transitions (discarded 3 similar events)
[2026-05-23 07:28:42] [INFO ] Invariant cache hit.
[2026-05-23 07:28:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 36/62 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 30 constraints, problems are : Problem set: 0 solved, 30 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 36/62 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 30/59 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 1/63 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 60 constraints, problems are : Problem set: 0 solved, 30 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 955ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 956ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/179 places, 40/232 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1066 ms. Remains : 26/179 places, 40/232 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLCardinality-02
Product exploration explored 100000 steps with 4 reset in 132 ms.
Product exploration explored 100000 steps with 4 reset in 72 ms.
Computed a total of 6 stabilizing places and 10 stable transitions
Computed a total of 6 stabilizing places and 10 stable transitions
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 370 steps (49 resets) in 7 ms. (46 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Knowledge-based reduction took 173 ms.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 40/40 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2026-05-23 07:28:43] [INFO ] Flow matrix only has 37 transitions (discarded 3 similar events)
[2026-05-23 07:28:43] [INFO ] Invariant cache hit.
[2026-05-23 07:28:43] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-23 07:28:43] [INFO ] Flow matrix only has 37 transitions (discarded 3 similar events)
[2026-05-23 07:28:43] [INFO ] Invariant cache hit.
[2026-05-23 07:28:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:28:43] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2026-05-23 07:28:43] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 26/26 places, 40/40 transitions.
Computed a total of 6 stabilizing places and 10 stable transitions
Computed a total of 6 stabilizing places and 10 stable transitions
Knowledge based reduction with 3 factoid took 46 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 358 steps (49 resets) in 14 ms. (23 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Knowledge-based reduction took 155 ms.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 71 ms.
Product exploration explored 100000 steps with 2 reset in 60 ms.
Built C files in :
/tmp/ltsmin342884429381676298
[2026-05-23 07:28:44] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2026-05-23 07:28:44] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:28:44] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2026-05-23 07:28:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:28:44] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2026-05-23 07:28:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:28:44] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin342884429381676298
Running compilation step : cd /tmp/ltsmin342884429381676298;'/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 234 ms.
Running link step : cd /tmp/ltsmin342884429381676298;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin342884429381676298;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6174279014439503534.hoa' '--buchi-type=spotba'
LTSmin run took 44 ms.
FORMULA CO4-PT-06-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-06-LTLCardinality-02 finished in 2411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 232/232 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 173 transition count 226
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 173 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 173 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 171 transition count 222
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 171 transition count 222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 170 transition count 220
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 170 transition count 220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 169 transition count 219
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 169 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 168 transition count 218
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 168 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 168 transition count 217
Applied a total of 25 rules in 17 ms. Remains 168 /179 variables (removed 11) and now considering 217/232 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-473708103182457204.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5747359208918350623.kers'
[2026-05-23 07:28:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-473708103182457204.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5747359208918350623.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 217 rows 168 cols 494 entries
Finished phase 1 with 165 SingleSign rule and 0 generalized
[2026-05-23 07:28:44] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5747359208918350623.kers
Total runtime 1 ms.
[2026-05-23 07:28:44] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-23 07:28:44] [INFO ] Invariant cache hit.
[2026-05-23 07:28:44] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2026-05-23 07:28:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 217/385 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 0/385 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 173 constraints, problems are : Problem set: 0 solved, 216 unsolved in 13747 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 2/2 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/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/385 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 216/389 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/385 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 390 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43801ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 43802ms
Starting structural reductions in LTL mode, iteration 1 : 168/179 places, 217/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43969 ms. Remains : 168/179 places, 217/232 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CO4-PT-06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLCardinality-07 finished in 44163 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(F(p0))||F(p1))))'
Support contains 2 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 232/232 transitions.
Graph (trivial) has 187 edges and 179 vertex of which 2 / 179 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 299 edges and 178 vertex of which 174 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 173 transition count 166
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 121 place count 114 transition count 165
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 121 place count 114 transition count 146
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 159 place count 95 transition count 146
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 161 place count 93 transition count 144
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 93 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 164 place count 93 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 164 place count 93 transition count 142
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 166 place count 92 transition count 142
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 167 place count 91 transition count 141
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 91 transition count 141
Performed 30 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 228 place count 61 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 231 place count 61 transition count 98
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 233 place count 59 transition count 96
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 59 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 239 place count 57 transition count 94
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 265 place count 44 transition count 95
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 273 place count 44 transition count 87
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 283 place count 34 transition count 67
Iterating global reduction 5 with 10 rules applied. Total rules applied 293 place count 34 transition count 67
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 300 place count 34 transition count 60
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 303 place count 31 transition count 51
Iterating global reduction 6 with 3 rules applied. Total rules applied 306 place count 31 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 308 place count 31 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 313 place count 31 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 315 place count 29 transition count 42
Applied a total of 315 rules in 30 ms. Remains 29 /179 variables (removed 150) and now considering 42/232 (removed 190) transitions.
[2026-05-23 07:29:28] [INFO ] Flow matrix only has 39 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-438204507718313899.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14937904421603356750.kers'
[2026-05-23 07:29:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-438204507718313899.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14937904421603356750.kers]
Normalized transition count is 38 out of 39 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 38 rows 29 cols 98 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-23 07:29:28] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14937904421603356750.kers
Total runtime 0 ms.
[2026-05-23 07:29:28] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-23 07:29:28] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2026-05-23 07:29:28] [INFO ] Invariant cache hit.
[2026-05-23 07:29:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 07:29:28] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2026-05-23 07:29:28] [INFO ] Redundant transitions in 0 ms returned []
Running 34 sub problems to find dead transitions.
[2026-05-23 07:29:28] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2026-05-23 07:29:28] [INFO ] Invariant cache hit.
[2026-05-23 07:29:28] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 38/67 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 1/68 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 0/68 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 34 constraints, problems are : Problem set: 0 solved, 34 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 29/29 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 38/67 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 34/67 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 1/68 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 68 constraints, problems are : Problem set: 0 solved, 34 unsolved in 693 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 29/29 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1288ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 1288ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/179 places, 42/232 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1396 ms. Remains : 29/179 places, 42/232 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(F(p0))||F(p1))))'
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-06-LTLCardinality-08
Stuttering criterion allowed to conclude after 14 steps with 1 reset in 1 ms.
FORMULA CO4-PT-06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLCardinality-08 finished in 1519 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((G(F((G(F(((X(!p0)&&F(!p1))||G(!p0))))||(X(!p1)&&F(((X(!p0)&&F(!p1))||G(!p0)))))))||(!p2&&F((G(F(((X(!p0)&&F(!p1))||G(!p0))))||(X(!p1)&&F(((X(!p0)&&F(!p1))||G(!p0)))))))))))'
Support contains 6 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 232/232 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 176 transition count 229
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 176 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 176 transition count 228
Applied a total of 7 rules in 6 ms. Remains 176 /179 variables (removed 3) and now considering 228/232 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1729237730271422558.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15394943893653451342.kers'
[2026-05-23 07:29:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1729237730271422558.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15394943893653451342.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 228 rows 176 cols 522 entries
Finished phase 1 with 173 SingleSign rule and 0 generalized
[2026-05-23 07:29:30] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15394943893653451342.kers
Total runtime 2 ms.
[2026-05-23 07:29:30] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-23 07:29:30] [INFO ] Invariant cache hit.
[2026-05-23 07:29:30] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2026-05-23 07:29:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 228/404 variables, 176/179 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 0/404 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 181 constraints, problems are : Problem set: 0 solved, 227 unsolved in 15560 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 228/404 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 227/408 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (OVERLAPS) 0/404 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 409 constraints, problems are : Problem set: 0 solved, 227 unsolved in 28950 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44532ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 44533ms
Starting structural reductions in LTL mode, iteration 1 : 176/179 places, 228/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44709 ms. Remains : 176/179 places, 228/232 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(F((G(F(((X(p0)&&F(p1))||G(p0))))||(X(p1)&&F(((X(p0)&&F(p1))||G(p0)))))))||(F((G(F(((X(p0)&&F(p1))||G(p0))))||(X(p1)&&F(((X(p0)&&F(p1))||G(p0))))))&&p2)))))'
Stuttering acceptance computed with spot in 326 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), false, (NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLCardinality-12
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA CO4-PT-06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLCardinality-12 finished in 45127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 232/232 transitions.
Graph (trivial) has 188 edges and 179 vertex of which 2 / 179 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 299 edges and 178 vertex of which 174 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 173 transition count 165
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 113 transition count 164
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 123 place count 113 transition count 145
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 place count 94 transition count 145
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 163 place count 92 transition count 143
Iterating global reduction 2 with 2 rules applied. Total rules applied 165 place count 92 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 166 place count 92 transition count 142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 166 place count 92 transition count 141
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 168 place count 91 transition count 141
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 169 place count 90 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 90 transition count 140
Performed 30 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 230 place count 60 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 233 place count 60 transition count 98
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 235 place count 58 transition count 96
Iterating global reduction 4 with 2 rules applied. Total rules applied 237 place count 58 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 241 place count 56 transition count 94
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 269 place count 42 transition count 95
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 277 place count 42 transition count 87
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 288 place count 31 transition count 65
Iterating global reduction 5 with 11 rules applied. Total rules applied 299 place count 31 transition count 65
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 306 place count 31 transition count 58
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 309 place count 28 transition count 49
Iterating global reduction 6 with 3 rules applied. Total rules applied 312 place count 28 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 314 place count 28 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 319 place count 28 transition count 42
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 320 place count 28 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 322 place count 26 transition count 40
Applied a total of 322 rules in 24 ms. Remains 26 /179 variables (removed 153) and now considering 40/232 (removed 192) transitions.
[2026-05-23 07:30:15] [INFO ] Flow matrix only has 37 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-12068896632637098123.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17040604072367380546.kers'
[2026-05-23 07:30:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12068896632637098123.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17040604072367380546.kers]
Normalized transition count is 36 out of 37 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 36 rows 26 cols 93 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-23 07:30:15] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17040604072367380546.kers
Total runtime 0 ms.
[2026-05-23 07:30:15] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-23 07:30:15] [INFO ] Flow matrix only has 37 transitions (discarded 3 similar events)
[2026-05-23 07:30:15] [INFO ] Invariant cache hit.
[2026-05-23 07:30:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:30:15] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2026-05-23 07:30:15] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2026-05-23 07:30:15] [INFO ] Flow matrix only has 37 transitions (discarded 3 similar events)
[2026-05-23 07:30:15] [INFO ] Invariant cache hit.
[2026-05-23 07:30:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 36/62 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 30 constraints, problems are : Problem set: 0 solved, 30 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 36/62 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 30/59 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 1/63 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 60 constraints, problems are : Problem set: 0 solved, 30 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 917ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 917ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/179 places, 40/232 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1022 ms. Remains : 26/179 places, 40/232 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLCardinality-14
Product exploration explored 100000 steps with 9 reset in 43 ms.
Product exploration explored 100000 steps with 12 reset in 49 ms.
Computed a total of 6 stabilizing places and 9 stable transitions
Computed a total of 6 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 1240 steps (179 resets) in 7 ms. (155 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Knowledge-based reduction took 156 ms.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 40/40 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2026-05-23 07:30:16] [INFO ] Flow matrix only has 37 transitions (discarded 3 similar events)
[2026-05-23 07:30:16] [INFO ] Invariant cache hit.
[2026-05-23 07:30:16] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-23 07:30:16] [INFO ] Flow matrix only has 37 transitions (discarded 3 similar events)
[2026-05-23 07:30:16] [INFO ] Invariant cache hit.
[2026-05-23 07:30:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:30:16] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2026-05-23 07:30:16] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 26/26 places, 40/40 transitions.
Computed a total of 6 stabilizing places and 9 stable transitions
Computed a total of 6 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 487 steps (66 resets) in 5 ms. (81 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Knowledge-based reduction took 155 ms.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 40 reset in 34 ms.
Product exploration explored 100000 steps with 2 reset in 35 ms.
Built C files in :
/tmp/ltsmin3086336720960130042
[2026-05-23 07:30:17] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2026-05-23 07:30:17] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:30:17] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2026-05-23 07:30:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:30:17] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2026-05-23 07:30:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:30:17] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3086336720960130042
Running compilation step : cd /tmp/ltsmin3086336720960130042;'/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 114 ms.
Running link step : cd /tmp/ltsmin3086336720960130042;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3086336720960130042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5769517527652909337.hoa' '--buchi-type=spotba'
LTSmin run took 19 ms.
FORMULA CO4-PT-06-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-06-LTLCardinality-14 finished in 1980 ms.
All properties solved by simple procedures.
Total runtime 147136 ms.

BK_STOP 1779521417256

--------------------
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="CO4-PT-06"
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 CO4-PT-06, 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 r066-tall-177946967600323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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