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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 101M
-rw-r--r-- 1 mcc users 5.8K May 27 09:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 27 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 27 09:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 27 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 27 10:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 17K May 27 09:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K May 27 09:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 27 09:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 27 09:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:44 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 100M 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-bP10C08-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1780402595820

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP10C08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-06-02 12:16:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-02 12:16:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 12:16:43] [INFO ] Load time of PNML (sax parser for PT used): 4944 ms
[2026-06-02 12:16:43] [INFO ] Transformed 345 places.
[2026-06-02 12:16:44] [INFO ] Transformed 79094 transitions.
[2026-06-02 12:16:44] [INFO ] Found NUPN structural information;
[2026-06-02 12:16:44] [INFO ] Parsed PT model containing 345 places and 79094 transitions and 1995500 arcs in 5956 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 345/345 places, 79094/79094 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 283 transition count 79032
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 283 transition count 79032
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 160 place count 247 transition count 78996
Iterating global reduction 0 with 36 rules applied. Total rules applied 196 place count 247 transition count 78996
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 208 place count 235 transition count 53037
Ensure Unique test removed 3 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 223 place count 232 transition count 53037
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 235 place count 220 transition count 1106
Iterating global reduction 0 with 12 rules applied. Total rules applied 247 place count 220 transition count 1106
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 252 place count 215 transition count 1099
Iterating global reduction 0 with 5 rules applied. Total rules applied 257 place count 215 transition count 1099
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 259 place count 213 transition count 1097
Iterating global reduction 0 with 2 rules applied. Total rules applied 261 place count 213 transition count 1097
Applied a total of 261 rules in 27037 ms. Remains 213 /345 variables (removed 132) and now considering 1097/79094 (removed 77997) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-264136988887995528.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2430442988546483885.kers'
[2026-06-02 12:17:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-264136988887995528.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2430442988546483885.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1097 rows 213 cols 19918 entries
Finished phase 1 with 185 SingleSign rule and 3 generalized
[2026-06-02 12:17:12] [INFO ] Computed 25 invariants in 14 ms
Computed 25 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-2430442988546483885.kers
Total runtime 18 ms.
[2026-06-02 12:17:14] [INFO ] Implicit Places using invariants in 2124 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2214 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/345 places, 1097/79094 transitions.
Applied a total of 0 rules in 10 ms. Remains 212 /212 variables (removed 0) and now considering 1097/1097 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29286 ms. Remains : 212/345 places, 1097/79094 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 1097/1097 transitions.
Applied a total of 0 rules in 9 ms. Remains 212 /212 variables (removed 0) and now considering 1097/1097 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12252612170676050096.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2504494819744886185.kers'
[2026-06-02 12:17:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12252612170676050096.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2504494819744886185.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 1097 rows 212 cols 19054 entries
Finished phase 1 with 185 SingleSign rule and 3 generalized
[2026-06-02 12:17:14] [INFO ] Computed 24 invariants in 19 ms
Computed 24 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-2504494819744886185.kers
Total runtime 24 ms.
[2026-06-02 12:17:15] [INFO ] Implicit Places using invariants in 984 ms returned []
[2026-06-02 12:17:15] [INFO ] Invariant cache hit.
[2026-06-02 12:17:17] [INFO ] Implicit Places using invariants and state equation in 1730 ms returned []
Implicit Place search using SMT with State Equation took 2728 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2026-06-02 12:17:17] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (OVERLAPS) 1/212 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
SMT process timed out in 32930ms, After SMT, problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 32982ms
Finished structural reductions in LTL mode , in 1 iterations and 35766 ms. Remains : 212/212 places, 1097/1097 transitions.
Support contains 35 out of 212 places after structural reductions.
[2026-06-02 12:17:51] [INFO ] Flatten gal took : 557 ms
[2026-06-02 12:17:51] [INFO ] Flatten gal took : 231 ms
[2026-06-02 12:17:52] [INFO ] Input system was already deterministic with 1097 transitions.
RANDOM walk for 40000 steps (8 resets) in 4580 ms. (8 steps per ms) remains 7/21 properties
BEST_FIRST walk for 40002 steps (8 resets) in 522 ms. (76 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 662 ms. (60 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 219 ms. (181 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 679 ms. (58 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 227 ms. (175 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 549 ms. (72 steps per ms) remains 4/5 properties
[2026-06-02 12:17:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 30/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 87/126 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 86/212 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1097/1309 variables, 212/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1309 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1309 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 236 constraints, problems are : Problem set: 0 solved, 4 unsolved in 779 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 30/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 87/126 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 86/212 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1097/1309 variables, 212/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1309 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 244 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5824ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 1097/1097 transitions.
Graph (trivial) has 171 edges and 212 vertex of which 11 / 212 are part of one of the 5 SCC in 14 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 206 transition count 1046
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 50 rules applied. Total rules applied 90 place count 167 transition count 1035
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 97 place count 161 transition count 1034
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 160 transition count 1034
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 98 place count 160 transition count 1023
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 120 place count 149 transition count 1023
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 130 place count 139 transition count 776
Ensure Unique test removed 2 places
Iterating global reduction 4 with 12 rules applied. Total rules applied 142 place count 137 transition count 776
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 142 place count 137 transition count 774
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 146 place count 135 transition count 774
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 152 place count 129 transition count 254
Ensure Unique test removed 2 places
Iterating global reduction 4 with 8 rules applied. Total rules applied 160 place count 127 transition count 254
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 163 place count 124 transition count 174
Iterating global reduction 4 with 3 rules applied. Total rules applied 166 place count 124 transition count 174
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 262 place count 76 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 266 place count 76 transition count 122
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 269 place count 73 transition count 115
Iterating global reduction 5 with 3 rules applied. Total rules applied 272 place count 73 transition count 115
Performed 8 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 288 place count 65 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 289 place count 65 transition count 122
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 291 place count 63 transition count 118
Iterating global reduction 6 with 2 rules applied. Total rules applied 293 place count 63 transition count 118
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 299 place count 63 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 7 with 18 rules applied. Total rules applied 317 place count 63 transition count 94
Free-agglomeration rule applied 13 times.
Iterating global reduction 7 with 13 rules applied. Total rules applied 330 place count 63 transition count 81
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 359 place count 50 transition count 65
Ensure Unique test removed 3 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 362 place count 47 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 365 place count 47 transition count 62
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 367 place count 47 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 369 place count 45 transition count 78
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 371 place count 45 transition count 78
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 372 place count 45 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 373 place count 45 transition count 76
Applied a total of 373 rules in 374 ms. Remains 45 /212 variables (removed 167) and now considering 76/1097 (removed 1021) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 374 ms. Remains : 45/212 places, 76/1097 transitions.
RANDOM walk for 321 steps (0 resets) in 20 ms. (15 steps per ms) remains 0/4 properties
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 25 stabilizing places and 25 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p0)&&(X(X(!p1)) U ((X(X(!p1))&&(!p2 U (p3||G(!p2))))||X(X(G(!p1)))))))))'
Support contains 6 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 1097/1097 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 192 transition count 887
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 192 transition count 887
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 182 transition count 425
Ensure Unique test removed 2 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 180 transition count 425
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 174 transition count 261
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 75 place count 173 transition count 261
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 77 place count 171 transition count 229
Iterating global reduction 0 with 2 rules applied. Total rules applied 79 place count 171 transition count 229
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 81 place count 169 transition count 225
Iterating global reduction 0 with 2 rules applied. Total rules applied 83 place count 169 transition count 225
Applied a total of 83 rules in 30 ms. Remains 169 /212 variables (removed 43) and now considering 225/1097 (removed 872) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1136152808688807100.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8975328396373804181.kers'
[2026-06-02 12:18:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1136152808688807100.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8975328396373804181.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 225 rows 169 cols 998 entries
Finished phase 1 with 146 SingleSign rule and 2 generalized
[2026-06-02 12:18:01] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8975328396373804181.kers
Total runtime 5 ms.
[2026-06-02 12:18:01] [INFO ] Implicit Places using invariants in 175 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 179 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/212 places, 225/1097 transitions.
Applied a total of 0 rules in 4 ms. Remains 168 /168 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 213 ms. Remains : 168/212 places, 225/1097 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((X(p0)&&(X(X(!p1)) U ((X(X(!p1))&&(!p2 U (p3||G(!p2))))||X(X(G(!p1)))))))))'
Stuttering acceptance computed with spot in 1251 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, p1, (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), p1, p1, (AND (NOT p0) (NOT p3) p2 p1), (AND (NOT p0) (NOT p3) p2 (NOT p1))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP10C08-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 517 ms.
Stack based approach found an accepted trace after 155 steps with 0 reset with depth 156 and stack size 156 in 2 ms.
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP10C08-LTLCardinality-00 finished in 2244 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 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 1097/1097 transitions.
Graph (trivial) has 182 edges and 212 vertex of which 9 / 212 are part of one of the 4 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 206 transition count 1048
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 53 rules applied. Total rules applied 96 place count 164 transition count 1037
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 102 place count 158 transition count 1037
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 102 place count 158 transition count 1026
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 124 place count 147 transition count 1026
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 137 place count 134 transition count 753
Ensure Unique test removed 3 places
Iterating global reduction 3 with 16 rules applied. Total rules applied 153 place count 131 transition count 753
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 153 place count 131 transition count 752
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 130 transition count 752
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 164 place count 121 transition count 201
Ensure Unique test removed 4 places
Iterating global reduction 3 with 13 rules applied. Total rules applied 177 place count 117 transition count 201
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 183 place count 111 transition count 153
Iterating global reduction 3 with 6 rules applied. Total rules applied 189 place count 111 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 190 place count 110 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 191 place count 110 transition count 151
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 295 place count 58 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 299 place count 58 transition count 95
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 302 place count 55 transition count 88
Iterating global reduction 4 with 3 rules applied. Total rules applied 305 place count 55 transition count 88
Performed 10 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 325 place count 45 transition count 106
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 337 place count 45 transition count 94
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 339 place count 43 transition count 90
Iterating global reduction 5 with 2 rules applied. Total rules applied 341 place count 43 transition count 90
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 351 place count 43 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 353 place count 42 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 6 with 26 rules applied. Total rules applied 379 place count 42 transition count 67
Applied a total of 379 rules in 136 ms. Remains 42 /212 variables (removed 170) and now considering 67/1097 (removed 1030) transitions.
[2026-06-02 12:18:03] [INFO ] Flow matrix only has 48 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4394391100933284326.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3273373194792121467.kers'
[2026-06-02 12:18:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4394391100933284326.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3273373194792121467.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 40 cols 268 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-06-02 12:18:03] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3273373194792121467.kers
Total runtime 1 ms.
[2026-06-02 12:18:03] [INFO ] Implicit Places using invariants in 64 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/212 places, 67/1097 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
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 39 transition count 81
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 12 place count 39 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 38 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 38 transition count 71
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 22 place count 38 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 29 place count 38 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 37 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 36 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 35 place count 36 transition count 51
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 36 place count 36 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 37 place count 35 transition count 50
Applied a total of 37 rules in 18 ms. Remains 35 /41 variables (removed 6) and now considering 50/67 (removed 17) transitions.
[2026-06-02 12:18:03] [INFO ] Flow matrix only has 34 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10013209471679552787.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-300029239236913978.kers'
[2026-06-02 12:18:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10013209471679552787.kers, --Pflows, --basisKERS=/tmp/petrispot-output-300029239236913978.kers]
Normalized transition count is 33 out of 34 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 33 rows 22 cols 75 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-06-02 12:18:03] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-300029239236913978.kers
Total runtime 2 ms.
[2026-06-02 12:18:03] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-06-02 12:18:03] [INFO ] Flow matrix only has 34 transitions (discarded 16 similar events)
[2026-06-02 12:18:03] [INFO ] Invariant cache hit.
[2026-06-02 12:18:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-06-02 12:18:03] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/212 places, 50/1097 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 377 ms. Remains : 35/212 places, 50/1097 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 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP10C08-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP10C08-LTLCardinality-02 finished in 522 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((G((X(X(X(X(p1))))||p0))||F(p2))))'
Support contains 5 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 1097/1097 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 190 transition count 838
Ensure Unique test removed 1 places
Iterating global reduction 0 with 23 rules applied. Total rules applied 45 place count 189 transition count 838
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 58 place count 176 transition count 361
Ensure Unique test removed 2 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 73 place count 174 transition count 361
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 80 place count 167 transition count 239
Ensure Unique test removed 2 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 89 place count 165 transition count 239
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 93 place count 161 transition count 207
Iterating global reduction 0 with 4 rules applied. Total rules applied 97 place count 161 transition count 207
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 99 place count 159 transition count 203
Iterating global reduction 0 with 2 rules applied. Total rules applied 101 place count 159 transition count 203
Applied a total of 101 rules in 31 ms. Remains 159 /212 variables (removed 53) and now considering 203/1097 (removed 894) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9007175522430716949.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8340267780900385774.kers'
[2026-06-02 12:18:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9007175522430716949.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8340267780900385774.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 203 rows 159 cols 678 entries
Finished phase 1 with 138 SingleSign rule and 2 generalized
[2026-06-02 12:18:03] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8340267780900385774.kers
Total runtime 2 ms.
[2026-06-02 12:18:03] [INFO ] Implicit Places using invariants in 99 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 158/212 places, 203/1097 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 158/212 places, 203/1097 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((G((X(X(X(X(p1))))||p0))||F(p2))))'
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP10C08-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 227 ms.
Product exploration explored 100000 steps with 0 reset in 272 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 490 ms. (81 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 278 ms. (143 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 288 ms. (138 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-18120652911302403020.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16760234418649384685.kers'
[2026-06-02 12:18:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18120652911302403020.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16760234418649384685.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 203 rows 158 cols 670 entries
Finished phase 1 with 138 SingleSign rule and 2 generalized
[2026-06-02 12:18:05] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16760234418649384685.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
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) 25/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 68/96 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/158 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 203/361 variables, 158/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/361 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 176 constraints, problems are : Problem set: 0 solved, 2 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 25/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 68/96 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/158 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 203/361 variables, 158/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/361 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 178 constraints, problems are : Problem set: 0 solved, 2 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 561ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 58 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=19 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 12 ms.
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Knowledge-based reduction took 1572 ms.
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 203/203 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2026-06-02 12:18:06] [INFO ] Invariant cache hit.
[2026-06-02 12:18:06] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-06-02 12:18:06] [INFO ] Invariant cache hit.
[2026-06-02 12:18:06] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2026-06-02 12:18:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 203/361 variables, 158/177 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 177 constraints, problems are : Problem set: 0 solved, 202 unsolved in 15987 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 203/361 variables, 158/177 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 202/379 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 15/394 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/361 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 396 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 46069ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 46071ms
Finished structural reductions in LTL mode , in 1 iterations and 46423 ms. Remains : 158/158 places, 203/203 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 266 ms. (149 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
[2026-06-02 12:18:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 25/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 68/96 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/158 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 203/361 variables, 158/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/361 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 176 constraints, problems are : Problem set: 0 solved, 2 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 25/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 68/96 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/158 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 203/361 variables, 158/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/361 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 178 constraints, problems are : Problem set: 0 solved, 2 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 539ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 59 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=59 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 2 ms.
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Knowledge-based reduction took 1321 ms.
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 158 ms.
Product exploration explored 100000 steps with 0 reset in 184 ms.
Spot run failed in 154 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin13927984955795653351
[2026-06-02 12:18:55] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13927984955795653351
Running compilation step : cd /tmp/ltsmin13927984955795653351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1027 ms.
Running link step : cd /tmp/ltsmin13927984955795653351;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin13927984955795653351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased2260348055036018421.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 158 /158 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2026-06-02 12:19:10] [INFO ] Invariant cache hit.
[2026-06-02 12:19:10] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-06-02 12:19:10] [INFO ] Invariant cache hit.
[2026-06-02 12:19:10] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 158/158 places, 203/203 transitions.
Built C files in :
/tmp/ltsmin14086277160968451707
[2026-06-02 12:19:10] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14086277160968451707
Running compilation step : cd /tmp/ltsmin14086277160968451707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 508 ms.
Running link step : cd /tmp/ltsmin14086277160968451707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14086277160968451707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased11294664324104224852.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-06-02 12:19:26] [INFO ] Flatten gal took : 10 ms
[2026-06-02 12:19:26] [INFO ] Flatten gal took : 9 ms
[2026-06-02 12:19:26] [INFO ] Time to serialize gal into /tmp/LTL16751812958496689345.gal : 5 ms
[2026-06-02 12:19:26] [INFO ] Time to serialize properties into /tmp/LTL16329602867263288710.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16751812958496689345.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17439969898124283006.hoa' '-atoms' '/tmp/LTL16329602867263288710.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16329602867263288710.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17439969898124283006.hoa
Reverse transition relation is NOT exact ! Due to transitions t24, t29, t34, t43, t49, t85, t89, t100, t111, t113, t115, t117, t120, t122, t126, t129, t131...430
Detected timeout of ITS tools.
[2026-06-02 12:19:41] [INFO ] Flatten gal took : 8 ms
[2026-06-02 12:19:41] [INFO ] Flatten gal took : 7 ms
[2026-06-02 12:19:41] [INFO ] Time to serialize gal into /tmp/LTL9742949831052135149.gal : 4 ms
[2026-06-02 12:19:41] [INFO ] Time to serialize properties into /tmp/LTL9347059210859148276.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9742949831052135149.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9347059210859148276.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((G(("((p96==0)||(p138==1))")||(X(X(X(X("((p275==0)||(p88==1))")))))))||(F("(p306==1)")))))
Formula 0 simplified : F(F(!"((p96==0)||(p138==1))" & XXXX!"((p275==0)||(p88==1))") & G!"(p306==1)")
Reverse transition relation is NOT exact ! Due to transitions t24, t29, t34, t43, t49, t85, t89, t100, t111, t113, t115, t117, t120, t122, t126, t129, t131...430
Detected timeout of ITS tools.
[2026-06-02 12:19:56] [INFO ] Flatten gal took : 9 ms
[2026-06-02 12:19:56] [INFO ] Applying decomposition
[2026-06-02 12:19:56] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16652307755168917717.txt' '-o' '/tmp/graph16652307755168917717.bin' '-w' '/tmp/graph16652307755168917717.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16652307755168917717.bin' '-l' '-1' '-v' '-w' '/tmp/graph16652307755168917717.weights' '-q' '0' '-e' '0.001'
[2026-06-02 12:19:56] [INFO ] Decomposing Gal with order
[2026-06-02 12:19:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 12:19:56] [INFO ] Removed a total of 195 redundant transitions.
[2026-06-02 12:19:56] [INFO ] Flatten gal took : 100 ms
[2026-06-02 12:19:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 16 ms.
[2026-06-02 12:19:56] [INFO ] Time to serialize gal into /tmp/LTL511281210728996153.gal : 7 ms
[2026-06-02 12:19:56] [INFO ] Time to serialize properties into /tmp/LTL15164218201952718259.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL511281210728996153.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15164218201952718259.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((G(("((i3.u17.p96==0)||(i6.u23.p138==1))")||(X(X(X(X("((i13.i1.u36.p275==0)||(i14.i0.u1.p88==1))")))))))||(F("(i12.i0.u48.p306==1...162
Formula 0 simplified : F(F(!"((i3.u17.p96==0)||(i6.u23.p138==1))" & XXXX!"((i13.i1.u36.p275==0)||(i14.i0.u1.p88==1))") & G!"(i12.i0.u48.p306==1)")
Reverse transition relation is NOT exact ! Due to transitions t43, t85, t152, t343, t639, t927, i0.t1074, i0.t158, i0.u8.t156, i0.u11.t149, i0.u11.t151, i0...635
44 unique states visited
44 strongly connected components in search stack
45 transitions explored
44 items max in DFS search stack
30 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.342929,28304,1,0,23997,701,2816,32885,376,1972,60086
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ErlangenMainframeV2-PT-bP10C08-LTLCardinality-03 finished in 113362 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(p1) U (p2&&X(p3)))||G(p3)||p0)))'
Support contains 9 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 1097/1097 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 197 transition count 845
Ensure Unique test removed 1 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 31 place count 196 transition count 845
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 41 place count 186 transition count 335
Ensure Unique test removed 1 places
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 185 transition count 335
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 181 transition count 269
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 61 place count 180 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 64 place count 177 transition count 235
Iterating global reduction 0 with 3 rules applied. Total rules applied 67 place count 177 transition count 235
Applied a total of 67 rules in 20 ms. Remains 177 /212 variables (removed 35) and now considering 235/1097 (removed 862) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11715076676547461741.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12711013273292338858.kers'
[2026-06-02 12:19:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11715076676547461741.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12711013273292338858.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 235 rows 177 cols 1018 entries
Finished phase 1 with 154 SingleSign rule and 2 generalized
[2026-06-02 12:19:57] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12711013273292338858.kers
Total runtime 2 ms.
[2026-06-02 12:19:57] [INFO ] Implicit Places using invariants in 154 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 155 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 176/212 places, 235/1097 transitions.
Applied a total of 0 rules in 2 ms. Remains 176 /176 variables (removed 0) and now considering 235/235 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 177 ms. Remains : 176/212 places, 235/1097 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(p1) U (p2&&X(p3)))||G(p3)||p0)))'
Stuttering acceptance computed with spot in 376 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true, (NOT p1), (NOT p3), (OR (NOT p2) (NOT p3)), (NOT p3), (OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP10C08-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 181 ms.
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 25 factoid took 14 ms. Proved property starting from automaton with 10 states, 32 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 22 ms.
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP10C08-LTLCardinality-04 finished in 1038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 1097/1097 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 188 transition count 813
Ensure Unique test removed 2 places
Iterating global reduction 0 with 26 rules applied. Total rules applied 50 place count 186 transition count 813
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 65 place count 171 transition count 258
Ensure Unique test removed 2 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 169 transition count 258
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 90 place count 161 transition count 211
Ensure Unique test removed 2 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 100 place count 159 transition count 211
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 155 transition count 199
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 155 transition count 199
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 153 transition count 195
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 153 transition count 195
Applied a total of 112 rules in 22 ms. Remains 153 /212 variables (removed 59) and now considering 195/1097 (removed 902) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1458983103420404318.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14089211817938536081.kers'
[2026-06-02 12:19:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1458983103420404318.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14089211817938536081.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 153 cols 586 entries
Finished phase 1 with 134 SingleSign rule and 1 generalized
[2026-06-02 12:19:58] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14089211817938536081.kers
Total runtime 2 ms.
[2026-06-02 12:19:58] [INFO ] Implicit Places using invariants in 92 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/212 places, 195/1097 transitions.
Applied a total of 0 rules in 1 ms. Remains 152 /152 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 152/212 places, 195/1097 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP10C08-LTLCardinality-05
Product exploration explored 100000 steps with 33333 reset in 114 ms.
Product exploration explored 100000 steps with 33333 reset in 155 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Detected a total of 22/152 stabilizing places and 22/195 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 13 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP10C08-LTLCardinality-05 finished in 551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 1097/1097 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 190 transition count 815
Ensure Unique test removed 2 places
Iterating global reduction 0 with 24 rules applied. Total rules applied 46 place count 188 transition count 815
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 60 place count 174 transition count 261
Ensure Unique test removed 2 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 76 place count 172 transition count 261
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 164 transition count 214
Ensure Unique test removed 2 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 94 place count 162 transition count 214
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 98 place count 158 transition count 202
Iterating global reduction 0 with 4 rules applied. Total rules applied 102 place count 158 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 104 place count 156 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 106 place count 156 transition count 198
Applied a total of 106 rules in 21 ms. Remains 156 /212 variables (removed 56) and now considering 198/1097 (removed 899) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13768553724898830757.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13999801584701868978.kers'
[2026-06-02 12:19:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13768553724898830757.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13999801584701868978.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 198 rows 156 cols 592 entries
Finished phase 1 with 137 SingleSign rule and 1 generalized
[2026-06-02 12:19:58] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13999801584701868978.kers
Total runtime 2 ms.
[2026-06-02 12:19:58] [INFO ] Implicit Places using invariants in 99 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/212 places, 198/1097 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 155/212 places, 198/1097 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP10C08-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP10C08-LTLCardinality-09 finished in 275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 1097/1097 transitions.
Graph (trivial) has 178 edges and 212 vertex of which 11 / 212 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 205 transition count 1051
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 49 rules applied. Total rules applied 88 place count 167 transition count 1040
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 94 place count 161 transition count 1040
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 94 place count 161 transition count 1029
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 116 place count 150 transition count 1029
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 129 place count 137 transition count 756
Ensure Unique test removed 3 places
Iterating global reduction 3 with 16 rules applied. Total rules applied 145 place count 134 transition count 756
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 145 place count 134 transition count 755
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 133 transition count 755
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 156 place count 124 transition count 204
Ensure Unique test removed 4 places
Iterating global reduction 3 with 13 rules applied. Total rules applied 169 place count 120 transition count 204
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 175 place count 114 transition count 156
Iterating global reduction 3 with 6 rules applied. Total rules applied 181 place count 114 transition count 156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 182 place count 113 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 183 place count 113 transition count 154
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 287 place count 61 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 290 place count 61 transition count 99
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 293 place count 58 transition count 92
Iterating global reduction 4 with 3 rules applied. Total rules applied 296 place count 58 transition count 92
Performed 10 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 316 place count 48 transition count 110
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 328 place count 48 transition count 98
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 330 place count 46 transition count 94
Iterating global reduction 5 with 2 rules applied. Total rules applied 332 place count 46 transition count 94
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 342 place count 46 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 360 place count 46 transition count 66
Applied a total of 360 rules in 134 ms. Remains 46 /212 variables (removed 166) and now considering 66/1097 (removed 1031) transitions.
[2026-06-02 12:19:59] [INFO ] Flow matrix only has 47 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6674914109438892699.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9285651738459958979.kers'
[2026-06-02 12:19:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6674914109438892699.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9285651738459958979.kers]
Normalized transition count is 46 out of 47 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 46 rows 44 cols 210 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-06-02 12:19:59] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9285651738459958979.kers
Total runtime 1 ms.
[2026-06-02 12:19:59] [INFO ] Implicit Places using invariants in 66 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/212 places, 66/1097 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 44 transition count 66
Applied a total of 2 rules in 6 ms. Remains 44 /45 variables (removed 1) and now considering 66/66 (removed 0) transitions.
[2026-06-02 12:19:59] [INFO ] Flow matrix only has 47 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5663345141424769521.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5068739289458784748.kers'
[2026-06-02 12:19:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5663345141424769521.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5068739289458784748.kers]
Normalized transition count is 46 out of 47 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 46 rows 43 cols 228 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-06-02 12:19:59] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5068739289458784748.kers
Total runtime 2 ms.
[2026-06-02 12:19:59] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-06-02 12:19:59] [INFO ] Flow matrix only has 47 transitions (discarded 19 similar events)
[2026-06-02 12:19:59] [INFO ] Invariant cache hit.
[2026-06-02 12:19:59] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-06-02 12:19:59] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/212 places, 66/1097 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 401 ms. Remains : 44/212 places, 66/1097 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP10C08-LTLCardinality-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP10C08-LTLCardinality-10 finished in 574 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 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 1097/1097 transitions.
Graph (trivial) has 182 edges and 212 vertex of which 10 / 212 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 206 transition count 1049
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 53 rules applied. Total rules applied 96 place count 164 transition count 1038
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 102 place count 158 transition count 1038
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 102 place count 158 transition count 1027
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 124 place count 147 transition count 1027
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 137 place count 134 transition count 754
Ensure Unique test removed 3 places
Iterating global reduction 3 with 16 rules applied. Total rules applied 153 place count 131 transition count 754
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 153 place count 131 transition count 753
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 130 transition count 753
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 164 place count 121 transition count 202
Ensure Unique test removed 4 places
Iterating global reduction 3 with 13 rules applied. Total rules applied 177 place count 117 transition count 202
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 183 place count 111 transition count 154
Iterating global reduction 3 with 6 rules applied. Total rules applied 189 place count 111 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 190 place count 110 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 191 place count 110 transition count 152
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 295 place count 58 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 299 place count 58 transition count 96
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 302 place count 55 transition count 89
Iterating global reduction 4 with 3 rules applied. Total rules applied 305 place count 55 transition count 89
Performed 10 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 325 place count 45 transition count 107
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 337 place count 45 transition count 95
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 339 place count 43 transition count 91
Iterating global reduction 5 with 2 rules applied. Total rules applied 341 place count 43 transition count 91
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 351 place count 43 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 353 place count 42 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 6 with 33 rules applied. Total rules applied 386 place count 42 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 387 place count 41 transition count 60
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 389 place count 39 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 393 place count 37 transition count 66
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 397 place count 37 transition count 62
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 398 place count 36 transition count 60
Iterating global reduction 8 with 1 rules applied. Total rules applied 399 place count 36 transition count 60
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 403 place count 36 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 408 place count 36 transition count 51
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 409 place count 36 transition count 50
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 2 rules applied. Total rules applied 411 place count 35 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 412 place count 34 transition count 49
Applied a total of 412 rules in 128 ms. Remains 34 /212 variables (removed 178) and now considering 49/1097 (removed 1048) transitions.
[2026-06-02 12:19:59] [INFO ] Flow matrix only has 33 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10686134879264402927.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3207529621318752555.kers'
[2026-06-02 12:19:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10686134879264402927.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3207529621318752555.kers]
Normalized transition count is 32 out of 33 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 32 rows 21 cols 73 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-06-02 12:19:59] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3207529621318752555.kers
Total runtime 2 ms.
[2026-06-02 12:19:59] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-06-02 12:19:59] [INFO ] Flow matrix only has 33 transitions (discarded 16 similar events)
[2026-06-02 12:19:59] [INFO ] Invariant cache hit.
[2026-06-02 12:19:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-06-02 12:19:59] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2026-06-02 12:19:59] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2026-06-02 12:19:59] [INFO ] Flow matrix only has 33 transitions (discarded 16 similar events)
[2026-06-02 12:19:59] [INFO ] Invariant cache hit.
[2026-06-02 12:19:59] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 5/34 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 32/66 variables, 34/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/66 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/67 variables, and 52 constraints, problems are : Problem set: 0 solved, 26 unsolved in 672 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 34/34 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 5/34 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 32/66 variables, 34/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/67 variables, and 78 constraints, problems are : Problem set: 0 solved, 26 unsolved in 746 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 34/34 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1428ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 1429ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/212 places, 49/1097 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1687 ms. Remains : 34/212 places, 49/1097 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 44 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP10C08-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP10C08-LTLCardinality-13 finished in 1765 ms.
All properties solved by simple procedures.
Total runtime 203033 ms.

BK_STOP 1780402801330

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ErlangenMainframeV2-PT-bP10C08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV2-PT-bP10C08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r338-smll-178021499200283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV2-PT-bP10C08.tgz
mv ErlangenMainframeV2-PT-bP10C08 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;