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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.6K Mar 6 13:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 6 13:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 13:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 6 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 6 13:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 13:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:30 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 138K 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-08-LTLCardinality-00
FORMULA_NAME CO4-PT-08-LTLCardinality-01
FORMULA_NAME CO4-PT-08-LTLCardinality-02
FORMULA_NAME CO4-PT-08-LTLCardinality-03
FORMULA_NAME CO4-PT-08-LTLCardinality-04
FORMULA_NAME CO4-PT-08-LTLCardinality-05
FORMULA_NAME CO4-PT-08-LTLCardinality-06
FORMULA_NAME CO4-PT-08-LTLCardinality-07
FORMULA_NAME CO4-PT-08-LTLCardinality-08
FORMULA_NAME CO4-PT-08-LTLCardinality-09
FORMULA_NAME CO4-PT-08-LTLCardinality-10
FORMULA_NAME CO4-PT-08-LTLCardinality-11
FORMULA_NAME CO4-PT-08-LTLCardinality-12
FORMULA_NAME CO4-PT-08-LTLCardinality-13
FORMULA_NAME CO4-PT-08-LTLCardinality-14
FORMULA_NAME CO4-PT-08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779521790129

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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 07:36:31] [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:36:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:36:31] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2026-05-23 07:36:31] [INFO ] Transformed 467 places.
[2026-05-23 07:36:31] [INFO ] Transformed 600 transitions.
[2026-05-23 07:36:31] [INFO ] Found NUPN structural information;
[2026-05-23 07:36:31] [INFO ] Parsed PT model containing 467 places and 600 transitions and 1596 arcs in 180 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 108 places in 6 ms
Reduce places removed 108 places and 155 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA CO4-PT-08-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 445/445 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 346 transition count 443
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 98 place count 263 transition count 358
Iterating global reduction 1 with 83 rules applied. Total rules applied 181 place count 263 transition count 358
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 186 place count 263 transition count 353
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 227 place count 222 transition count 294
Iterating global reduction 2 with 41 rules applied. Total rules applied 268 place count 222 transition count 294
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 270 place count 222 transition count 292
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 278 place count 214 transition count 279
Iterating global reduction 3 with 8 rules applied. Total rules applied 286 place count 214 transition count 279
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 291 place count 209 transition count 274
Iterating global reduction 3 with 5 rules applied. Total rules applied 296 place count 209 transition count 274
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 299 place count 206 transition count 271
Iterating global reduction 3 with 3 rules applied. Total rules applied 302 place count 206 transition count 271
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 305 place count 206 transition count 268
Applied a total of 305 rules in 88 ms. Remains 206 /359 variables (removed 153) and now considering 268/445 (removed 177) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2907969597354213862.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17096858283936726914.kers'
[2026-05-23 07:36:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2907969597354213862.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17096858283936726914.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 206 cols 644 entries
Finished phase 1 with 200 SingleSign rule and 0 generalized
[2026-05-23 07:36:31] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17096858283936726914.kers
Total runtime 2 ms.
[2026-05-23 07:36:31] [INFO ] Implicit Places using invariants in 222 ms returned [5, 139]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 251 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 204/359 places, 268/445 transitions.
Applied a total of 0 rules in 9 ms. Remains 204 /204 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 363 ms. Remains : 204/359 places, 268/445 transitions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 268/268 transitions.
Applied a total of 0 rules in 4 ms. Remains 204 /204 variables (removed 0) and now considering 268/268 (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-15734406272457974579.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2577104823277601112.kers'
[2026-05-23 07:36:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15734406272457974579.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2577104823277601112.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 204 cols 630 entries
Finished phase 1 with 200 SingleSign rule and 0 generalized
[2026-05-23 07:36:31] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2577104823277601112.kers
Total runtime 1 ms.
[2026-05-23 07:36:32] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-23 07:36:32] [INFO ] Invariant cache hit.
[2026-05-23 07:36:32] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2026-05-23 07:36:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/472 variables, 204/210 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 211 constraints, problems are : Problem set: 0 solved, 267 unsolved in 20474 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/472 variables, 204/211 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 267/478 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 478 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50571ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 50584ms
Finished structural reductions in LTL mode , in 1 iterations and 50833 ms. Remains : 204/204 places, 268/268 transitions.
Support contains 10 out of 204 places after structural reductions.
[2026-05-23 07:37:22] [INFO ] Flatten gal took : 38 ms
[2026-05-23 07:37:22] [INFO ] Flatten gal took : 19 ms
[2026-05-23 07:37:23] [INFO ] Input system was already deterministic with 268 transitions.
RANDOM walk for 40000 steps (293 resets) in 693 ms. (57 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (263 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (172 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (78 resets) in 190 ms. (209 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (200 resets) in 161 ms. (246 steps per ms) remains 4/4 properties
[2026-05-23 07:37:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 97/121 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 11/132 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 10/142 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 195/337 variables, 94/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 113/450 variables, 65/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 21/471 variables, 14/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/471 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/472 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/472 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/472 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 208 constraints, problems are : Problem set: 0 solved, 4 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 97/121 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 11/132 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 10/142 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 195/337 variables, 94/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 113/450 variables, 65/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 21/471 variables, 14/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/471 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/472 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/472 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/472 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/472 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/472 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 214 constraints, problems are : Problem set: 0 solved, 4 unsolved in 985 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1241ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 2 properties in 91 ms.
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 268/268 transitions.
Graph (trivial) has 213 edges and 204 vertex of which 2 / 204 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 363 edges and 203 vertex of which 187 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 187 transition count 172
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 151 place count 120 transition count 170
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 151 place count 120 transition count 147
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 197 place count 97 transition count 147
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 215 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 199 place count 96 transition count 146
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 201 place count 96 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 202 place count 95 transition count 144
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 204 place count 93 transition count 142
Iterating global reduction 5 with 2 rules applied. Total rules applied 206 place count 93 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 208 place count 93 transition count 140
Performed 32 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 272 place count 61 transition count 98
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 279 place count 61 transition count 91
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 283 place count 57 transition count 87
Iterating global reduction 7 with 4 rules applied. Total rules applied 287 place count 57 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 288 place count 57 transition count 86
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 294 place count 54 transition count 83
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 297 place count 54 transition count 80
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 299 place count 52 transition count 78
Iterating global reduction 9 with 2 rules applied. Total rules applied 301 place count 52 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 302 place count 52 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 304 place count 51 transition count 76
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 305 place count 51 transition count 75
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 306 place count 50 transition count 74
Iterating global reduction 11 with 1 rules applied. Total rules applied 307 place count 50 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 308 place count 50 transition count 73
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 12 with 18 rules applied. Total rules applied 326 place count 41 transition count 74
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 12 with 15 rules applied. Total rules applied 341 place count 41 transition count 59
Discarding 7 places :
Symmetric choice reduction at 13 with 7 rule applications. Total rules 348 place count 34 transition count 52
Iterating global reduction 13 with 7 rules applied. Total rules applied 355 place count 34 transition count 52
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 362 place count 34 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 364 place count 33 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 367 place count 33 transition count 46
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 368 place count 32 transition count 45
Iterating global reduction 14 with 1 rules applied. Total rules applied 369 place count 32 transition count 45
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 371 place count 32 transition count 43
Free-agglomeration rule applied 7 times.
Iterating global reduction 15 with 7 rules applied. Total rules applied 378 place count 32 transition count 36
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 9 rules applied. Total rules applied 387 place count 25 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 388 place count 24 transition count 33
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 3 rules applied. Total rules applied 391 place count 22 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 392 place count 21 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 1 Pre rules applied. Total rules applied 392 place count 21 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 394 place count 20 transition count 31
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 18 with 4 rules applied. Total rules applied 398 place count 18 transition count 29
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 400 place count 18 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 402 place count 17 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 404 place count 17 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 406 place count 17 transition count 23
Applied a total of 406 rules in 50 ms. Remains 17 /204 variables (removed 187) and now considering 23/268 (removed 245) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 17/204 places, 23/268 transitions.
RANDOM walk for 136 steps (0 resets) in 5 ms. (22 steps per ms) remains 0/2 properties
FORMULA CO4-PT-08-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 365 edges and 204 vertex of which 201 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 268/268 transitions.
Graph (trivial) has 211 edges and 204 vertex of which 2 / 204 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 364 edges and 203 vertex of which 201 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 200 transition count 197
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 139 place count 133 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 132 transition count 194
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 140 place count 132 transition count 170
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 188 place count 108 transition count 170
Performed 35 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 258 place count 73 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 261 place count 73 transition count 120
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 263 place count 71 transition count 118
Iterating global reduction 4 with 2 rules applied. Total rules applied 265 place count 71 transition count 118
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 269 place count 69 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 270 place count 69 transition count 115
Performed 13 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 296 place count 56 transition count 121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 300 place count 56 transition count 117
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 309 place count 47 transition count 99
Iterating global reduction 6 with 9 rules applied. Total rules applied 318 place count 47 transition count 99
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 325 place count 47 transition count 92
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 328 place count 44 transition count 83
Iterating global reduction 7 with 3 rules applied. Total rules applied 331 place count 44 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 333 place count 44 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 342 place count 44 transition count 72
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 344 place count 42 transition count 70
Applied a total of 344 rules in 35 ms. Remains 42 /204 variables (removed 162) and now considering 70/268 (removed 198) transitions.
[2026-05-23 07:37:25] [INFO ] Flow matrix only has 67 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-9793776043217650061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10635809857166389745.kers'
[2026-05-23 07:37:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9793776043217650061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10635809857166389745.kers]
Normalized transition count is 66 out of 67 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 66 rows 42 cols 186 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-23 07:37:25] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10635809857166389745.kers
Total runtime 1 ms.
[2026-05-23 07:37:25] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-23 07:37:25] [INFO ] Flow matrix only has 67 transitions (discarded 3 similar events)
[2026-05-23 07:37:25] [INFO ] Invariant cache hit.
[2026-05-23 07:37:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:37:25] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2026-05-23 07:37:25] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2026-05-23 07:37:25] [INFO ] Flow matrix only has 67 transitions (discarded 3 similar events)
[2026-05-23 07:37:25] [INFO ] Invariant cache hit.
[2026-05-23 07:37:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 66/108 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 1/109 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 0/109 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 47 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1259 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 66/108 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 55/101 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 1/109 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/109 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 102 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1348 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2619ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2619ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/204 places, 70/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2795 ms. Remains : 42/204 places, 70/268 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : CO4-PT-08-LTLCardinality-08
Product exploration explored 100000 steps with 5 reset in 158 ms.
Product exploration explored 100000 steps with 36 reset in 120 ms.
Computed a total of 7 stabilizing places and 11 stable transitions
Graph (complete) has 137 edges and 42 vertex of which 41 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge based reduction with 13 factoid took 60 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (4803 resets) in 315 ms. (126 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (634 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2026-05-23 07:37:28] [INFO ] Flow matrix only has 67 transitions (discarded 3 similar events)
[2026-05-23 07:37:28] [INFO ] Invariant cache hit.
[2026-05-23 07:37:28] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/47 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/79 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/80 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/89 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/89 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/108 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/108 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/109 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/109 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/109 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 47 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/47 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 79/109 variables, and 22 constraints, problems are : Problem set: 1 solved, 0 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, State Equation: 22/42 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 14 factoid took 101 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), true, (NOT p1)]
Knowledge-based reduction took 505 ms.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), true, (NOT p1)]
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 42 /42 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2026-05-23 07:37:28] [INFO ] Flow matrix only has 67 transitions (discarded 3 similar events)
[2026-05-23 07:37:28] [INFO ] Invariant cache hit.
[2026-05-23 07:37:28] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-23 07:37:28] [INFO ] Flow matrix only has 67 transitions (discarded 3 similar events)
[2026-05-23 07:37:28] [INFO ] Invariant cache hit.
[2026-05-23 07:37:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:37:28] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2026-05-23 07:37:28] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 42/42 places, 70/70 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Graph (complete) has 137 edges and 42 vertex of which 41 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge based reduction with 13 factoid took 45 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (4815 resets) in 163 ms. (243 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (627 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
[2026-05-23 07:37:29] [INFO ] Flow matrix only has 67 transitions (discarded 3 similar events)
[2026-05-23 07:37:29] [INFO ] Invariant cache hit.
[2026-05-23 07:37:29] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/47 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/79 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/80 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/89 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/89 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/108 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/108 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/109 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/109 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/109 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 47 constraints, problems are : Problem set: 0 solved, 1 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/47 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 79/109 variables, and 22 constraints, problems are : Problem set: 1 solved, 0 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, State Equation: 22/42 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 86ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 14 factoid took 101 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), true, (NOT p1)]
Knowledge-based reduction took 370 ms.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 17 reset in 95 ms.
Product exploration explored 100000 steps with 0 reset in 82 ms.
Built C files in :
/tmp/ltsmin11941912768722688679
[2026-05-23 07:37:29] [INFO ] Computing symmetric may disable matrix : 70 transitions.
[2026-05-23 07:37:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:37:29] [INFO ] Computing symmetric may enable matrix : 70 transitions.
[2026-05-23 07:37:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:37:29] [INFO ] Computing Do-Not-Accords matrix : 70 transitions.
[2026-05-23 07:37:29] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:37:29] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11941912768722688679
Running compilation step : cd /tmp/ltsmin11941912768722688679;'/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 256 ms.
Running link step : cd /tmp/ltsmin11941912768722688679;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin11941912768722688679;'/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/stateBased3242661735091727886.hoa' '--buchi-type=spotba'
LTSmin run took 74 ms.
FORMULA CO4-PT-08-LTLCardinality-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-08-LTLCardinality-08 finished in 5199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 268/268 transitions.
Graph (trivial) has 217 edges and 204 vertex of which 2 / 204 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 364 edges and 203 vertex of which 200 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 199 transition count 193
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 129 transition count 191
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 144 place count 129 transition count 167
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 192 place count 105 transition count 167
Performed 36 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 264 place count 69 transition count 118
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 268 place count 69 transition count 114
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 270 place count 67 transition count 112
Iterating global reduction 3 with 2 rules applied. Total rules applied 272 place count 67 transition count 112
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 276 place count 65 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 277 place count 65 transition count 109
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
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 305 place count 51 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 314 place count 51 transition count 103
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 324 place count 41 transition count 83
Iterating global reduction 5 with 10 rules applied. Total rules applied 334 place count 41 transition count 83
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 342 place count 41 transition count 75
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 344 place count 39 transition count 69
Iterating global reduction 6 with 2 rules applied. Total rules applied 346 place count 39 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 348 place count 39 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 350 place count 38 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 357 place count 38 transition count 66
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 359 place count 36 transition count 64
Applied a total of 359 rules in 30 ms. Remains 36 /204 variables (removed 168) and now considering 64/268 (removed 204) transitions.
[2026-05-23 07:37:30] [INFO ] Flow matrix only has 59 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5132226618817613767.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12797680543161572040.kers'
[2026-05-23 07:37:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5132226618817613767.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12797680543161572040.kers]
Normalized transition count is 58 out of 59 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 58 rows 36 cols 183 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-05-23 07:37:30] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12797680543161572040.kers
Total runtime 0 ms.
[2026-05-23 07:37:30] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-23 07:37:30] [INFO ] Flow matrix only has 59 transitions (discarded 5 similar events)
[2026-05-23 07:37:30] [INFO ] Invariant cache hit.
[2026-05-23 07:37:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:37:30] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2026-05-23 07:37:30] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2026-05-23 07:37:30] [INFO ] Flow matrix only has 59 transitions (discarded 5 similar events)
[2026-05-23 07:37:30] [INFO ] Invariant cache hit.
[2026-05-23 07:37:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 58/94 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 1/95 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 0/95 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 41 constraints, problems are : Problem set: 0 solved, 49 unsolved in 839 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 58/94 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 49/89 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 1/95 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/95 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 90 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1196 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2047ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 2047ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/204 places, 64/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2173 ms. Remains : 36/204 places, 64/268 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-08-LTLCardinality-15
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA CO4-PT-08-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLCardinality-15 finished in 2263 ms.
All properties solved by simple procedures.
Total runtime 61187 ms.

BK_STOP 1779521852461

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

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