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.r338-smll-178021499200227.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 ErlangenMainframeV2-PT-bP03C03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499200227
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.5K May 27 09:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 27 09:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 27 09:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 27 09:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 27 10:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.8K May 27 09:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 27 09:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 27 09:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 27 09:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 105K May 26 18:17 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 ErlangenMainframeV2-PT-bP03C03-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1780372125269

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP03C03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-06-02 03:48:47] [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-06-02 03:48:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 03:48:47] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2026-06-02 03:48:47] [INFO ] Transformed 219 places.
[2026-06-02 03:48:47] [INFO ] Transformed 331 transitions.
[2026-06-02 03:48:47] [INFO ] Found NUPN structural information;
[2026-06-02 03:48:47] [INFO ] Parsed PT model containing 219 places and 331 transitions and 1585 arcs in 363 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 331/331 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 176 transition count 288
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 176 transition count 288
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 102 place count 160 transition count 272
Iterating global reduction 0 with 16 rules applied. Total rules applied 118 place count 160 transition count 272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 158 transition count 262
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 158 transition count 262
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 156 transition count 235
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 156 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 155 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 155 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 154 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 154 transition count 233
Applied a total of 130 rules in 111 ms. Remains 154 /219 variables (removed 65) and now considering 233/331 (removed 98) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10064161408142048470.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2536463601359714412.kers'
[2026-06-02 03:48:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10064161408142048470.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2536463601359714412.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 233 rows 154 cols 1101 entries
Finished phase 1 with 137 SingleSign rule and 3 generalized
[2026-06-02 03:48:48] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2536463601359714412.kers
Total runtime 3 ms.
[2026-06-02 03:48:48] [INFO ] Implicit Places using invariants in 484 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 536 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/219 places, 233/331 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 676 ms. Remains : 153/219 places, 233/331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 233/233 (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-17347272114489618978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15674450261606693187.kers'
[2026-06-02 03:48:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17347272114489618978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15674450261606693187.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 233 rows 153 cols 1047 entries
Finished phase 1 with 137 SingleSign rule and 3 generalized
[2026-06-02 03:48:48] [INFO ] Computed 13 invariants in 2 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15674450261606693187.kers
Total runtime 2 ms.
[2026-06-02 03:48:48] [INFO ] Implicit Places using invariants in 215 ms returned []
[2026-06-02 03:48:48] [INFO ] Invariant cache hit.
[2026-06-02 03:48:49] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2026-06-02 03:48:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 233/386 variables, 153/167 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 0/386 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 167 constraints, problems are : Problem set: 0 solved, 232 unsolved in 23027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 233/386 variables, 153/167 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 232/399 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 8/407 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 410 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 53428ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 53454ms
Finished structural reductions in LTL mode , in 1 iterations and 54143 ms. Remains : 153/153 places, 233/233 transitions.
Support contains 24 out of 153 places after structural reductions.
[2026-06-02 03:49:42] [INFO ] Flatten gal took : 77 ms
[2026-06-02 03:49:42] [INFO ] Flatten gal took : 36 ms
[2026-06-02 03:49:43] [INFO ] Input system was already deterministic with 233 transitions.
RANDOM walk for 40000 steps (8 resets) in 2431 ms. (16 steps per ms) remains 3/16 properties
BEST_FIRST walk for 40000 steps (8 resets) in 997 ms. (40 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 162 ms. (245 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 117 ms. (338 steps per ms) remains 3/3 properties
[2026-06-02 03:49:44] [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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 79/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 33/120 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 33/153 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 233/386 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 166 constraints, problems are : Problem set: 0 solved, 3 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 79/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 33/120 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 33/153 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 233/386 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/386 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 171 constraints, problems are : Problem set: 0 solved, 3 unsolved in 785 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1083ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 143 ms.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 233/233 transitions.
Graph (trivial) has 137 edges and 153 vertex of which 11 / 153 are part of one of the 5 SCC in 8 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 147 transition count 186
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 50 rules applied. Total rules applied 86 place count 112 transition count 171
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 94 place count 104 transition count 171
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 94 place count 104 transition count 159
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 118 place count 92 transition count 159
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 126 place count 84 transition count 146
Iterating global reduction 3 with 8 rules applied. Total rules applied 134 place count 84 transition count 146
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 134 place count 84 transition count 144
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 138 place count 82 transition count 144
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 143 place count 77 transition count 113
Ensure Unique test removed 2 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 150 place count 75 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 74 transition count 101
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 74 transition count 101
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 206 place count 47 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 208 place count 47 transition count 72
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 212 place count 43 transition count 64
Iterating global reduction 4 with 4 rules applied. Total rules applied 216 place count 43 transition count 64
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 217 place count 42 transition count 60
Iterating global reduction 4 with 1 rules applied. Total rules applied 218 place count 42 transition count 60
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 230 place count 36 transition count 75
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 240 place count 36 transition count 65
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 242 place count 34 transition count 60
Iterating global reduction 5 with 2 rules applied. Total rules applied 244 place count 34 transition count 60
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 248 place count 34 transition count 56
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 6 with 2 rules applied. Total rules applied 250 place count 33 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 263 place count 33 transition count 47
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 6 with 2 rules applied. Total rules applied 265 place count 32 transition count 51
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 271 place count 32 transition count 45
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 283 place count 26 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 285 place count 26 transition count 37
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 286 place count 26 transition count 43
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 289 place count 25 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 295 place count 25 transition count 35
Applied a total of 295 rules in 84 ms. Remains 25 /153 variables (removed 128) and now considering 35/233 (removed 198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 25/153 places, 35/233 transitions.
RANDOM walk for 64 steps (0 resets) in 13 ms. (4 steps per ms) remains 0/1 properties
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 16 stabilizing places and 16 stable 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)))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 233/233 transitions.
Graph (trivial) has 137 edges and 153 vertex of which 11 / 153 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 146 transition count 194
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 46 rules applied. Total rules applied 78 place count 115 transition count 179
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 86 place count 107 transition count 179
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 86 place count 107 transition count 168
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 108 place count 96 transition count 168
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 117 place count 87 transition count 154
Iterating global reduction 3 with 9 rules applied. Total rules applied 126 place count 87 transition count 154
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 126 place count 87 transition count 152
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 130 place count 85 transition count 152
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 136 place count 79 transition count 120
Ensure Unique test removed 2 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 144 place count 77 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 74 transition count 100
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 74 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 73 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 73 transition count 98
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 204 place count 47 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 206 place count 47 transition count 70
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 210 place count 43 transition count 62
Ensure Unique test removed 1 places
Iterating global reduction 4 with 5 rules applied. Total rules applied 215 place count 42 transition count 62
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 216 place count 41 transition count 60
Iterating global reduction 4 with 1 rules applied. Total rules applied 217 place count 41 transition count 60
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 4 with 2 rules applied. Total rules applied 219 place count 40 transition count 59
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 233 place count 33 transition count 77
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 245 place count 33 transition count 65
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 246 place count 32 transition count 63
Iterating global reduction 5 with 1 rules applied. Total rules applied 247 place count 32 transition count 63
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 253 place count 32 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 259 place count 32 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 261 place count 31 transition count 61
Applied a total of 261 rules in 65 ms. Remains 31 /153 variables (removed 122) and now considering 61/233 (removed 172) transitions.
[2026-06-02 03:49:45] [INFO ] Flow matrix only has 54 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7733749557711922496.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-488875106248234870.kers'
[2026-06-02 03:49:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7733749557711922496.kers, --Pflows, --basisKERS=/tmp/petrispot-output-488875106248234870.kers]
Normalized transition count is 53 out of 54 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 53 rows 29 cols 242 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-06-02 03:49:45] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-488875106248234870.kers
Total runtime 1 ms.
[2026-06-02 03:49:45] [INFO ] Implicit Places using invariants in 56 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/153 places, 61/233 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 83
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 16 place count 28 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 27 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 27 transition count 69
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 30 place count 27 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 41 place count 27 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 26 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 25 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 48 place count 25 transition count 40
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 25 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 52 place count 23 transition count 38
Applied a total of 52 rules in 20 ms. Remains 23 /30 variables (removed 7) and now considering 38/61 (removed 23) transitions.
[2026-06-02 03:49:45] [INFO ] Flow matrix only has 35 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-496270084216504736.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6091694296489824086.kers'
[2026-06-02 03:49:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-496270084216504736.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6091694296489824086.kers]
Normalized transition count is 34 out of 35 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 34 rows 19 cols 88 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-06-02 03:49:45] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6091694296489824086.kers
Total runtime 1 ms.
[2026-06-02 03:49:46] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-06-02 03:49:46] [INFO ] Flow matrix only has 35 transitions (discarded 3 similar events)
[2026-06-02 03:49:46] [INFO ] Invariant cache hit.
[2026-06-02 03:49:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-06-02 03:49:46] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/153 places, 38/233 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 261 ms. Remains : 23/153 places, 38/233 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 343 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 331 ms.
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 9 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLCardinality-02 finished in 1055 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(p0))))))'
Support contains 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 233/233 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 138 transition count 213
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 138 transition count 213
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 130 transition count 184
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 130 transition count 184
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 124 transition count 164
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 59 place count 123 transition count 164
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 63 place count 119 transition count 151
Iterating global reduction 0 with 4 rules applied. Total rules applied 67 place count 119 transition count 151
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 70 place count 116 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 73 place count 116 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 74 place count 115 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 75 place count 115 transition count 145
Applied a total of 75 rules in 31 ms. Remains 115 /153 variables (removed 38) and now considering 145/233 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10375720319622169891.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11042837924823517430.kers'
[2026-06-02 03:49:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10375720319622169891.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11042837924823517430.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 145 rows 115 cols 425 entries
Finished phase 1 with 101 SingleSign rule and 2 generalized
[2026-06-02 03:49:46] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11042837924823517430.kers
Total runtime 2 ms.
[2026-06-02 03:49:46] [INFO ] Implicit Places using invariants in 98 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/153 places, 145/233 transitions.
Applied a total of 0 rules in 3 ms. Remains 114 /114 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135 ms. Remains : 114/153 places, 145/233 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(p0))))))'
Stuttering acceptance computed with spot in 311 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLCardinality-03
Product exploration explored 100000 steps with 16666 reset in 225 ms.
Product exploration explored 100000 steps with 16666 reset in 179 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 1 factoid took 60 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
RANDOM walk for 7243 steps (2 resets) in 26 ms. (268 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 64 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 391 ms.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 1 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 145/145 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 145/145 (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-6611963638227340394.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9358679110118552589.kers'
[2026-06-02 03:49:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6611963638227340394.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9358679110118552589.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 145 rows 114 cols 419 entries
Finished phase 1 with 101 SingleSign rule and 2 generalized
[2026-06-02 03:49:48] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9358679110118552589.kers
Total runtime 1 ms.
[2026-06-02 03:49:48] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-06-02 03:49:48] [INFO ] Invariant cache hit.
[2026-06-02 03:49:48] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2026-06-02 03:49:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 1/114 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/259 variables, 114/125 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 125 constraints, problems are : Problem set: 0 solved, 144 unsolved in 9361 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 1/114 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/259 variables, 114/125 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 144/269 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 9/278 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 0/259 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 279 constraints, problems are : Problem set: 0 solved, 144 unsolved in 20106 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 29507ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 29512ms
Finished structural reductions in LTL mode , in 1 iterations and 29760 ms. Remains : 114/114 places, 145/145 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 1 factoid took 47 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
RANDOM walk for 7465 steps (2 resets) in 16 ms. (439 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 57 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 338 ms.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 16666 reset in 82 ms.
Product exploration explored 100000 steps with 16666 reset in 334 ms.
Spot run failed in 132 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin12086253771130049028
[2026-06-02 03:50:19] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12086253771130049028
Running compilation step : cd /tmp/ltsmin12086253771130049028;'/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 546 ms.
Running link step : cd /tmp/ltsmin12086253771130049028;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin12086253771130049028;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased1315399077785923393.hoa' '--buchi-type=spotba'
LTSmin run took 62 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLCardinality-03 finished in 33422 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)&&F(G(p1)))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 233/233 transitions.
Graph (trivial) has 136 edges and 153 vertex of which 11 / 153 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 146 transition count 194
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 43 rules applied. Total rules applied 75 place count 115 transition count 182
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 82 place count 108 transition count 182
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 82 place count 108 transition count 170
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 106 place count 96 transition count 170
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 115 place count 87 transition count 156
Iterating global reduction 3 with 9 rules applied. Total rules applied 124 place count 87 transition count 156
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 124 place count 87 transition count 154
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 128 place count 85 transition count 154
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 134 place count 79 transition count 122
Ensure Unique test removed 2 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 142 place count 77 transition count 122
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 145 place count 74 transition count 102
Iterating global reduction 3 with 3 rules applied. Total rules applied 148 place count 74 transition count 102
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 73 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 73 transition count 100
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 204 place count 46 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 206 place count 46 transition count 71
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 210 place count 42 transition count 63
Ensure Unique test removed 1 places
Iterating global reduction 4 with 5 rules applied. Total rules applied 215 place count 41 transition count 63
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 216 place count 40 transition count 61
Iterating global reduction 4 with 1 rules applied. Total rules applied 217 place count 40 transition count 61
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 4 with 2 rules applied. Total rules applied 219 place count 39 transition count 60
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 233 place count 32 transition count 78
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 245 place count 32 transition count 66
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 247 place count 30 transition count 62
Iterating global reduction 5 with 2 rules applied. Total rules applied 249 place count 30 transition count 62
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 259 place count 30 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 261 place count 29 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 275 place count 29 transition count 51
Applied a total of 275 rules in 46 ms. Remains 29 /153 variables (removed 124) and now considering 51/233 (removed 182) transitions.
[2026-06-02 03:50:20] [INFO ] Flow matrix only has 43 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11216771729389218631.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11056229062217558958.kers'
[2026-06-02 03:50:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11216771729389218631.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11056229062217558958.kers]
Normalized transition count is 42 out of 43 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 42 rows 27 cols 174 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-06-02 03:50:20] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11056229062217558958.kers
Total runtime 0 ms.
[2026-06-02 03:50:20] [INFO ] Implicit Places using invariants in 57 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/153 places, 51/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 28 /28 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 110 ms. Remains : 28/153 places, 51/233 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)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLCardinality-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 8 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLCardinality-05 finished in 317 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((p0||X(X(X(X(F(p1))))))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 233/233 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 140 transition count 215
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 140 transition count 215
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 133 transition count 192
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 133 transition count 192
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 128 transition count 180
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 128 transition count 180
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 125 transition count 167
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 125 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 124 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 124 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 123 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 123 transition count 165
Applied a total of 60 rules in 13 ms. Remains 123 /153 variables (removed 30) and now considering 165/233 (removed 68) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14582825638457369170.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4605772397617310546.kers'
[2026-06-02 03:50:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14582825638457369170.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4605772397617310546.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 165 rows 123 cols 593 entries
Finished phase 1 with 108 SingleSign rule and 2 generalized
[2026-06-02 03:50:20] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4605772397617310546.kers
Total runtime 1 ms.
[2026-06-02 03:50:20] [INFO ] Implicit Places using invariants in 121 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 134 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/153 places, 165/233 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 165/165 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 122/153 places, 165/233 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(X(F(p0)))))||p1)))'
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLCardinality-06
Product exploration explored 100000 steps with 25 reset in 240 ms.
Stack based approach found an accepted trace after 88 steps with 7 reset with depth 26 and stack size 26 in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLCardinality-06 finished in 669 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))||(X(!p1) U G(p2))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 233/233 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 141 transition count 216
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 141 transition count 216
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 135 transition count 189
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 135 transition count 189
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 131 transition count 172
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 131 transition count 172
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 129 transition count 167
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 129 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 128 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 128 transition count 165
Applied a total of 50 rules in 9 ms. Remains 128 /153 variables (removed 25) and now considering 165/233 (removed 68) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1197349776754635858.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9037411787350439579.kers'
[2026-06-02 03:50:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1197349776754635858.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9037411787350439579.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 165 rows 128 cols 537 entries
Finished phase 1 with 113 SingleSign rule and 2 generalized
[2026-06-02 03:50:21] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9037411787350439579.kers
Total runtime 2 ms.
[2026-06-02 03:50:21] [INFO ] Implicit Places using invariants in 130 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 132 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/153 places, 165/233 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 165/165 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 143 ms. Remains : 127/153 places, 165/233 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))||(X(!p1) U G(p2))))'
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p2)), (AND p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLCardinality-08
Product exploration explored 100000 steps with 25035 reset in 325 ms.
Product exploration explored 100000 steps with 24991 reset in 344 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 21 factoid took 108 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 458 ms. (87 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1910162153250406334.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13666123647600121266.kers'
[2026-06-02 03:50:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1910162153250406334.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13666123647600121266.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 165 rows 127 cols 525 entries
Finished phase 1 with 113 SingleSign rule and 2 generalized
[2026-06-02 03:50:22] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13666123647600121266.kers
Total runtime 1 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 32/103 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 24/127 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 165/292 variables, 127/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/292 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 139 constraints, problems are : Problem set: 0 solved, 3 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 32/103 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 24/127 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 165/292 variables, 127/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/292 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/292 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 143 constraints, problems are : Problem set: 0 solved, 3 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 611ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 522 ms.
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 165/165 transitions.
Graph (trivial) has 107 edges and 127 vertex of which 11 / 127 are part of one of the 5 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 121 transition count 132
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 30 rules applied. Total rules applied 52 place count 100 transition count 123
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 59 place count 95 transition count 121
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 63 place count 93 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 92 transition count 119
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 14 Pre rules applied. Total rules applied 64 place count 92 transition count 105
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 92 place count 78 transition count 105
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 138 place count 55 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 142 place count 55 transition count 78
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 145 place count 52 transition count 68
Iterating global reduction 6 with 3 rules applied. Total rules applied 148 place count 52 transition count 68
Performed 8 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 164 place count 44 transition count 84
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 168 place count 44 transition count 80
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 169 place count 43 transition count 78
Iterating global reduction 7 with 1 rules applied. Total rules applied 170 place count 43 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 171 place count 43 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 181 place count 43 transition count 67
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 187 place count 43 transition count 61
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 200 place count 37 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 202 place count 37 transition count 52
Applied a total of 202 rules in 32 ms. Remains 37 /127 variables (removed 90) and now considering 52/165 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 37/127 places, 52/165 transitions.
RANDOM walk for 38882 steps (8 resets) in 152 ms. (254 steps per ms) remains 0/3 properties
Knowledge based reduction with 21 factoid took 272 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p2)), (AND p2 p1 (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Knowledge-based reduction took 2124 ms.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p2)), (AND p2 p1 (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 165/165 transitions.
Graph (trivial) has 107 edges and 127 vertex of which 11 / 127 are part of one of the 5 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 120 transition count 139
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 27 rules applied. Total rules applied 46 place count 102 transition count 130
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 53 place count 97 transition count 128
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 57 place count 95 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 58 place count 94 transition count 126
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 58 place count 94 transition count 113
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 84 place count 81 transition count 113
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 132 place count 57 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 136 place count 57 transition count 85
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 139 place count 54 transition count 75
Iterating global reduction 6 with 3 rules applied. Total rules applied 142 place count 54 transition count 75
Performed 7 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 156 place count 47 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 158 place count 47 transition count 77
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 159 place count 46 transition count 75
Iterating global reduction 7 with 1 rules applied. Total rules applied 160 place count 46 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 161 place count 46 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 164 place count 46 transition count 71
Applied a total of 164 rules in 35 ms. Remains 46 /127 variables (removed 81) and now considering 71/165 (removed 94) transitions.
[2026-06-02 03:50:24] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13916450113268207360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15083199227289580480.kers'
[2026-06-02 03:50:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13916450113268207360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15083199227289580480.kers]
Normalized transition count is 61 out of 62 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 61 rows 45 cols 266 entries
Finished phase 1 with 32 SingleSign rule and 2 generalized
[2026-06-02 03:50:24] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15083199227289580480.kers
Total runtime 1 ms.
[2026-06-02 03:50:24] [INFO ] Implicit Places using invariants in 94 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/127 places, 71/165 transitions.
Applied a total of 0 rules in 5 ms. Remains 45 /45 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 136 ms. Remains : 45/127 places, 71/165 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge based reduction with 19 factoid took 224 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
RANDOM walk for 5486 steps (175 resets) in 82 ms. (66 steps per ms) remains 0/11 properties
Knowledge based reduction with 19 factoid took 398 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2)), (AND p2 p1 (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Knowledge-based reduction took 881 ms.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p2)), (AND p2 p1 (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p2)), (AND p2 p1 (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering criterion allowed to conclude after 148 steps with 55 reset in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLCardinality-08 finished in 4956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)&&F(p1)))||G(p1)))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 233/233 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 139 transition count 214
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 139 transition count 214
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 131 transition count 185
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 131 transition count 185
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 125 transition count 176
Ensure Unique test removed 2 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 123 transition count 176
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 118 transition count 151
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 118 transition count 151
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 115 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 115 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 114 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 114 transition count 145
Applied a total of 76 rules in 11 ms. Remains 114 /153 variables (removed 39) and now considering 145/233 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13723415316834808070.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10590894684560964144.kers'
[2026-06-02 03:50:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13723415316834808070.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10590894684560964144.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 145 rows 114 cols 414 entries
Finished phase 1 with 102 SingleSign rule and 1 generalized
[2026-06-02 03:50:26] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10590894684560964144.kers
Total runtime 1 ms.
[2026-06-02 03:50:26] [INFO ] Implicit Places using invariants in 90 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/153 places, 145/233 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 113/153 places, 145/233 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)&&F(p1)))||G(p1)))'
Stuttering acceptance computed with spot in 378 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLCardinality-09 finished in 525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(F(p0))))&&(X(p0)||F(p1)))))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 233/233 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 140 transition count 220
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 140 transition count 220
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 132 transition count 199
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 132 transition count 199
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 126 transition count 172
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 126 transition count 172
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 122 transition count 157
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 122 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 120 transition count 154
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 120 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 119 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 119 transition count 153
Applied a total of 68 rules in 12 ms. Remains 119 /153 variables (removed 34) and now considering 153/233 (removed 80) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-345033819444037554.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1341998277912714776.kers'
[2026-06-02 03:50:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-345033819444037554.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1341998277912714776.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 153 rows 119 cols 497 entries
Finished phase 1 with 104 SingleSign rule and 2 generalized
[2026-06-02 03:50:26] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1341998277912714776.kers
Total runtime 2 ms.
[2026-06-02 03:50:26] [INFO ] Implicit Places using invariants in 105 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 107 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/153 places, 153/233 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 118/153 places, 153/233 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(F(p0))))&&(X(p0)||F(p1)))))'
Stuttering acceptance computed with spot in 359 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLCardinality-13
Product exploration explored 100000 steps with 25100 reset in 168 ms.
Product exploration explored 100000 steps with 24966 reset in 158 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Detected a total of 16/118 stabilizing places and 16/153 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 6 factoid took 84 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 13686 steps (3 resets) in 44 ms. (304 steps per ms) remains 0/1 properties
Knowledge based reduction with 6 factoid took 91 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 455 ms.
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 118 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 153/153 transitions.
Applied a total of 0 rules in 1 ms. Remains 118 /118 variables (removed 0) and now considering 153/153 (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-3346254079723706783.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8739964489490092983.kers'
[2026-06-02 03:50:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3346254079723706783.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8739964489490092983.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 153 rows 118 cols 485 entries
Finished phase 1 with 104 SingleSign rule and 2 generalized
[2026-06-02 03:50:28] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8739964489490092983.kers
Total runtime 1 ms.
[2026-06-02 03:50:28] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-06-02 03:50:28] [INFO ] Invariant cache hit.
[2026-06-02 03:50:28] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2026-06-02 03:50:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/118 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 153/271 variables, 118/130 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/271 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 130 constraints, problems are : Problem set: 0 solved, 152 unsolved in 10706 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/118 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 153/271 variables, 118/130 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 152/282 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 6/288 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 292 constraints, problems are : Problem set: 0 solved, 152 unsolved in 24080 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 34817ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 34819ms
Finished structural reductions in LTL mode , in 1 iterations and 35142 ms. Remains : 118/118 places, 153/153 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge based reduction with 1 factoid took 53 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 16914 steps (4 resets) in 35 ms. (469 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 347 ms.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 113 ms.
Product exploration explored 100000 steps with 20000 reset in 134 ms.
Spot run failed in 82 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin15772414986058677738
[2026-06-02 03:51:04] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15772414986058677738
Running compilation step : cd /tmp/ltsmin15772414986058677738;'/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 549 ms.
Running link step : cd /tmp/ltsmin15772414986058677738;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin15772414986058677738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased15034142486916804227.hoa' '--buchi-type=spotba'
LTSmin run took 21 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLCardinality-13 finished in 38476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(p1))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 233/233 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 141 transition count 216
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 141 transition count 216
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 133 transition count 192
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 133 transition count 192
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 127 transition count 172
Ensure Unique test removed 2 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 125 transition count 172
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 121 transition count 156
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 121 transition count 156
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 119 transition count 153
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 119 transition count 153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 118 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 118 transition count 152
Applied a total of 68 rules in 7 ms. Remains 118 /153 variables (removed 35) and now considering 152/233 (removed 81) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7827162782803714746.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13528450068909103549.kers'
[2026-06-02 03:51:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7827162782803714746.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13528450068909103549.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 152 rows 118 cols 430 entries
Finished phase 1 with 106 SingleSign rule and 1 generalized
[2026-06-02 03:51:05] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13528450068909103549.kers
Total runtime 3 ms.
[2026-06-02 03:51:05] [INFO ] Implicit Places using invariants in 139 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 140 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/153 places, 152/233 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 117/153 places, 152/233 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(p1))))'
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 5 factoid took 16 ms. Proved property starting from automaton with 4 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 25 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLCardinality-15 finished in 586 ms.
All properties solved by simple procedures.
Total runtime 138595 ms.

BK_STOP 1780372265848

--------------------
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="ErlangenMainframeV2-PT-bP03C03"
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 ErlangenMainframeV2-PT-bP03C03, 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 r338-smll-178021499200227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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