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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.9K Mar 6 13:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 6 13:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 6 13:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 13:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 13:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Mar 6 13:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 6 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 6 13:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:31 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 132K 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-11-LTLCardinality-00
FORMULA_NAME CO4-PT-11-LTLCardinality-01
FORMULA_NAME CO4-PT-11-LTLCardinality-02
FORMULA_NAME CO4-PT-11-LTLCardinality-03
FORMULA_NAME CO4-PT-11-LTLCardinality-04
FORMULA_NAME CO4-PT-11-LTLCardinality-05
FORMULA_NAME CO4-PT-11-LTLCardinality-06
FORMULA_NAME CO4-PT-11-LTLCardinality-07
FORMULA_NAME CO4-PT-11-LTLCardinality-08
FORMULA_NAME CO4-PT-11-LTLCardinality-09
FORMULA_NAME CO4-PT-11-LTLCardinality-10
FORMULA_NAME CO4-PT-11-LTLCardinality-11
FORMULA_NAME CO4-PT-11-LTLCardinality-12
FORMULA_NAME CO4-PT-11-LTLCardinality-13
FORMULA_NAME CO4-PT-11-LTLCardinality-14
FORMULA_NAME CO4-PT-11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779522719045

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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 07:52:00] [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:52:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:52:00] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2026-05-23 07:52:00] [INFO ] Transformed 545 places.
[2026-05-23 07:52:00] [INFO ] Transformed 617 transitions.
[2026-05-23 07:52:00] [INFO ] Found NUPN structural information;
[2026-05-23 07:52:00] [INFO ] Parsed PT model containing 545 places and 617 transitions and 1344 arcs in 177 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 5 formulas.
Deduced a syphon composed of 157 places in 8 ms
Reduce places removed 157 places and 177 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA CO4-PT-11-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 388 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 388/388 places, 440/440 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 376 transition count 437
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 77 place count 314 transition count 373
Iterating global reduction 1 with 62 rules applied. Total rules applied 139 place count 314 transition count 373
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 191 place count 262 transition count 321
Iterating global reduction 1 with 52 rules applied. Total rules applied 243 place count 262 transition count 321
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 246 place count 262 transition count 318
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 271 place count 237 transition count 293
Iterating global reduction 2 with 25 rules applied. Total rules applied 296 place count 237 transition count 293
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 312 place count 221 transition count 277
Iterating global reduction 2 with 16 rules applied. Total rules applied 328 place count 221 transition count 277
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 331 place count 221 transition count 274
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 336 place count 216 transition count 269
Iterating global reduction 3 with 5 rules applied. Total rules applied 341 place count 216 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 342 place count 215 transition count 268
Iterating global reduction 3 with 1 rules applied. Total rules applied 343 place count 215 transition count 268
Applied a total of 343 rules in 117 ms. Remains 215 /388 variables (removed 173) and now considering 268/440 (removed 172) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1083008680979100435.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7036048704680174116.kers'
[2026-05-23 07:52:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1083008680979100435.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7036048704680174116.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 215 cols 606 entries
Finished phase 1 with 211 SingleSign rule and 0 generalized
[2026-05-23 07:52:00] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7036048704680174116.kers
Total runtime 1 ms.
[2026-05-23 07:52:00] [INFO ] Implicit Places using invariants in 230 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 267 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 214/388 places, 268/440 transitions.
Applied a total of 0 rules in 5 ms. Remains 214 /214 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 406 ms. Remains : 214/388 places, 268/440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 268/268 transitions.
Applied a total of 0 rules in 4 ms. Remains 214 /214 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-12618525427524118174.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8707841612631109259.kers'
[2026-05-23 07:52:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12618525427524118174.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8707841612631109259.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 214 cols 604 entries
Finished phase 1 with 211 SingleSign rule and 0 generalized
[2026-05-23 07:52:00] [INFO ] Computed 3 invariants in 5 ms
Computed 3 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8707841612631109259.kers
Total runtime 5 ms.
[2026-05-23 07:52:01] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-23 07:52:01] [INFO ] Invariant cache hit.
[2026-05-23 07:52:01] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2026-05-23 07:52:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 268/482 variables, 214/217 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 0/482 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 219 constraints, problems are : Problem set: 0 solved, 267 unsolved in 18092 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 2/2 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/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/482 variables, 214/219 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 267/486 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 487 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48206ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 48223ms
Finished structural reductions in LTL mode , in 1 iterations and 48504 ms. Remains : 214/214 places, 268/268 transitions.
Support contains 8 out of 214 places after structural reductions.
[2026-05-23 07:52:49] [INFO ] Flatten gal took : 38 ms
[2026-05-23 07:52:49] [INFO ] Flatten gal took : 15 ms
[2026-05-23 07:52:49] [INFO ] Input system was already deterministic with 268 transitions.
RANDOM walk for 40000 steps (39 resets) in 926 ms. (43 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (26 resets) in 367 ms. (108 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (417 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (51 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (42 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
[2026-05-23 07:52:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 12/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/29 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 44/73 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 96/169 variables, 27/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 151/320 variables, 69/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 117/437 variables, 59/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 35/472 variables, 23/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 10/482 variables, 7/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/482 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 217 constraints, problems are : Problem set: 0 solved, 4 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 214/214 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 12/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/29 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 44/73 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 96/169 variables, 27/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 151/320 variables, 69/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 117/437 variables, 59/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 35/472 variables, 23/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/472 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 10/482 variables, 7/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/482 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 221 constraints, problems are : Problem set: 0 solved, 4 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1018ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 161 ms.
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 268/268 transitions.
Graph (trivial) has 219 edges and 214 vertex of which 3 / 214 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 337 edges and 212 vertex of which 199 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 199 transition count 153
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 190 place count 112 transition count 153
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 190 place count 112 transition count 134
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 228 place count 93 transition count 134
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 229 place count 92 transition count 133
Iterating global reduction 2 with 1 rules applied. Total rules applied 230 place count 92 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 230 place count 92 transition count 132
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 91 transition count 132
Performed 32 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 296 place count 59 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 298 place count 59 transition count 90
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 302 place count 55 transition count 86
Iterating global reduction 3 with 4 rules applied. Total rules applied 306 place count 55 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 307 place count 55 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 308 place count 54 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 309 place count 54 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 310 place count 54 transition count 83
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 314 place count 52 transition count 81
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 116 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 6 rules applied. Total rules applied 320 place count 51 transition count 76
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 321 place count 51 transition count 75
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 324 place count 48 transition count 72
Iterating global reduction 7 with 3 rules applied. Total rules applied 327 place count 48 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 328 place count 48 transition count 71
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 8 with 4 rules applied. Total rules applied 332 place count 46 transition count 69
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 334 place count 46 transition count 67
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 335 place count 45 transition count 66
Iterating global reduction 9 with 1 rules applied. Total rules applied 336 place count 45 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 337 place count 45 transition count 65
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 357 place count 35 transition count 66
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 371 place count 35 transition count 52
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 378 place count 28 transition count 45
Iterating global reduction 11 with 7 rules applied. Total rules applied 385 place count 28 transition count 45
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 390 place count 28 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 395 place count 28 transition count 35
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 396 place count 27 transition count 34
Iterating global reduction 12 with 1 rules applied. Total rules applied 397 place count 27 transition count 34
Free-agglomeration rule applied 6 times.
Iterating global reduction 12 with 6 rules applied. Total rules applied 403 place count 27 transition count 28
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 409 place count 21 transition count 28
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 410 place count 21 transition count 28
Graph (complete) has 47 edges and 21 vertex of which 20 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 13 with 1 rules applied. Total rules applied 411 place count 20 transition count 28
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 412 place count 20 transition count 27
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 413 place count 20 transition count 27
Graph (complete) has 44 edges and 20 vertex of which 19 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 15 with 1 rules applied. Total rules applied 414 place count 19 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 415 place count 19 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 416 place count 19 transition count 26
Graph (complete) has 41 edges and 19 vertex of which 18 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 17 with 1 rules applied. Total rules applied 417 place count 18 transition count 26
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 418 place count 18 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 419 place count 17 transition count 24
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t54.t58.t245.t252 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 421 place count 14 transition count 22
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 10 edges and 13 vertex of which 5 / 13 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 2 rules applied. Total rules applied 423 place count 9 transition count 22
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 21 with 8 rules applied. Total rules applied 431 place count 9 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 22 with 1 Pre rules applied. Total rules applied 431 place count 9 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 433 place count 8 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 22 with 2 rules applied. Total rules applied 435 place count 8 transition count 11
Free-agglomeration rule applied 3 times.
Iterating global reduction 22 with 3 rules applied. Total rules applied 438 place count 8 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 441 place count 5 transition count 8
Applied a total of 441 rules in 57 ms. Remains 5 /214 variables (removed 209) and now considering 8/268 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 5/214 places, 8/268 transitions.
RANDOM walk for 42 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/2 properties
Computed a total of 12 stabilizing places and 15 stable transitions
Graph (complete) has 340 edges and 214 vertex of which 209 are kept as prefixes of interest. Removing 5 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' '!(F(G(p0)))'
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 268/268 transitions.
Graph (trivial) has 222 edges and 214 vertex of which 3 / 214 are part of one of the 1 SCC in 8 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 338 edges and 212 vertex of which 207 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 87 place count 206 transition count 174
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 172 place count 121 transition count 174
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 172 place count 121 transition count 154
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 212 place count 101 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 213 place count 100 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 214 place count 100 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 214 place count 100 transition count 152
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 216 place count 99 transition count 152
Performed 34 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 284 place count 65 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 286 place count 65 transition count 106
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 290 place count 61 transition count 102
Iterating global reduction 3 with 4 rules applied. Total rules applied 294 place count 61 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 295 place count 61 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 297 place count 60 transition count 100
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 325 place count 46 transition count 101
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 332 place count 46 transition count 94
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 342 place count 36 transition count 74
Iterating global reduction 5 with 10 rules applied. Total rules applied 352 place count 36 transition count 74
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 358 place count 36 transition count 68
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 360 place count 34 transition count 62
Iterating global reduction 6 with 2 rules applied. Total rules applied 362 place count 34 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 364 place count 33 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 385 place count 33 transition count 53
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 391 place count 33 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 393 place count 31 transition count 51
Applied a total of 393 rules in 44 ms. Remains 31 /214 variables (removed 183) and now considering 51/268 (removed 217) transitions.
[2026-05-23 07:52:51] [INFO ] Flow matrix only has 47 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16035410576020393733.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2116860764082705021.kers'
[2026-05-23 07:52:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16035410576020393733.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2116860764082705021.kers]
Normalized transition count is 46 out of 47 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 46 rows 31 cols 116 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-23 07:52:51] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2116860764082705021.kers
Total runtime 0 ms.
[2026-05-23 07:52:51] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-23 07:52:51] [INFO ] Flow matrix only has 47 transitions (discarded 4 similar events)
[2026-05-23 07:52:51] [INFO ] Invariant cache hit.
[2026-05-23 07:52:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:52:51] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2026-05-23 07:52:51] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2026-05-23 07:52:51] [INFO ] Flow matrix only has 47 transitions (discarded 4 similar events)
[2026-05-23 07:52:51] [INFO ] Invariant cache hit.
[2026-05-23 07:52:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 46/77 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 1/78 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 35 constraints, problems are : Problem set: 0 solved, 41 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 46/77 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 41/75 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 1/78 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 76 constraints, problems are : Problem set: 0 solved, 41 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1404ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1405ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/214 places, 51/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1523 ms. Remains : 31/214 places, 51/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' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 178 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLCardinality-01
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA CO4-PT-11-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLCardinality-01 finished in 1765 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(G((X(X((G(p1)&&p0)))||G(p2)))))'
Support contains 5 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 268/268 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 213 transition count 267
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 267
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 212 transition count 266
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 212 transition count 266
Applied a total of 4 rules in 11 ms. Remains 212 /214 variables (removed 2) and now considering 266/268 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-115863036848798178.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-359099355875502510.kers'
[2026-05-23 07:52:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-115863036848798178.kers, --Pflows, --basisKERS=/tmp/petrispot-output-359099355875502510.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 266 rows 212 cols 600 entries
Finished phase 1 with 209 SingleSign rule and 0 generalized
[2026-05-23 07:52:53] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-359099355875502510.kers
Total runtime 1 ms.
[2026-05-23 07:52:53] [INFO ] Implicit Places using invariants in 156 ms returned []
[2026-05-23 07:52:53] [INFO ] Invariant cache hit.
[2026-05-23 07:52:53] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2026-05-23 07:52:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 266/478 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 0/478 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 217 constraints, problems are : Problem set: 0 solved, 265 unsolved in 16974 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 266/478 variables, 212/217 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 265/482 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 483 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47018ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 47020ms
Starting structural reductions in LTL mode, iteration 1 : 212/214 places, 266/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47303 ms. Remains : 212/214 places, 266/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' '!(X(G((X(X((G(p1)&&p0)))||G(p2)))))'
Stuttering acceptance computed with spot in 421 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p0 p1), false]
Running random walk in product with property : CO4-PT-11-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CO4-PT-11-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLCardinality-03 finished in 47780 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 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 268/268 transitions.
Graph (trivial) has 223 edges and 214 vertex of which 3 / 214 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 338 edges and 212 vertex of which 207 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 87 place count 206 transition count 174
Reduce places removed 85 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 173 place count 121 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 174 place count 120 transition count 173
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 174 place count 120 transition count 153
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 214 place count 100 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 215 place count 99 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 216 place count 99 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 216 place count 99 transition count 151
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 218 place count 98 transition count 151
Performed 36 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 290 place count 62 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 292 place count 62 transition count 102
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 296 place count 58 transition count 98
Iterating global reduction 4 with 4 rules applied. Total rules applied 300 place count 58 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 301 place count 58 transition count 97
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 5 with 2 rules applied. Total rules applied 303 place count 57 transition count 96
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 5 with 26 rules applied. Total rules applied 329 place count 44 transition count 97
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 337 place count 44 transition count 89
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 347 place count 34 transition count 69
Iterating global reduction 6 with 10 rules applied. Total rules applied 357 place count 34 transition count 69
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 364 place count 34 transition count 62
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 367 place count 31 transition count 53
Iterating global reduction 7 with 3 rules applied. Total rules applied 370 place count 31 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 372 place count 31 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 374 place count 30 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 388 place count 30 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 390 place count 28 transition count 44
Applied a total of 390 rules in 35 ms. Remains 28 /214 variables (removed 186) and now considering 44/268 (removed 224) transitions.
[2026-05-23 07:53:41] [INFO ] Flow matrix only has 41 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-7074777993760249304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7697009227633005705.kers'
[2026-05-23 07:53:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7074777993760249304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7697009227633005705.kers]
Normalized transition count is 40 out of 41 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 40 rows 28 cols 104 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-05-23 07:53:41] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7697009227633005705.kers
Total runtime 0 ms.
[2026-05-23 07:53:41] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-23 07:53:41] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2026-05-23 07:53:41] [INFO ] Invariant cache hit.
[2026-05-23 07:53:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:53:41] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2026-05-23 07:53:41] [INFO ] Redundant transitions in 0 ms returned []
Running 34 sub problems to find dead transitions.
[2026-05-23 07:53:41] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2026-05-23 07:53:41] [INFO ] Invariant cache hit.
[2026-05-23 07:53:41] [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, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 40/68 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 1/69 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 0/69 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 32 constraints, problems are : Problem set: 0 solved, 34 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 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, 3/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 40/68 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 1/69 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/69 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 66 constraints, problems are : Problem set: 0 solved, 34 unsolved in 573 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1041ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 1041ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/214 places, 44/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1151 ms. Remains : 28/214 places, 44/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 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLCardinality-09
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA CO4-PT-11-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLCardinality-09 finished in 1275 ms.
All properties solved by simple procedures.
Total runtime 102160 ms.

BK_STOP 1779522822425

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

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