fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r338-smll-178021499200276
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for ErlangenMainframeV2-PT-bP09C09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6037.432 2126068.00 2297898.00 6516.00 FFTTFFFFFFFFFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 6.5K May 27 09:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 27 09:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 27 09:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 27 09:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 27 10:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 27 10:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 16K May 27 09:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K May 27 09:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 27 09:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K May 27 09:14 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 70M 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-bP09C09-LTLFireability-00
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLFireability-01
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLFireability-02
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLFireability-03
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLFireability-04
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLFireability-05
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLFireability-06
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLFireability-07
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLFireability-08
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLFireability-09
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLFireability-10
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLFireability-11
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLFireability-12
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLFireability-13
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLFireability-14
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780396594551

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP09C09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-06-02 10:36:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-02 10:36:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 10:36:39] [INFO ] Load time of PNML (sax parser for PT used): 3408 ms
[2026-06-02 10:36:39] [INFO ] Transformed 339 places.
[2026-06-02 10:36:40] [INFO ] Transformed 59407 transitions.
[2026-06-02 10:36:40] [INFO ] Found NUPN structural information;
[2026-06-02 10:36:40] [INFO ] Parsed PT model containing 339 places and 59407 transitions and 1378759 arcs in 4022 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 59407/59407 transitions.
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 77 place count 262 transition count 59330
Iterating global reduction 0 with 77 rules applied. Total rules applied 154 place count 262 transition count 59330
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 203 place count 213 transition count 59281
Iterating global reduction 0 with 49 rules applied. Total rules applied 252 place count 213 transition count 59281
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 255 place count 210 transition count 59278
Iterating global reduction 0 with 3 rules applied. Total rules applied 258 place count 210 transition count 59278
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 261 place count 207 transition count 59259
Iterating global reduction 0 with 3 rules applied. Total rules applied 264 place count 207 transition count 59259
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 267 place count 204 transition count 59256
Iterating global reduction 0 with 3 rules applied. Total rules applied 270 place count 204 transition count 59256
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 273 place count 201 transition count 59253
Iterating global reduction 0 with 3 rules applied. Total rules applied 276 place count 201 transition count 59253
Applied a total of 276 rules in 2832 ms. Remains 201 /339 variables (removed 138) and now considering 59253/59407 (removed 154) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5017164194343428681.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12970768976830813787.kers'
[2026-06-02 10:36:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5017164194343428681.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12970768976830813787.kers]
Culled 0 columns in 242 ms.
// Phase 1: matrix 59253 rows 201 cols 1378375 entries
Finished phase 1 with 172 SingleSign rule and 3 generalized
[2026-06-02 10:36:45] [INFO ] Computed 26 invariants in 1156 ms
Computed 26 P flows in 1158 ms.
Exported basis to /tmp/petrispot-output-12970768976830813787.kers
Total runtime 1338 ms.
[2026-06-02 10:36:46] [INFO ] Implicit Places using invariants in 2011 ms returned []
Implicit Place search using SMT only with invariants took 2101 ms to find 0 implicit places.
Running 59252 sub problems to find dead transitions.
[2026-06-02 10:36:47] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
SMT process timed out in 426892ms, After SMT, problems are : Problem set: 0 solved, 59252 unsolved
Search for dead transitions found 0 dead transitions in 427486ms
Starting structural reductions in LTL mode, iteration 1 : 201/339 places, 59253/59407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 432747 ms. Remains : 201/339 places, 59253/59407 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 59253/59253 transitions.
Applied a total of 0 rules in 400 ms. Remains 201 /201 variables (removed 0) and now considering 59253/59253 (removed 0) transitions.
[2026-06-02 10:43:54] [INFO ] Invariant cache hit.
[2026-06-02 10:43:54] [INFO ] Implicit Places using invariants in 168 ms returned []
Implicit Place search using SMT only with invariants took 169 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 593 ms. Remains : 201/201 places, 59253/59253 transitions.
Support contains 60 out of 201 places after structural reductions.
[2026-06-02 10:44:05] [INFO ] Flatten gal took : 9740 ms
[2026-06-02 10:44:14] [INFO ] Flatten gal took : 9169 ms
[2026-06-02 10:44:26] [INFO ] Input system was already deterministic with 59253 transitions.
Reduction of identical properties reduced properties to check from 34 to 30
RANDOM walk for 40000 steps (8 resets) in 80799 ms. (0 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 411 ms. (9 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 284 ms. (14 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 287 ms. (13 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 315 ms. (12 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 344 ms. (11 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 281 ms. (14 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 267 ms. (14 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 187 ms. (21 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 182 ms. (21 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 155 ms. (25 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 192 ms. (20 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 139 ms. (28 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 167 ms. (23 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 149 ms. (26 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 152 ms. (26 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 202 ms. (19 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 303 ms. (13 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 236 ms. (16 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 243 ms. (16 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 291 ms. (13 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 313 ms. (12 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 233 ms. (17 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 204 ms. (19 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 190 ms. (20 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 254 ms. (15 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 237 ms. (16 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 288 ms. (13 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 265 ms. (15 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 223 ms. (17 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 206 ms. (19 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 133271 steps, run timeout after 69001 ms. (steps per millisecond=1 ) properties seen :0 out of 30
Probabilistic random walk after 133271 steps, saw 22183 distinct states, run finished after 69011 ms. (steps per millisecond=1 ) properties seen :0
[2026-06-02 10:45:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 24/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 63/147 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 54/201 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 201/59454 variables, and 26 constraints, problems are : Problem set: 0 solved, 30 unsolved in 7081 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/201 constraints, PredecessorRefiner: 30/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 24/84 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 29 unsolved
SMT process timed out in 26360ms, After SMT, problems are : Problem set: 1 solved, 29 unsolved
Fused 29 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 60 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 59253/59253 transitions.
Graph (trivial) has 126 edges and 201 vertex of which 9 / 201 are part of one of the 4 SCC in 21 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 196 transition count 59217
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 35 rules applied. Total rules applied 62 place count 170 transition count 59208
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 68 place count 164 transition count 59208
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 68 place count 164 transition count 59193
Deduced a syphon composed of 15 places in 64 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 98 place count 149 transition count 59193
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 23 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 160 place count 118 transition count 59162
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 166 place count 118 transition count 59156
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 169 place count 115 transition count 59149
Iterating global reduction 4 with 3 rules applied. Total rules applied 172 place count 115 transition count 59149
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 22 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 186 place count 108 transition count 59179
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 198 place count 108 transition count 59167
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 200 place count 106 transition count 59161
Iterating global reduction 5 with 2 rules applied. Total rules applied 202 place count 106 transition count 59161
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 212 place count 106 transition count 59151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 21 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 214 place count 105 transition count 59164
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 215 place count 105 transition count 59163
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 218 place count 105 transition count 59160
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 221 place count 102 transition count 59160
Partial Post-agglomeration rule applied 9 times.
Drop transitions (Partial Post agglomeration) removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 230 place count 102 transition count 59160
Applied a total of 230 rules in 15169 ms. Remains 102 /201 variables (removed 99) and now considering 59160/59253 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15173 ms. Remains : 102/201 places, 59160/59253 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 21 stabilizing places and 21 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p1 U G(p2))&&p0))))'
Support contains 19 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 59253/59253 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 183 transition count 39571
Ensure Unique test removed 9 places
Iterating global reduction 0 with 27 rules applied. Total rules applied 45 place count 174 transition count 39571
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 48 place count 171 transition count 11869
Iterating global reduction 0 with 3 rules applied. Total rules applied 51 place count 171 transition count 11869
Applied a total of 51 rules in 8435 ms. Remains 171 /201 variables (removed 30) and now considering 11869/59253 (removed 47384) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8748062321968115906.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13091583985664253623.kers'
[2026-06-02 10:46:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8748062321968115906.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13091583985664253623.kers]
Culled 0 columns in 30 ms.
// Phase 1: matrix 11869 rows 171 cols 175538 entries
Finished phase 1 with 153 SingleSign rule and 1 generalized
[2026-06-02 10:46:50] [INFO ] Computed 17 invariants in 107 ms
Computed 17 P flows in 108 ms.
Exported basis to /tmp/petrispot-output-13091583985664253623.kers
Total runtime 135 ms.
[2026-06-02 10:46:54] [INFO ] Implicit Places using invariants in 3260 ms returned [80]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3284 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/201 places, 11869/59253 transitions.
Applied a total of 0 rules in 83 ms. Remains 170 /170 variables (removed 0) and now considering 11869/11869 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11803 ms. Remains : 170/201 places, 11869/59253 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p1 U G(p2))&&p0))))'
Stuttering acceptance computed with spot in 477 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLFireability-01
Product exploration timeout after 21220 steps with 0 reset in 10004 ms.
Stack based approach found an accepted trace after 71 steps with 0 reset with depth 72 and stack size 72 in 8 ms.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLFireability-01 finished in 22477 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 23 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 59253/59253 transitions.
Graph (trivial) has 144 edges and 201 vertex of which 9 / 201 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 195 transition count 59222
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 33 rules applied. Total rules applied 58 place count 171 transition count 59213
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 165 transition count 59213
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 64 place count 165 transition count 59200
Deduced a syphon composed of 13 places in 73 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 90 place count 152 transition count 59200
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 99 place count 143 transition count 40029
Iterating global reduction 3 with 9 rules applied. Total rules applied 108 place count 143 transition count 40029
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 112 place count 139 transition count 8439
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 139 transition count 8439
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 138 transition count 8437
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 138 transition count 8437
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 5 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 198 place count 98 transition count 8397
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 204 place count 98 transition count 8391
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 207 place count 95 transition count 8384
Iterating global reduction 4 with 3 rules applied. Total rules applied 210 place count 95 transition count 8384
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 224 place count 88 transition count 8402
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 236 place count 88 transition count 8390
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 238 place count 86 transition count 8386
Iterating global reduction 5 with 2 rules applied. Total rules applied 240 place count 86 transition count 8386
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 250 place count 86 transition count 8376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 252 place count 85 transition count 8389
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 270 place count 85 transition count 8371
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 278 place count 85 transition count 8371
Applied a total of 278 rules in 15426 ms. Remains 85 /201 variables (removed 116) and now considering 8371/59253 (removed 50882) transitions.
[2026-06-02 10:47:20] [INFO ] Flow matrix only has 8352 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-6953145835136810917.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11473955179445508005.kers'
[2026-06-02 10:47:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6953145835136810917.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11473955179445508005.kers]
Normalized transition count is 8351 out of 8352 initially.
Culled 0 columns in 32 ms.
// Phase 1: matrix 8351 rows 85 cols 198143 entries
Finished phase 1 with 57 SingleSign rule and 2 generalized
[2026-06-02 10:47:20] [INFO ] Computed 26 invariants in 112 ms
Computed 26 P flows in 112 ms.
Exported basis to /tmp/petrispot-output-11473955179445508005.kers
Total runtime 137 ms.
[2026-06-02 10:47:23] [INFO ] Implicit Places using invariants in 3108 ms returned []
[2026-06-02 10:47:23] [INFO ] Flow matrix only has 8352 transitions (discarded 19 similar events)
[2026-06-02 10:47:23] [INFO ] Invariant cache hit.
[2026-06-02 10:47:26] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 10:47:30] [INFO ] Implicit Places using invariants and state equation in 7278 ms returned []
Implicit Place search using SMT with State Equation took 10388 ms to find 0 implicit places.
[2026-06-02 10:47:35] [INFO ] Redundant transitions in 5269 ms returned []
Running 8370 sub problems to find dead transitions.
[2026-06-02 10:47:35] [INFO ] Flow matrix only has 8352 transitions (discarded 19 similar events)
[2026-06-02 10:47:35] [INFO ] Invariant cache hit.
[2026-06-02 10:47:36] [INFO ] State equation strengthened by 11 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/8437 variables, and 10 constraints, problems are : Problem set: 0 solved, 8370 unsolved in 30279 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/85 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 8370/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8370 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 84/8437 variables, and 10 constraints, problems are : Problem set: 0 solved, 8370 unsolved in 30258 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/85 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 8342/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 76319ms problems are : Problem set: 0 solved, 8370 unsolved
Search for dead transitions found 0 dead transitions in 76401ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/201 places, 8371/59253 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107542 ms. Remains : 85/201 places, 8371/59253 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 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLFireability-04
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 4 ms.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLFireability-04 finished in 107795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X((X(p1)&&p0)))&&F(!p2)) U G(p3)))'
Support contains 21 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 59253/59253 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 200 transition count 52692
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 200 transition count 52692
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 199 transition count 39570
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 199 transition count 39570
Applied a total of 4 rules in 3543 ms. Remains 199 /201 variables (removed 2) and now considering 39570/59253 (removed 19683) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11636484890474884748.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9803525029851440193.kers'
[2026-06-02 10:48:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11636484890474884748.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9803525029851440193.kers]
Culled 0 columns in 157 ms.
// Phase 1: matrix 39570 rows 199 cols 919105 entries
Finished phase 1 with 170 SingleSign rule and 3 generalized
[2026-06-02 10:48:57] [INFO ] Computed 26 invariants in 737 ms
Computed 26 P flows in 738 ms.
Exported basis to /tmp/petrispot-output-9803525029851440193.kers
Total runtime 867 ms.
[2026-06-02 10:49:18] [INFO ] Implicit Places using invariants in 22365 ms returned []
Implicit Place search using SMT only with invariants took 22366 ms to find 0 implicit places.
Running 39569 sub problems to find dead transitions.
[2026-06-02 10:49:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 39569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 198/39769 variables, and 10 constraints, problems are : Problem set: 0 solved, 39569 unsolved in 30928 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/199 constraints, PredecessorRefiner: 39569/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 39569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 198/39769 variables, and 10 constraints, problems are : Problem set: 0 solved, 39569 unsolved in 30678 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/199 constraints, PredecessorRefiner: 39405/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 244712ms problems are : Problem set: 0 solved, 39569 unsolved
Search for dead transitions found 0 dead transitions in 244910ms
Starting structural reductions in LTL mode, iteration 1 : 199/201 places, 39570/59253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270898 ms. Remains : 199/201 places, 39570/59253 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X((X(p1)&&p0)))&&F(!p2)) U G(p3)))'
Stuttering acceptance computed with spot in 451 ms :[(NOT p3), (OR (NOT p0) (NOT p1)), p2, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) p0), (AND (NOT p3) p0 (NOT p1))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLFireability-05
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 4 ms.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLFireability-05 finished in 271698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((X(p0) U ((X(p0)&&G(p1))||X(G(p0))))))))'
Support contains 23 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 59253/59253 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 192 transition count 40082
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 192 transition count 40082
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 189 transition count 12380
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 189 transition count 12380
Applied a total of 24 rules in 6953 ms. Remains 189 /201 variables (removed 12) and now considering 12380/59253 (removed 46873) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17216195512335306309.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11029514939288325705.kers'
[2026-06-02 10:53:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17216195512335306309.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11029514939288325705.kers]
Culled 0 columns in 50 ms.
// Phase 1: matrix 12380 rows 189 cols 291765 entries
Finished phase 1 with 161 SingleSign rule and 2 generalized
[2026-06-02 10:53:31] [INFO ] Computed 26 invariants in 190 ms
Computed 26 P flows in 191 ms.
Exported basis to /tmp/petrispot-output-11029514939288325705.kers
Total runtime 231 ms.
[2026-06-02 10:53:35] [INFO ] Implicit Places using invariants in 4722 ms returned []
Implicit Place search using SMT only with invariants took 4724 ms to find 0 implicit places.
Running 12379 sub problems to find dead transitions.
[2026-06-02 10:53:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 188/12569 variables, and 10 constraints, problems are : Problem set: 0 solved, 12379 unsolved in 30215 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 12379/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12379 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/12569 variables, and 10 constraints, problems are : Problem set: 0 solved, 12379 unsolved in 30208 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 12215/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 89193ms problems are : Problem set: 0 solved, 12379 unsolved
Search for dead transitions found 0 dead transitions in 89258ms
Starting structural reductions in LTL mode, iteration 1 : 189/201 places, 12380/59253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100965 ms. Remains : 189/201 places, 12380/59253 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(p0) U ((X(p0)&&G(p1))||X(G(p0)))))||p0)))'
Stuttering acceptance computed with spot in 333 ms :[true, (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLFireability-06 finished in 101422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||(F(p2)&&p1)))&&F(p0)))'
Support contains 18 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 59253/59253 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 183 transition count 39571
Ensure Unique test removed 9 places
Iterating global reduction 0 with 27 rules applied. Total rules applied 45 place count 174 transition count 39571
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 48 place count 171 transition count 11869
Iterating global reduction 0 with 3 rules applied. Total rules applied 51 place count 171 transition count 11869
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 52 place count 170 transition count 11867
Iterating global reduction 0 with 1 rules applied. Total rules applied 53 place count 170 transition count 11867
Applied a total of 53 rules in 8141 ms. Remains 170 /201 variables (removed 31) and now considering 11867/59253 (removed 47386) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6312071404290904850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13105961097607849381.kers'
[2026-06-02 10:55:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6312071404290904850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13105961097607849381.kers]
Culled 0 columns in 46 ms.
// Phase 1: matrix 11867 rows 170 cols 175534 entries
Finished phase 1 with 152 SingleSign rule and 1 generalized
[2026-06-02 10:55:14] [INFO ] Computed 17 invariants in 156 ms
Computed 17 P flows in 157 ms.
Exported basis to /tmp/petrispot-output-13105961097607849381.kers
Total runtime 178 ms.
[2026-06-02 10:55:17] [INFO ] Implicit Places using invariants in 4167 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4187 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/201 places, 11867/59253 transitions.
Applied a total of 0 rules in 72 ms. Remains 169 /169 variables (removed 0) and now considering 11867/11867 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12401 ms. Remains : 169/201 places, 11867/59253 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||(F(p2)&&p1)))&&F(p0)))'
Stuttering acceptance computed with spot in 333 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), true, (NOT p0), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLFireability-07 finished in 12844 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 12 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 59253/59253 transitions.
Graph (trivial) has 145 edges and 201 vertex of which 9 / 201 are part of one of the 4 SCC in 4 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 195 transition count 59222
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 33 rules applied. Total rules applied 58 place count 171 transition count 59213
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 165 transition count 59213
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 64 place count 165 transition count 59199
Deduced a syphon composed of 14 places in 68 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 93 place count 150 transition count 59199
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 111 place count 132 transition count 39517
Ensure Unique test removed 9 places
Iterating global reduction 3 with 27 rules applied. Total rules applied 138 place count 123 transition count 39517
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 147 place count 114 transition count 1175
Iterating global reduction 3 with 9 rules applied. Total rules applied 156 place count 114 transition count 1175
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 240 place count 72 transition count 1133
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 246 place count 72 transition count 1127
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 249 place count 69 transition count 1120
Iterating global reduction 4 with 3 rules applied. Total rules applied 252 place count 69 transition count 1120
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 264 place count 63 transition count 1138
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 276 place count 63 transition count 1126
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 278 place count 61 transition count 1122
Iterating global reduction 5 with 2 rules applied. Total rules applied 280 place count 61 transition count 1122
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 290 place count 61 transition count 1112
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 292 place count 60 transition count 1125
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 6 with 24 rules applied. Total rules applied 316 place count 60 transition count 1101
Partial Post-agglomeration rule applied 9 times.
Drop transitions (Partial Post agglomeration) removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 325 place count 60 transition count 1101
Applied a total of 325 rules in 17058 ms. Remains 60 /201 variables (removed 141) and now considering 1101/59253 (removed 58152) transitions.
[2026-06-02 10:55:35] [INFO ] Flow matrix only has 1082 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-7171961723375353439.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16292274307114074053.kers'
[2026-06-02 10:55:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7171961723375353439.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16292274307114074053.kers]
Normalized transition count is 1081 out of 1082 initially.
Culled 0 columns in 3 ms.
// Phase 1: matrix 1081 rows 60 cols 24787 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-06-02 10:55:35] [INFO ] Computed 16 invariants in 12 ms
Computed 16 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-16292274307114074053.kers
Total runtime 17 ms.
[2026-06-02 10:55:35] [INFO ] Implicit Places using invariants in 340 ms returned []
[2026-06-02 10:55:35] [INFO ] Flow matrix only has 1082 transitions (discarded 19 similar events)
[2026-06-02 10:55:35] [INFO ] Invariant cache hit.
[2026-06-02 10:55:36] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 10:55:36] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 1308 ms to find 0 implicit places.
[2026-06-02 10:55:37] [INFO ] Redundant transitions in 145 ms returned []
Running 1100 sub problems to find dead transitions.
[2026-06-02 10:55:37] [INFO ] Flow matrix only has 1082 transitions (discarded 19 similar events)
[2026-06-02 10:55:37] [INFO ] Invariant cache hit.
[2026-06-02 10:55:37] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 1081/1141 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
SMT process timed out in 31542ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 31546ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/201 places, 1101/59253 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50065 ms. Remains : 60/201 places, 1101/59253 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 41 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLFireability-09
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLFireability-09 finished in 50168 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(p1))))'
Support contains 23 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 59253/59253 transitions.
Graph (trivial) has 144 edges and 201 vertex of which 9 / 201 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 195 transition count 59222
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 33 rules applied. Total rules applied 58 place count 171 transition count 59213
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 165 transition count 59213
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 64 place count 165 transition count 59200
Deduced a syphon composed of 13 places in 72 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 90 place count 152 transition count 59200
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 99 place count 143 transition count 40029
Iterating global reduction 3 with 9 rules applied. Total rules applied 108 place count 143 transition count 40029
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 112 place count 139 transition count 8439
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 139 transition count 8439
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 118 place count 137 transition count 8435
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 137 transition count 8435
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 200 place count 97 transition count 8395
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 206 place count 97 transition count 8389
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 209 place count 94 transition count 8382
Iterating global reduction 4 with 3 rules applied. Total rules applied 212 place count 94 transition count 8382
Performed 8 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 228 place count 86 transition count 8400
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 240 place count 86 transition count 8388
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 242 place count 84 transition count 8384
Iterating global reduction 5 with 2 rules applied. Total rules applied 244 place count 84 transition count 8384
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 254 place count 84 transition count 8374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 256 place count 83 transition count 8387
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 273 place count 83 transition count 8370
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 279 place count 83 transition count 8370
Applied a total of 279 rules in 14358 ms. Remains 83 /201 variables (removed 118) and now considering 8370/59253 (removed 50883) transitions.
[2026-06-02 10:56:23] [INFO ] Flow matrix only has 8351 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-15322287393939187453.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11220485576093464839.kers'
[2026-06-02 10:56:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15322287393939187453.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11220485576093464839.kers]
Normalized transition count is 8350 out of 8351 initially.
Culled 0 columns in 32 ms.
// Phase 1: matrix 8350 rows 83 cols 198145 entries
Finished phase 1 with 55 SingleSign rule and 2 generalized
[2026-06-02 10:56:23] [INFO ] Computed 26 invariants in 116 ms
Computed 26 P flows in 117 ms.
Exported basis to /tmp/petrispot-output-11220485576093464839.kers
Total runtime 146 ms.
[2026-06-02 10:56:26] [INFO ] Implicit Places using invariants in 3204 ms returned []
[2026-06-02 10:56:26] [INFO ] Flow matrix only has 8351 transitions (discarded 19 similar events)
[2026-06-02 10:56:26] [INFO ] Invariant cache hit.
[2026-06-02 10:56:29] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 10:56:34] [INFO ] Implicit Places using invariants and state equation in 8042 ms returned []
Implicit Place search using SMT with State Equation took 11249 ms to find 0 implicit places.
[2026-06-02 10:56:38] [INFO ] Redundant transitions in 4498 ms returned []
Running 8369 sub problems to find dead transitions.
[2026-06-02 10:56:38] [INFO ] Flow matrix only has 8351 transitions (discarded 19 similar events)
[2026-06-02 10:56:38] [INFO ] Invariant cache hit.
[2026-06-02 10:56:38] [INFO ] State equation strengthened by 11 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 82/8434 variables, and 10 constraints, problems are : Problem set: 0 solved, 8369 unsolved in 30145 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/83 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 8369/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 82/8434 variables, and 10 constraints, problems are : Problem set: 0 solved, 8369 unsolved in 30154 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/83 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 8343/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 75994ms problems are : Problem set: 0 solved, 8369 unsolved
Search for dead transitions found 0 dead transitions in 76026ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/201 places, 8370/59253 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106151 ms. Remains : 83/201 places, 8370/59253 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(p1))))'
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLFireability-10
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 8 ms.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLFireability-10 finished in 106405 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((X((G(p0) U p1))||G(p2))))))'
Support contains 30 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 59253/59253 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 192 transition count 40082
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 192 transition count 40082
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 190 transition count 18212
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 190 transition count 18212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 189 transition count 18210
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 189 transition count 18210
Applied a total of 24 rules in 6070 ms. Remains 189 /201 variables (removed 12) and now considering 18210/59253 (removed 41043) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2148773816678349633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1519703083299139103.kers'
[2026-06-02 10:58:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2148773816678349633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1519703083299139103.kers]
Culled 0 columns in 100 ms.
// Phase 1: matrix 18210 rows 189 cols 431729 entries
Finished phase 1 with 161 SingleSign rule and 2 generalized
[2026-06-02 10:58:01] [INFO ] Computed 26 invariants in 339 ms
Computed 26 P flows in 340 ms.
Exported basis to /tmp/petrispot-output-1519703083299139103.kers
Total runtime 397 ms.
[2026-06-02 10:58:06] [INFO ] Implicit Places using invariants in 4881 ms returned []
Implicit Place search using SMT only with invariants took 4883 ms to find 0 implicit places.
Running 18209 sub problems to find dead transitions.
[2026-06-02 10:58:06] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 18209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 188/18399 variables, and 10 constraints, problems are : Problem set: 0 solved, 18209 unsolved in 30501 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 18209/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 18209 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/18399 variables, and 10 constraints, problems are : Problem set: 0 solved, 18209 unsolved in 30320 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 18047/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 105788ms problems are : Problem set: 0 solved, 18209 unsolved
Search for dead transitions found 0 dead transitions in 105862ms
Starting structural reductions in LTL mode, iteration 1 : 189/201 places, 18210/59253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116848 ms. Remains : 189/201 places, 18210/59253 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((X((G(p0) U p1))||G(p2))))))'
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), true, (NOT p0), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLFireability-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLFireability-12 finished in 117322 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) U (X(F(p0))&&(p1 U p2))))'
Support contains 22 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 59253/59253 transitions.
Applied a total of 0 rules in 665 ms. Remains 201 /201 variables (removed 0) and now considering 59253/59253 (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-7404123865384410975.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9731149754734639805.kers'
[2026-06-02 10:59:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7404123865384410975.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9731149754734639805.kers]
Culled 0 columns in 237 ms.
// Phase 1: matrix 59253 rows 201 cols 1378375 entries
Finished phase 1 with 172 SingleSign rule and 3 generalized
[2026-06-02 10:59:54] [INFO ] Computed 26 invariants in 1233 ms
Computed 26 P flows in 1233 ms.
Exported basis to /tmp/petrispot-output-9731149754734639805.kers
Total runtime 1416 ms.
[2026-06-02 11:00:23] [INFO ] Implicit Places using invariants in 30544 ms returned []
Implicit Place search using SMT only with invariants took 30545 ms to find 0 implicit places.
Running 59252 sub problems to find dead transitions.
[2026-06-02 11:00:24] [INFO ] Invariant cache hit.
SMT process timed out in 431371ms, After SMT, problems are : Problem set: 0 solved, 59252 unsolved
Search for dead transitions found 0 dead transitions in 431573ms
Finished structural reductions in LTL mode , in 1 iterations and 463014 ms. Remains : 201/201 places, 59253/59253 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) U (X(F(p0))&&(p1 U p2))))'
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p2) (NOT p0)), p0, (NOT p0), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLFireability-13
Product exploration timeout after 7250 steps with 0 reset in 10005 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 66 in 18 ms.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLFireability-13 finished in 473569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((p1&&(p2 U p3))))))'
Support contains 25 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 59253/59253 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 183 transition count 39571
Ensure Unique test removed 9 places
Iterating global reduction 0 with 27 rules applied. Total rules applied 45 place count 174 transition count 39571
Applied a total of 45 rules in 5499 ms. Remains 174 /201 variables (removed 27) and now considering 39571/59253 (removed 19682) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14578713598182169102.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1715555458221623948.kers'
[2026-06-02 11:07:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14578713598182169102.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1715555458221623948.kers]
Culled 0 columns in 100 ms.
// Phase 1: matrix 39571 rows 174 cols 591068 entries
Finished phase 1 with 156 SingleSign rule and 1 generalized
[2026-06-02 11:07:52] [INFO ] Computed 17 invariants in 450 ms
Computed 17 P flows in 452 ms.
Exported basis to /tmp/petrispot-output-1715555458221623948.kers
Total runtime 535 ms.
[2026-06-02 11:07:56] [INFO ] Implicit Places using invariants in 5149 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 5194 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 173/201 places, 39571/59253 transitions.
Applied a total of 0 rules in 159 ms. Remains 173 /173 variables (removed 0) and now considering 39571/39571 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10855 ms. Remains : 173/201 places, 39571/59253 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&(p1 U p2)))||p3)))'
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p0) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLFireability-14
Product exploration timeout after 7140 steps with 0 reset in 10002 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 9 ms.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLFireability-14 finished in 21288 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 U p1) U (p2 U p3)) U !(F(p0)&&p4))))'
Support contains 34 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 59253/59253 transitions.
Graph (trivial) has 144 edges and 201 vertex of which 9 / 201 are part of one of the 4 SCC in 3 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 195 transition count 59222
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 33 rules applied. Total rules applied 58 place count 171 transition count 59213
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 165 transition count 59213
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 64 place count 165 transition count 59200
Deduced a syphon composed of 13 places in 73 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 90 place count 152 transition count 59200
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 151 transition count 52639
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 151 transition count 52639
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 150 transition count 39517
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 150 transition count 39517
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 22 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 184 place count 105 transition count 39472
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 190 place count 105 transition count 39466
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 193 place count 102 transition count 39459
Iterating global reduction 4 with 3 rules applied. Total rules applied 196 place count 102 transition count 39459
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 21 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 208 place count 96 transition count 39477
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 220 place count 96 transition count 39465
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 222 place count 94 transition count 39461
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 94 transition count 39461
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 234 place count 94 transition count 39451
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 236 place count 93 transition count 39464
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 241 place count 93 transition count 39464
Applied a total of 241 rules in 12321 ms. Remains 93 /201 variables (removed 108) and now considering 39464/59253 (removed 19789) transitions.
[2026-06-02 11:08:19] [INFO ] Flow matrix only has 39444 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18195710044703629234.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3148493250875080978.kers'
[2026-06-02 11:08:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18195710044703629234.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3148493250875080978.kers]
Normalized transition count is 39443 out of 39444 initially.
Culled 0 columns in 267 ms.
// Phase 1: matrix 39443 rows 93 cols 918982 entries
Finished phase 1 with 64 SingleSign rule and 3 generalized
[2026-06-02 11:08:20] [INFO ] Computed 26 invariants in 861 ms
Computed 26 P flows in 861 ms.
Exported basis to /tmp/petrispot-output-3148493250875080978.kers
Total runtime 982 ms.
[2026-06-02 11:08:32] [INFO ] Implicit Places using invariants in 12915 ms returned []
Implicit Place search using SMT only with invariants took 12916 ms to find 0 implicit places.
Running 39452 sub problems to find dead transitions.
[2026-06-02 11:08:32] [INFO ] Flow matrix only has 39444 transitions (discarded 20 similar events)
[2026-06-02 11:08:32] [INFO ] Invariant cache hit.
[2026-06-02 11:08:33] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 39452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 92/39537 variables, and 10 constraints, problems are : Problem set: 0 solved, 39452 unsolved in 31212 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/93 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 39452/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 39452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 92/39537 variables, and 10 constraints, problems are : Problem set: 0 solved, 39452 unsolved in 30969 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/93 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 39423/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 207274ms problems are : Problem set: 0 solved, 39452 unsolved
Search for dead transitions found 0 dead transitions in 207407ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/201 places, 39464/59253 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 232766 ms. Remains : 93/201 places, 39464/59253 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 U p1) U (p2 U p3)) U !(F(p0)&&p4))))'
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p4) (NOT p0)), (NOT p0), (OR (AND p3 (NOT p4)) (AND (NOT p0) p3)), (OR (AND p3 (NOT p4)) (AND (NOT p0) p3)), (OR (AND p1 p3 (NOT p4)) (AND (NOT p0) p1 p3)), (OR (AND (NOT p0) p1) (AND p1 (NOT p4)))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLFireability-15
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 12 ms.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLFireability-15 finished in 233265 ms.
All properties solved by simple procedures.
Total runtime 2124156 ms.

BK_STOP 1780398720619

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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