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-178021499200220.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-bP02C02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499200220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.2K May 27 09:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 27 09:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 27 09:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 27 09:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 27 10:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 27 10:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 09:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 27 09:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 27 09:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 27 09:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:40 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 67K 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-bP02C02-LTLFireability-00
FORMULA_NAME ErlangenMainframeV2-PT-bP02C02-LTLFireability-01
FORMULA_NAME ErlangenMainframeV2-PT-bP02C02-LTLFireability-02
FORMULA_NAME ErlangenMainframeV2-PT-bP02C02-LTLFireability-03
FORMULA_NAME ErlangenMainframeV2-PT-bP02C02-LTLFireability-04
FORMULA_NAME ErlangenMainframeV2-PT-bP02C02-LTLFireability-05
FORMULA_NAME ErlangenMainframeV2-PT-bP02C02-LTLFireability-06
FORMULA_NAME ErlangenMainframeV2-PT-bP02C02-LTLFireability-07
FORMULA_NAME ErlangenMainframeV2-PT-bP02C02-LTLFireability-08
FORMULA_NAME ErlangenMainframeV2-PT-bP02C02-LTLFireability-09
FORMULA_NAME ErlangenMainframeV2-PT-bP02C02-LTLFireability-10
FORMULA_NAME ErlangenMainframeV2-PT-bP02C02-LTLFireability-11
FORMULA_NAME ErlangenMainframeV2-PT-bP02C02-LTLFireability-12
FORMULA_NAME ErlangenMainframeV2-PT-bP02C02-LTLFireability-13
FORMULA_NAME ErlangenMainframeV2-PT-bP02C02-LTLFireability-14
FORMULA_NAME ErlangenMainframeV2-PT-bP02C02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780371580185

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP02C02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-06-02 03:39:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-02 03:39:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 03:39:42] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2026-06-02 03:39:42] [INFO ] Transformed 199 places.
[2026-06-02 03:39:42] [INFO ] Transformed 259 transitions.
[2026-06-02 03:39:42] [INFO ] Found NUPN structural information;
[2026-06-02 03:39:42] [INFO ] Parsed PT model containing 199 places and 259 transitions and 872 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ErlangenMainframeV2-PT-bP02C02-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP02C02-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP02C02-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 259/259 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 159 transition count 219
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 159 transition count 219
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 92 place count 147 transition count 207
Iterating global reduction 0 with 12 rules applied. Total rules applied 104 place count 147 transition count 207
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 106 place count 145 transition count 203
Iterating global reduction 0 with 2 rules applied. Total rules applied 108 place count 145 transition count 203
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 143 transition count 188
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 143 transition count 188
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 142 transition count 187
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 142 transition count 187
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 141 transition count 186
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 141 transition count 186
Applied a total of 116 rules in 108 ms. Remains 141 /199 variables (removed 58) and now considering 186/259 (removed 73) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1525197684304431239.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3546430586381499869.kers'
[2026-06-02 03:39:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1525197684304431239.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3546430586381499869.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 141 cols 624 entries
Finished phase 1 with 126 SingleSign rule and 3 generalized
[2026-06-02 03:39:42] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3546430586381499869.kers
Total runtime 2 ms.
[2026-06-02 03:39:43] [INFO ] Implicit Places using invariants in 363 ms returned []
[2026-06-02 03:39:43] [INFO ] Invariant cache hit.
[2026-06-02 03:39:43] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2026-06-02 03:39:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/327 variables, 141/153 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/327 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 153 constraints, problems are : Problem set: 0 solved, 185 unsolved in 13117 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/327 variables, 141/153 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 185/338 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 7/345 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 349 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 43317ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 43339ms
Starting structural reductions in LTL mode, iteration 1 : 141/199 places, 186/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44267 ms. Remains : 141/199 places, 186/259 transitions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 186/186 transitions.
Applied a total of 0 rules in 5 ms. Remains 141 /141 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2026-06-02 03:40:27] [INFO ] Invariant cache hit.
[2026-06-02 03:40:27] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-06-02 03:40:27] [INFO ] Invariant cache hit.
[2026-06-02 03:40:27] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 482 ms. Remains : 141/141 places, 186/186 transitions.
Support contains 41 out of 141 places after structural reductions.
[2026-06-02 03:40:28] [INFO ] Flatten gal took : 59 ms
[2026-06-02 03:40:28] [INFO ] Flatten gal took : 23 ms
[2026-06-02 03:40:28] [INFO ] Input system was already deterministic with 186 transitions.
Reduction of identical properties reduced properties to check from 31 to 30
RANDOM walk for 40000 steps (8 resets) in 2062 ms. (19 steps per ms) remains 5/30 properties
BEST_FIRST walk for 40000 steps (8 resets) in 441 ms. (90 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 158 ms. (251 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
[2026-06-02 03:40:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 36/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/123 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 18/141 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 186/327 variables, 141/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/327 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 155 constraints, problems are : Problem set: 0 solved, 4 unsolved in 830 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 36/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/123 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 18/141 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 186/327 variables, 141/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 4/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/327 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 159 constraints, problems are : Problem set: 0 solved, 4 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1387ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 3 properties in 313 ms.
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 186/186 transitions.
Graph (trivial) has 130 edges and 141 vertex of which 12 / 141 are part of one of the 5 SCC in 9 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 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 134 transition count 142
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 103 transition count 127
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 86 place count 95 transition count 127
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 86 place count 95 transition count 114
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 113 place count 81 transition count 114
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 121 place count 73 transition count 104
Ensure Unique test removed 1 places
Iterating global reduction 3 with 9 rules applied. Total rules applied 130 place count 72 transition count 104
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 130 place count 72 transition count 100
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 138 place count 68 transition count 100
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 142 place count 64 transition count 83
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 64 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 63 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 63 transition count 81
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 192 place count 41 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 194 place count 41 transition count 57
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 197 place count 38 transition count 50
Iterating global reduction 4 with 3 rules applied. Total rules applied 200 place count 38 transition count 50
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -14
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 212 place count 32 transition count 64
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 222 place count 32 transition count 54
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 224 place count 30 transition count 49
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 30 transition count 49
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 230 place count 30 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 232 place count 29 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 243 place count 29 transition count 38
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 245 place count 28 transition count 42
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 250 place count 28 transition count 37
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 260 place count 23 transition count 32
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 262 place count 23 transition count 30
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 263 place count 23 transition count 36
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 266 place count 22 transition count 34
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 272 place count 22 transition count 28
Applied a total of 272 rules in 116 ms. Remains 22 /141 variables (removed 119) and now considering 28/186 (removed 158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 22/141 places, 28/186 transitions.
RANDOM walk for 46 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/1 properties
FORMULA ErlangenMainframeV2-PT-bP02C02-LTLFireability-08 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' '!(X((p0&&X(X(G((p1&&X(X(X(p2))))))))))'
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 186/186 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 127 transition count 170
Ensure Unique test removed 1 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 29 place count 126 transition count 170
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 34 place count 121 transition count 160
Iterating global reduction 0 with 5 rules applied. Total rules applied 39 place count 121 transition count 160
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 44 place count 116 transition count 154
Ensure Unique test removed 1 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 115 transition count 154
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 111 transition count 140
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 111 transition count 140
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 108 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 108 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 106 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 106 transition count 134
Applied a total of 68 rules in 19 ms. Remains 106 /141 variables (removed 35) and now considering 134/186 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14321738383045950687.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3954829991779601252.kers'
[2026-06-02 03:40:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14321738383045950687.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3954829991779601252.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 106 cols 364 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-06-02 03:40:31] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3954829991779601252.kers
Total runtime 1 ms.
[2026-06-02 03:40:31] [INFO ] Implicit Places using invariants in 66 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/141 places, 134/186 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 105/141 places, 134/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(G((p1&&X(X(X(p2))))))))))'
Stuttering acceptance computed with spot in 537 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP02C02-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ErlangenMainframeV2-PT-bP02C02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP02C02-LTLFireability-00 finished in 739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((X((X(X(p1)) U p2))&&p0)))||F(X(p1)))))'
Support contains 6 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 186/186 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 126 transition count 169
Ensure Unique test removed 1 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 31 place count 125 transition count 169
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 35 place count 121 transition count 165
Iterating global reduction 0 with 4 rules applied. Total rules applied 39 place count 121 transition count 165
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 43 place count 117 transition count 161
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 116 transition count 161
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 113 transition count 147
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 113 transition count 147
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 110 transition count 143
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 110 transition count 143
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 108 transition count 141
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 108 transition count 141
Applied a total of 64 rules in 14 ms. Remains 108 /141 variables (removed 33) and now considering 141/186 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17444538980148890646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4830420788807120103.kers'
[2026-06-02 03:40:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17444538980148890646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4830420788807120103.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 141 rows 108 cols 414 entries
Finished phase 1 with 97 SingleSign rule and 1 generalized
[2026-06-02 03:40:32] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4830420788807120103.kers
Total runtime 1 ms.
[2026-06-02 03:40:32] [INFO ] Implicit Places using invariants in 61 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/141 places, 141/186 transitions.
Applied a total of 0 rules in 2 ms. Remains 107 /107 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 107/141 places, 141/186 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(X(p1)) U p2))&&p0)))||F(X(p1)))))'
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP02C02-LTLFireability-01
Product exploration explored 100000 steps with 2475 reset in 279 ms.
Stack based approach found an accepted trace after 84 steps with 1 reset with depth 43 and stack size 43 in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP02C02-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP02C02-LTLFireability-01 finished in 643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(p1)) U (!p1||X(((p2||G(!p0)) U (!p1&&(p2||G(!p0))))))))'
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 186/186 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 128 transition count 171
Ensure Unique test removed 1 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 27 place count 127 transition count 171
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 31 place count 123 transition count 162
Iterating global reduction 0 with 4 rules applied. Total rules applied 35 place count 123 transition count 162
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 39 place count 119 transition count 157
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 118 transition count 157
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 115 transition count 147
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 115 transition count 147
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 113 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 113 transition count 144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 112 transition count 143
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 112 transition count 143
Applied a total of 56 rules in 13 ms. Remains 112 /141 variables (removed 29) and now considering 143/186 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3790038562757569966.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5263189569280559282.kers'
[2026-06-02 03:40:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3790038562757569966.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5263189569280559282.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 112 cols 398 entries
Finished phase 1 with 101 SingleSign rule and 1 generalized
[2026-06-02 03:40:32] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5263189569280559282.kers
Total runtime 1 ms.
[2026-06-02 03:40:33] [INFO ] Implicit Places using invariants in 62 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/141 places, 143/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 111/141 places, 143/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(p1)) U (!p1||X(((p2||G(!p0)) U (!p1&&(p2||G(!p0))))))))'
Stuttering acceptance computed with spot in 187 ms :[p1, (OR p1 (AND p0 (NOT p2))), (AND (NOT p1) p0 (NOT p2)), true, p0]
Running random walk in product with property : ErlangenMainframeV2-PT-bP02C02-LTLFireability-02
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP02C02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP02C02-LTLFireability-02 finished in 311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 186/186 transitions.
Graph (trivial) has 129 edges and 141 vertex of which 12 / 141 are part of one of the 5 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 133 transition count 148
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 41 rules applied. Total rules applied 71 place count 104 transition count 136
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 76 place count 99 transition count 136
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 76 place count 99 transition count 123
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 103 place count 85 transition count 123
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 112 place count 76 transition count 112
Ensure Unique test removed 1 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 122 place count 75 transition count 112
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 122 place count 75 transition count 109
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 128 place count 72 transition count 109
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 132 place count 68 transition count 95
Ensure Unique test removed 1 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 137 place count 67 transition count 95
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 65 transition count 91
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 65 transition count 91
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 64 transition count 89
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 64 transition count 89
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 187 place count 42 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 189 place count 42 transition count 65
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 190 place count 41 transition count 61
Iterating global reduction 4 with 1 rules applied. Total rules applied 191 place count 41 transition count 61
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -31
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 203 place count 35 transition count 92
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 213 place count 35 transition count 82
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 214 place count 34 transition count 80
Iterating global reduction 5 with 1 rules applied. Total rules applied 215 place count 34 transition count 80
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 224 place count 34 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 228 place count 34 transition count 67
Applied a total of 228 rules in 37 ms. Remains 34 /141 variables (removed 107) and now considering 67/186 (removed 119) transitions.
[2026-06-02 03:40:33] [INFO ] Flow matrix only has 60 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-482168562563812008.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12330258825075717332.kers'
[2026-06-02 03:40:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-482168562563812008.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12330258825075717332.kers]
Normalized transition count is 59 out of 60 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 59 rows 32 cols 240 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-06-02 03:40:33] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12330258825075717332.kers
Total runtime 1 ms.
[2026-06-02 03:40:33] [INFO ] Implicit Places using invariants in 45 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/141 places, 67/186 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 31 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 30 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 30 transition count 63
Applied a total of 8 rules in 8 ms. Remains 30 /33 variables (removed 3) and now considering 63/67 (removed 4) transitions.
[2026-06-02 03:40:33] [INFO ] Flow matrix only has 56 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-3513809116553211736.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4077870528641609371.kers'
[2026-06-02 03:40:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3513809116553211736.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4077870528641609371.kers]
Normalized transition count is 55 out of 56 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 55 rows 29 cols 230 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-06-02 03:40:33] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4077870528641609371.kers
Total runtime 0 ms.
[2026-06-02 03:40:33] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-06-02 03:40:33] [INFO ] Flow matrix only has 56 transitions (discarded 7 similar events)
[2026-06-02 03:40:33] [INFO ] Invariant cache hit.
[2026-06-02 03:40:33] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-06-02 03:40:33] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/141 places, 63/186 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 202 ms. Remains : 30/141 places, 63/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP02C02-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP02C02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP02C02-LTLFireability-03 finished in 266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(p1)) U (X(X(p2))||G(p3))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 186/186 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 129 transition count 172
Ensure Unique test removed 1 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 25 place count 128 transition count 172
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 29 place count 124 transition count 163
Iterating global reduction 0 with 4 rules applied. Total rules applied 33 place count 124 transition count 163
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 37 place count 120 transition count 158
Iterating global reduction 0 with 4 rules applied. Total rules applied 41 place count 120 transition count 158
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 44 place count 117 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 47 place count 117 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 49 place count 115 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 51 place count 115 transition count 144
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 53 place count 113 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 55 place count 113 transition count 142
Applied a total of 55 rules in 11 ms. Remains 113 /141 variables (removed 28) and now considering 142/186 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-758547619909658796.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5664537557642645902.kers'
[2026-06-02 03:40:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-758547619909658796.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5664537557642645902.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 142 rows 113 cols 402 entries
Finished phase 1 with 100 SingleSign rule and 2 generalized
[2026-06-02 03:40:33] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5664537557642645902.kers
Total runtime 1 ms.
[2026-06-02 03:40:33] [INFO ] Implicit Places using invariants in 68 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/141 places, 142/186 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 112/141 places, 142/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(p1)) U (X(X(p2))||G(p3))))'
Stuttering acceptance computed with spot in 746 ms :[(AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP02C02-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 140 ms.
Product exploration explored 100000 steps with 33333 reset in 261 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Detected a total of 15/112 stabilizing places and 15/142 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 26 factoid took 34 ms. Proved property starting from automaton with 19 states, 40 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 52 ms.
FORMULA ErlangenMainframeV2-PT-bP02C02-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP02C02-LTLFireability-06 finished in 1342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 186/186 transitions.
Graph (trivial) has 126 edges and 141 vertex of which 12 / 141 are part of one of the 5 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 133 transition count 152
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 39 rules applied. Total rules applied 65 place count 108 transition count 138
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 74 place count 100 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 99 transition count 137
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 75 place count 99 transition count 124
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 27 rules applied. Total rules applied 102 place count 85 transition count 124
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 110 place count 77 transition count 114
Ensure Unique test removed 1 places
Iterating global reduction 4 with 9 rules applied. Total rules applied 119 place count 76 transition count 114
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 119 place count 76 transition count 112
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 123 place count 74 transition count 112
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 128 place count 69 transition count 94
Ensure Unique test removed 1 places
Iterating global reduction 4 with 6 rules applied. Total rules applied 134 place count 68 transition count 94
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 136 place count 66 transition count 90
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 66 transition count 90
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 65 transition count 88
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 65 transition count 88
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 4 with 46 rules applied. Total rules applied 186 place count 42 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 188 place count 42 transition count 63
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 191 place count 39 transition count 56
Iterating global reduction 5 with 3 rules applied. Total rules applied 194 place count 39 transition count 56
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 5 with 14 rules applied. Total rules applied 208 place count 32 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 210 place count 32 transition count 62
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 212 place count 30 transition count 58
Iterating global reduction 6 with 2 rules applied. Total rules applied 214 place count 30 transition count 58
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 221 place count 30 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 229 place count 30 transition count 43
Applied a total of 229 rules in 61 ms. Remains 30 /141 variables (removed 111) and now considering 43/186 (removed 143) transitions.
[2026-06-02 03:40:34] [INFO ] Flow matrix only has 37 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3737841188993242272.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11905955981605295734.kers'
[2026-06-02 03:40:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3737841188993242272.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11905955981605295734.kers]
Normalized transition count is 36 out of 37 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 36 rows 28 cols 122 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-06-02 03:40:34] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11905955981605295734.kers
Total runtime 1 ms.
[2026-06-02 03:40:36] [INFO ] Implicit Places using invariants in 1209 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1211 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/141 places, 43/186 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
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 27 transition count 53
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 27 transition count 49
Applied a total of 8 rules in 5 ms. Remains 27 /29 variables (removed 2) and now considering 49/43 (removed -6) transitions.
[2026-06-02 03:40:36] [INFO ] Flow matrix only has 42 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-12077454069618660199.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8462394728451644207.kers'
[2026-06-02 03:40:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12077454069618660199.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8462394728451644207.kers]
Normalized transition count is 41 out of 42 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 41 rows 26 cols 170 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-06-02 03:40:36] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8462394728451644207.kers
Total runtime 0 ms.
[2026-06-02 03:40:36] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-06-02 03:40:36] [INFO ] Flow matrix only has 42 transitions (discarded 7 similar events)
[2026-06-02 03:40:36] [INFO ] Invariant cache hit.
[2026-06-02 03:40:36] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-06-02 03:40:36] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/141 places, 49/186 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1417 ms. Remains : 27/141 places, 49/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP02C02-LTLFireability-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP02C02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP02C02-LTLFireability-07 finished in 1489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(((p0||F(p1)) U (G((p0||F(p1)))||(p2&&(p0||F(p1)))))))||(F(((p0||F(p1)) U (G((p0||F(p1)))||(p2&&(p0||F(p1))))))&&F(p3)))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 186/186 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 128 transition count 171
Ensure Unique test removed 1 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 27 place count 127 transition count 171
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 31 place count 123 transition count 162
Iterating global reduction 0 with 4 rules applied. Total rules applied 35 place count 123 transition count 162
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 38 place count 120 transition count 159
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 119 transition count 159
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 116 transition count 149
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 116 transition count 149
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 114 transition count 146
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 114 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 113 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 113 transition count 145
Applied a total of 54 rules in 6 ms. Remains 113 /141 variables (removed 28) and now considering 145/186 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3713169869824866141.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1606263998813266665.kers'
[2026-06-02 03:40:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3713169869824866141.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1606263998813266665.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 145 rows 113 cols 402 entries
Finished phase 1 with 102 SingleSign rule and 1 generalized
[2026-06-02 03:40:36] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1606263998813266665.kers
Total runtime 1 ms.
[2026-06-02 03:40:36] [INFO ] Implicit Places using invariants in 69 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/141 places, 145/186 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 86 ms. Remains : 112/141 places, 145/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(((p0||F(p1)) U (G((p0||F(p1)))||(p2&&(p0||F(p1)))))))||(F(((p0||F(p1)) U (G((p0||F(p1)))||(p2&&(p0||F(p1))))))&&F(p3)))))'
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP02C02-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Product exploration explored 100000 steps with 50000 reset in 424 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 13 factoid took 14 ms. Proved property starting from automaton with 6 states, 12 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 24 ms.
FORMULA ErlangenMainframeV2-PT-bP02C02-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP02C02-LTLFireability-09 finished in 1041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U G(p1)))||(((p2 U p3) U p0)&&X(G(p0)))))'
Support contains 7 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 186/186 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 128 transition count 173
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 128 transition count 173
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 124 transition count 169
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 124 transition count 169
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 121 transition count 165
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 121 transition count 165
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 118 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 118 transition count 151
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 116 transition count 149
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 116 transition count 149
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 115 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 115 transition count 148
Applied a total of 52 rules in 12 ms. Remains 115 /141 variables (removed 26) and now considering 148/186 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7354313854027877610.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5716725457253463044.kers'
[2026-06-02 03:40:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7354313854027877610.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5716725457253463044.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 115 cols 464 entries
Finished phase 1 with 101 SingleSign rule and 2 generalized
[2026-06-02 03:40:37] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5716725457253463044.kers
Total runtime 1 ms.
[2026-06-02 03:40:37] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-06-02 03:40:37] [INFO ] Invariant cache hit.
[2026-06-02 03:40:37] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2026-06-02 03:40:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/263 variables, 115/127 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/263 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 127 constraints, problems are : Problem set: 0 solved, 147 unsolved in 8678 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/263 variables, 115/127 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 147/274 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 6/280 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 11 (OVERLAPS) 0/263 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 13 (OVERLAPS) 0/263 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/263 variables, and 286 constraints, problems are : Problem set: 0 solved, 147 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 38734ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 38737ms
Starting structural reductions in LTL mode, iteration 1 : 115/141 places, 148/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39003 ms. Remains : 115/141 places, 148/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U G(p1)))||(((p2 U p3) U p0)&&X(G(p0)))))'
Stuttering acceptance computed with spot in 385 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP02C02-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP02C02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP02C02-LTLFireability-10 finished in 39448 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(G(p0))&&F(p1))))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 186/186 transitions.
Graph (trivial) has 128 edges and 141 vertex of which 12 / 141 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 133 transition count 151
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 40 rules applied. Total rules applied 67 place count 107 transition count 137
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 75 place count 99 transition count 137
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 75 place count 99 transition count 124
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 102 place count 85 transition count 124
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 111 place count 76 transition count 113
Ensure Unique test removed 1 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 121 place count 75 transition count 113
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 121 place count 75 transition count 110
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 127 place count 72 transition count 110
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 132 place count 67 transition count 92
Ensure Unique test removed 1 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 138 place count 66 transition count 92
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 64 transition count 88
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 64 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 143 place count 63 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 63 transition count 86
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 188 place count 41 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 190 place count 41 transition count 62
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 193 place count 38 transition count 55
Iterating global reduction 4 with 3 rules applied. Total rules applied 196 place count 38 transition count 55
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 210 place count 31 transition count 79
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 222 place count 31 transition count 67
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 223 place count 30 transition count 65
Iterating global reduction 5 with 1 rules applied. Total rules applied 224 place count 30 transition count 65
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 232 place count 30 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 237 place count 30 transition count 52
Applied a total of 237 rules in 27 ms. Remains 30 /141 variables (removed 111) and now considering 52/186 (removed 134) transitions.
[2026-06-02 03:41:16] [INFO ] Flow matrix only has 45 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-18190624668342068209.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9511457591224848541.kers'
[2026-06-02 03:41:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18190624668342068209.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9511457591224848541.kers]
Normalized transition count is 44 out of 45 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 44 rows 28 cols 174 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-06-02 03:41:16] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9511457591224848541.kers
Total runtime 1 ms.
[2026-06-02 03:41:16] [INFO ] Implicit Places using invariants in 67 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/141 places, 52/186 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 27 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 27 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 26 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 26 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 26 transition count 48
Applied a total of 8 rules in 7 ms. Remains 26 /29 variables (removed 3) and now considering 48/52 (removed 4) transitions.
[2026-06-02 03:41:16] [INFO ] Flow matrix only has 41 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-1924402418042284228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11596984538253409146.kers'
[2026-06-02 03:41:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1924402418042284228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11596984538253409146.kers]
Normalized transition count is 40 out of 41 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 40 rows 25 cols 164 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-06-02 03:41:16] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11596984538253409146.kers
Total runtime 1 ms.
[2026-06-02 03:41:16] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-06-02 03:41:16] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
[2026-06-02 03:41:16] [INFO ] Invariant cache hit.
[2026-06-02 03:41:17] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-06-02 03:41:17] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/141 places, 48/186 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 245 ms. Remains : 26/141 places, 48/186 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(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP02C02-LTLFireability-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP02C02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP02C02-LTLFireability-11 finished in 426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||G(p2)||p0)))'
Support contains 7 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 186/186 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 127 transition count 170
Ensure Unique test removed 1 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 29 place count 126 transition count 170
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 33 place count 122 transition count 166
Iterating global reduction 0 with 4 rules applied. Total rules applied 37 place count 122 transition count 166
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 41 place count 118 transition count 162
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 117 transition count 162
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 114 transition count 148
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 114 transition count 148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 112 transition count 146
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 112 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 110 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 110 transition count 144
Applied a total of 60 rules in 11 ms. Remains 110 /141 variables (removed 31) and now considering 144/186 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2689261772695783617.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9550652621825257959.kers'
[2026-06-02 03:41:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2689261772695783617.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9550652621825257959.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 144 rows 110 cols 420 entries
Finished phase 1 with 99 SingleSign rule and 1 generalized
[2026-06-02 03:41:17] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9550652621825257959.kers
Total runtime 2 ms.
[2026-06-02 03:41:17] [INFO ] Implicit Places using invariants in 93 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 109/141 places, 144/186 transitions.
Applied a total of 0 rules in 1 ms. Remains 109 /109 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 109/141 places, 144/186 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(p1)||G(p2)||p0)))'
Stuttering acceptance computed with spot in 240 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP02C02-LTLFireability-12
Entered a terminal (fully accepting) state of product in 94 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP02C02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP02C02-LTLFireability-12 finished in 388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 186/186 transitions.
Graph (trivial) has 130 edges and 141 vertex of which 12 / 141 are part of one of the 5 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 133 transition count 150
Reduce places removed 27 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 42 rules applied. Total rules applied 70 place count 106 transition count 135
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 78 place count 98 transition count 135
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 78 place count 98 transition count 121
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 107 place count 83 transition count 121
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 115 place count 75 transition count 111
Ensure Unique test removed 1 places
Iterating global reduction 3 with 9 rules applied. Total rules applied 124 place count 74 transition count 111
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 74 transition count 109
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 72 transition count 109
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 132 place count 68 transition count 95
Ensure Unique test removed 1 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 137 place count 67 transition count 95
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 65 transition count 91
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 65 transition count 91
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 64 transition count 89
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 64 transition count 89
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 3 with 46 rules applied. Total rules applied 189 place count 41 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 191 place count 41 transition count 64
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 194 place count 38 transition count 54
Iterating global reduction 4 with 3 rules applied. Total rules applied 197 place count 38 transition count 54
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -7
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 209 place count 32 transition count 61
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 216 place count 32 transition count 54
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 217 place count 31 transition count 52
Iterating global reduction 5 with 1 rules applied. Total rules applied 218 place count 31 transition count 52
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 221 place count 31 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 223 place count 30 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 228 place count 30 transition count 55
Applied a total of 228 rules in 33 ms. Remains 30 /141 variables (removed 111) and now considering 55/186 (removed 131) transitions.
[2026-06-02 03:41:17] [INFO ] Flow matrix only has 48 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-1973287940722466406.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15602117141023774230.kers'
[2026-06-02 03:41:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1973287940722466406.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15602117141023774230.kers]
Normalized transition count is 47 out of 48 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 47 rows 28 cols 184 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-06-02 03:41:17] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15602117141023774230.kers
Total runtime 1 ms.
[2026-06-02 03:41:17] [INFO ] Implicit Places using invariants in 72 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/141 places, 55/186 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 27 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 27 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 26 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 26 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 26 transition count 51
Applied a total of 8 rules in 7 ms. Remains 26 /29 variables (removed 3) and now considering 51/55 (removed 4) transitions.
[2026-06-02 03:41:17] [INFO ] Flow matrix only has 44 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-3394448892714726025.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11488008995624309840.kers'
[2026-06-02 03:41:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3394448892714726025.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11488008995624309840.kers]
Normalized transition count is 43 out of 44 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 43 rows 25 cols 174 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-06-02 03:41:17] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11488008995624309840.kers
Total runtime 2 ms.
[2026-06-02 03:41:17] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-06-02 03:41:17] [INFO ] Flow matrix only has 44 transitions (discarded 7 similar events)
[2026-06-02 03:41:17] [INFO ] Invariant cache hit.
[2026-06-02 03:41:17] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-06-02 03:41:17] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/141 places, 51/186 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 259 ms. Remains : 26/141 places, 51/186 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 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP02C02-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP02C02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP02C02-LTLFireability-13 finished in 401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G((p0||X(X(p1)))) U p2) U X(p1))))'
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 186/186 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 127 transition count 170
Ensure Unique test removed 1 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 29 place count 126 transition count 170
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 33 place count 122 transition count 161
Iterating global reduction 0 with 4 rules applied. Total rules applied 37 place count 122 transition count 161
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 41 place count 118 transition count 156
Iterating global reduction 0 with 4 rules applied. Total rules applied 45 place count 118 transition count 156
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 48 place count 115 transition count 144
Iterating global reduction 0 with 3 rules applied. Total rules applied 51 place count 115 transition count 144
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 53 place count 113 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 55 place count 113 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 57 place count 111 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 59 place count 111 transition count 140
Applied a total of 59 rules in 9 ms. Remains 111 /141 variables (removed 30) and now considering 140/186 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13213454029105508906.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2552609899194236325.kers'
[2026-06-02 03:41:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13213454029105508906.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2552609899194236325.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 140 rows 111 cols 398 entries
Finished phase 1 with 98 SingleSign rule and 2 generalized
[2026-06-02 03:41:18] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2552609899194236325.kers
Total runtime 2 ms.
[2026-06-02 03:41:18] [INFO ] Implicit Places using invariants in 95 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/141 places, 140/186 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 110/141 places, 140/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G((p0||X(X(p1)))) U p2) U X(p1))))'
Stuttering acceptance computed with spot in 519 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP02C02-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 90 ms.
Product exploration explored 100000 steps with 0 reset in 103 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Detected a total of 14/110 stabilizing places and 14/140 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 11 factoid took 170 ms. Reduced automaton from 10 states, 19 edges and 3 AP (stutter sensitive) to 10 states, 17 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 448 ms. (89 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3211176758071262845.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17579812002516619797.kers'
[2026-06-02 03:41:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3211176758071262845.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17579812002516619797.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 140 rows 110 cols 392 entries
Finished phase 1 with 98 SingleSign rule and 2 generalized
[2026-06-02 03:41:19] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17579812002516619797.kers
Total runtime 3 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 66/95 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/110 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf4 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 110/250 variables, and 11 constraints, problems are : Problem set: 2 solved, 0 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 201ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 13 factoid took 221 ms. Reduced automaton from 10 states, 17 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 433 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2)]
[2026-06-02 03:41:20] [INFO ] Invariant cache hit.
[2026-06-02 03:41:20] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-06-02 03:41:20] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 5 ms returned unsat
Proved EG (NOT p1) asserting that LTL formula F !(NOT p1) is false.
Negative knowledge disproves property using: (F p1)
Knowledge-based reduction took 1447 ms.
FORMULA ErlangenMainframeV2-PT-bP02C02-LTLFireability-15 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP02C02-LTLFireability-15 finished in 2327 ms.
All properties solved by simple procedures.
Total runtime 98200 ms.

BK_STOP 1780371680415

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-bP02C02"
export BK_EXAMINATION="LTLFireability"
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-bP02C02, examination is LTLFireability"
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-178021499200220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV2-PT-bP02C02.tgz
mv ErlangenMainframeV2-PT-bP02C02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;