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.r162-smll-177961107700100.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 IBMB2S565S3960-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107700100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 11K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.1K Mar 15 11:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 15 11:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 11:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 15 11:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 127K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-00
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-01
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-02
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-03
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-04
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-05
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-06
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-07
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-08
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-09
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-10
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-11
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-12
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-13
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-14
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779728284814

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBMB2S565S3960-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 16:58:07] [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-05-25 16:58:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 16:58:07] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2026-05-25 16:58:07] [INFO ] Transformed 273 places.
[2026-05-25 16:58:07] [INFO ] Transformed 179 transitions.
[2026-05-25 16:58:07] [INFO ] Parsed PT model containing 273 places and 179 transitions and 572 arcs in 369 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 179/179 transitions.
Ensure Unique test removed 79 places
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 184 transition count 178
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 107 place count 167 transition count 161
Iterating global reduction 1 with 17 rules applied. Total rules applied 124 place count 167 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 125 place count 167 transition count 160
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 165 transition count 158
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 165 transition count 158
Applied a total of 129 rules in 152 ms. Remains 165 /273 variables (removed 108) and now considering 158/179 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12761660453250837421.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10234599131155906803.kers'
[2026-05-25 16:58:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12761660453250837421.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10234599131155906803.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 158 rows 153 cols 339 entries
Finished phase 1 with 144 SingleSign rule and 3 generalized
[2026-05-25 16:58:08] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10234599131155906803.kers
Total runtime 3 ms.
[2026-05-25 16:58:08] [INFO ] Implicit Places using invariants in 484 ms returned [134, 150]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 558 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/273 places, 158/179 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 162 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 162 transition count 157
Applied a total of 2 rules in 18 ms. Remains 162 /163 variables (removed 1) and now considering 157/158 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9794976258705900744.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7849040245212954338.kers'
[2026-05-25 16:58:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9794976258705900744.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7849040245212954338.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 157 rows 150 cols 333 entries
Finished phase 1 with 144 SingleSign rule and 2 generalized
[2026-05-25 16:58:08] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7849040245212954338.kers
Total runtime 2 ms.
[2026-05-25 16:58:09] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-25 16:58:09] [INFO ] Invariant cache hit.
[2026-05-25 16:58:09] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/273 places, 157/179 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1281 ms. Remains : 162/273 places, 157/179 transitions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 157/157 transitions.
Applied a total of 0 rules in 7 ms. Remains 162 /162 variables (removed 0) and now considering 157/157 (removed 0) transitions.
[2026-05-25 16:58:09] [INFO ] Invariant cache hit.
[2026-05-25 16:58:09] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-25 16:58:09] [INFO ] Invariant cache hit.
[2026-05-25 16:58:09] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2026-05-25 16:58:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 157/318 variables, 161/177 constraints. Problems are: Problem set: 0 solved, 156 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 1/319 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 0/319 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 178 constraints, problems are : Problem set: 0 solved, 156 unsolved in 16562 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 157/318 variables, 161/177 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 156/333 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (OVERLAPS) 1/319 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/319 variables, and 334 constraints, problems are : Problem set: 0 solved, 156 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46709ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 46734ms
Finished structural reductions in LTL mode , in 1 iterations and 47208 ms. Remains : 162/162 places, 157/157 transitions.
Support contains 37 out of 162 places after structural reductions.
[2026-05-25 16:58:57] [INFO ] Flatten gal took : 69 ms
[2026-05-25 16:58:57] [INFO ] Flatten gal took : 39 ms
[2026-05-25 16:58:57] [INFO ] Input system was already deterministic with 157 transitions.
RANDOM walk for 40011 steps (167 resets) in 1207 ms. (33 steps per ms) remains 3/21 properties
BEST_FIRST walk for 40004 steps (22 resets) in 409 ms. (97 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40001 steps (14 resets) in 105 ms. (377 steps per ms) remains 1/2 properties
[2026-05-25 16:58:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 17/22 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 23/48 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/72 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/76 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/76 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 24/100 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/100 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/100 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 20/120 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/120 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/120 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/138 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/138 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 16/154 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/154 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/154 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 19/173 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/173 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/173 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 18/191 variables, 8/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/191 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 26/217 variables, 12/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/217 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 26/243 variables, 14/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/243 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/243 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 26/269 variables, 12/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/269 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/269 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 21/290 variables, 11/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/290 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 16/306 variables, 7/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/306 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 10/316 variables, 7/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/316 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 3/319 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/319 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 0/319 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 494 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 17/22 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 23/48 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/72 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/76 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/76 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/100 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/100 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/100 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 20/120 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/120 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/120 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 18/138 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/138 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 16/154 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/154 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/154 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 19/173 variables, 10/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/173 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/173 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 18/191 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/191 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 26/217 variables, 12/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/217 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 26/243 variables, 14/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/243 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/243 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 26/269 variables, 12/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/269 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/269 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 21/290 variables, 11/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/290 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 16/306 variables, 7/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/306 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 10/316 variables, 7/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/316 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 3/319 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/319 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 0/319 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 179 constraints, problems are : Problem set: 0 solved, 1 unsolved in 611 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1113ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 294 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=49 )
Parikh walk visited 1 properties in 13 ms.
Computed a total of 69 stabilizing places and 68 stable transitions
Graph (complete) has 200 edges and 162 vertex of which 109 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.15 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((p0&&G(F(p1))))||X(X(p2))))))'
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 157/157 transitions.
Graph (complete) has 200 edges and 162 vertex of which 109 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.3 ms
Discarding 53 places :
Also discarding 46 output transitions
Drop transitions (Output transitions of discarded places.) removed 46 transitions
Ensure Unique test removed 8 places
Reduce places removed 9 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 100 transition count 54
Reduce places removed 56 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 58 rules applied. Total rules applied 115 place count 44 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 117 place count 42 transition count 52
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 117 place count 42 transition count 40
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 141 place count 30 transition count 40
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 161 place count 20 transition count 30
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 164 place count 20 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 166 place count 19 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 167 place count 19 transition count 25
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 171 place count 17 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 172 place count 17 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 173 place count 16 transition count 24
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 174 place count 15 transition count 24
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 175 place count 14 transition count 22
Iterating global reduction 6 with 1 rules applied. Total rules applied 176 place count 14 transition count 22
Applied a total of 176 rules in 44 ms. Remains 14 /162 variables (removed 148) and now considering 22/157 (removed 135) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11677316089868434017.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8582542814725318213.kers'
[2026-05-25 16:58:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11677316089868434017.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8582542814725318213.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 22 rows 13 cols 49 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-25 16:58:59] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8582542814725318213.kers
Total runtime 0 ms.
[2026-05-25 16:58:59] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 16:58:59] [INFO ] Invariant cache hit.
[2026-05-25 16:58:59] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [5]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 81 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/162 places, 21/157 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 20
Applied a total of 1 rules in 3 ms. Remains 13 /13 variables (removed 0) and now considering 20/21 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11607942974943380852.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-339180563749096818.kers'
[2026-05-25 16:58:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11607942974943380852.kers, --Pflows, --basisKERS=/tmp/petrispot-output-339180563749096818.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 20 rows 12 cols 40 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-25 16:58:59] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-339180563749096818.kers
Total runtime 0 ms.
[2026-05-25 16:58:59] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 16:58:59] [INFO ] Invariant cache hit.
[2026-05-25 16:58:59] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/162 places, 20/157 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 202 ms. Remains : 13/162 places, 20/157 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((p0&&G(F(p1))))||X(X(p2))))))'
Stuttering acceptance computed with spot in 420 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-02
Product exploration explored 100000 steps with 5371 reset in 472 ms.
Product exploration explored 100000 steps with 5390 reset in 338 ms.
Computed a total of 4 stabilizing places and 7 stable transitions
Computed a total of 4 stabilizing places and 7 stable transitions
Knowledge based reduction with 15 factoid took 91 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
RANDOM walk for 31291 steps (1605 resets) in 113 ms. (274 steps per ms) remains 0/7 properties
Knowledge based reduction with 15 factoid took 179 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Knowledge-based reduction took 474 ms.
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Support contains 4 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2026-05-25 16:59:01] [INFO ] Invariant cache hit.
[2026-05-25 16:59:01] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 16:59:01] [INFO ] Invariant cache hit.
[2026-05-25 16:59:01] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2026-05-25 16:59:01] [INFO ] Redundant transitions in 21 ms returned []
Running 15 sub problems to find dead transitions.
[2026-05-25 16:59:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 18/29 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2/31 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/33 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 14 constraints, problems are : Problem set: 0 solved, 15 unsolved in 514 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 18/29 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 2/31 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 2/33 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/33 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 29 constraints, problems are : Problem set: 0 solved, 15 unsolved in 411 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 932ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 934ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1033 ms. Remains : 13/13 places, 20/20 transitions.
Computed a total of 4 stabilizing places and 7 stable transitions
Computed a total of 4 stabilizing places and 7 stable transitions
Knowledge based reduction with 15 factoid took 81 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
RANDOM walk for 40011 steps (2143 resets) in 95 ms. (416 steps per ms) remains 1/7 properties
BEST_FIRST walk for 3564 steps (33 resets) in 19 ms. (178 steps per ms) remains 0/1 properties
Knowledge based reduction with 15 factoid took 181 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Knowledge-based reduction took 452 ms.
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 5399 reset in 166 ms.
Product exploration explored 100000 steps with 5396 reset in 304 ms.
Built C files in :
/tmp/ltsmin3432617381116743800
[2026-05-25 16:59:03] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2026-05-25 16:59:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 16:59:03] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2026-05-25 16:59:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 16:59:03] [INFO ] Computing Do-Not-Accords matrix : 20 transitions.
[2026-05-25 16:59:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 16:59:03] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3432617381116743800
Running compilation step : cd /tmp/ltsmin3432617381116743800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 458 ms.
Running link step : cd /tmp/ltsmin3432617381116743800;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin3432617381116743800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9737065840167787483.hoa' '--buchi-type=spotba'
LTSmin run took 77 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-02 finished in 5184 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 2 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 157/157 transitions.
Graph (trivial) has 120 edges and 162 vertex of which 19 / 162 are part of one of the 1 SCC in 3 ms
Free SCC test removed 18 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 180 edges and 144 vertex of which 95 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.2 ms
Discarding 49 places :
Also discarding 43 output transitions
Drop transitions (Output transitions of discarded places.) removed 43 transitions
Ensure Unique test removed 9 places
Reduce places removed 10 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 85 transition count 44
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 36 transition count 44
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 100 place count 36 transition count 33
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 122 place count 25 transition count 33
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 138 place count 17 transition count 25
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 141 place count 17 transition count 22
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 147 place count 14 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 14 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 13 transition count 19
Ensure Unique test removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 152 place count 12 transition count 19
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 153 place count 11 transition count 17
Iterating global reduction 4 with 1 rules applied. Total rules applied 154 place count 11 transition count 17
Applied a total of 154 rules in 30 ms. Remains 11 /162 variables (removed 151) and now considering 17/157 (removed 140) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14752373306219843417.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18149982472509567910.kers'
[2026-05-25 16:59:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14752373306219843417.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18149982472509567910.kers]
Normalized transition count is 16 out of 17 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 10 cols 42 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-25 16:59:04] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18149982472509567910.kers
Total runtime 0 ms.
[2026-05-25 16:59:04] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-25 16:59:04] [INFO ] Invariant cache hit.
[2026-05-25 16:59:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:59:04] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [4]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 92 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/162 places, 16/157 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 15
Applied a total of 1 rules in 3 ms. Remains 10 /10 variables (removed 0) and now considering 15/16 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3264463843063935151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8121360304313456462.kers'
[2026-05-25 16:59:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3264463843063935151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8121360304313456462.kers]
Normalized transition count is 14 out of 15 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 14 rows 9 cols 31 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-25 16:59:04] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8121360304313456462.kers
Total runtime 1 ms.
[2026-05-25 16:59:04] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-25 16:59:04] [INFO ] Invariant cache hit.
[2026-05-25 16:59:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:59:04] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/162 places, 15/157 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 206 ms. Remains : 10/162 places, 15/157 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 48 ms :[(NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-03
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-03 finished in 296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(X(p1)||G(p2)))))'
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 157/157 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 150 transition count 157
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 18 place count 144 transition count 151
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 144 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 142 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 141 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 141 transition count 148
Applied a total of 30 rules in 33 ms. Remains 141 /162 variables (removed 21) and now considering 148/157 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7081240474891868753.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8151451647801725473.kers'
[2026-05-25 16:59:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7081240474891868753.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8151451647801725473.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 141 cols 313 entries
Finished phase 1 with 135 SingleSign rule and 2 generalized
[2026-05-25 16:59:04] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8151451647801725473.kers
Total runtime 3 ms.
[2026-05-25 16:59:04] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 16:59:04] [INFO ] Invariant cache hit.
[2026-05-25 16:59:05] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2026-05-25 16:59:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/288 variables, 140/144 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/289 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/289 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 145 constraints, problems are : Problem set: 0 solved, 147 unsolved in 12608 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/288 variables, 140/144 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 147/291 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 1/289 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 292 constraints, problems are : Problem set: 0 solved, 147 unsolved in 23051 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35689ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 35691ms
Starting structural reductions in LTL mode, iteration 1 : 141/162 places, 148/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36044 ms. Remains : 141/162 places, 148/157 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(X(p1)||G(p2)))))'
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 251 ms.
Product exploration explored 100000 steps with 33333 reset in 304 ms.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 164 edges and 141 vertex of which 97 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.7 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Detected a total of 61/141 stabilizing places and 65/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 18 ms. Proved property starting from automaton with 7 states, 11 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 42 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-04 finished in 37051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)&&p0))))'
Support contains 8 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 157/157 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 153 transition count 157
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 14 place count 148 transition count 152
Iterating global reduction 1 with 5 rules applied. Total rules applied 19 place count 148 transition count 152
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 146 transition count 150
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 146 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 145 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 145 transition count 149
Applied a total of 25 rules in 20 ms. Remains 145 /162 variables (removed 17) and now considering 149/157 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17266744746361656768.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11934577893391418426.kers'
[2026-05-25 16:59:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17266744746361656768.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11934577893391418426.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 149 rows 142 cols 316 entries
Finished phase 1 with 136 SingleSign rule and 2 generalized
[2026-05-25 16:59:41] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11934577893391418426.kers
Total runtime 2 ms.
[2026-05-25 16:59:41] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-25 16:59:41] [INFO ] Invariant cache hit.
[2026-05-25 16:59:42] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2026-05-25 16:59:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 149/293 variables, 144/151 constraints. Problems are: Problem set: 0 solved, 148 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 1/294 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 152 constraints, problems are : Problem set: 0 solved, 148 unsolved in 12651 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 149/293 variables, 144/151 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 148/299 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 1/294 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 0/294 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 300 constraints, problems are : Problem set: 0 solved, 148 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42691ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 42694ms
Starting structural reductions in LTL mode, iteration 1 : 145/162 places, 149/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43030 ms. Remains : 145/162 places, 149/157 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)&&p0))))'
Stuttering acceptance computed with spot in 170 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-06 finished in 43245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F((p1&&X((F(p2)&&X(p3)))))))'
Support contains 8 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 157/157 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 154 transition count 157
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 14 place count 148 transition count 151
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 place count 148 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 146 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 146 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 145 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 145 transition count 148
Applied a total of 26 rules in 15 ms. Remains 145 /162 variables (removed 17) and now considering 148/157 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11123947711139956295.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14635623091014499440.kers'
[2026-05-25 17:00:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11123947711139956295.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14635623091014499440.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 148 rows 141 cols 313 entries
Finished phase 1 with 135 SingleSign rule and 2 generalized
[2026-05-25 17:00:25] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14635623091014499440.kers
Total runtime 2 ms.
[2026-05-25 17:00:25] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-25 17:00:25] [INFO ] Invariant cache hit.
[2026-05-25 17:00:25] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2026-05-25 17:00:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/292 variables, 144/152 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/293 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 153 constraints, problems are : Problem set: 0 solved, 147 unsolved in 13050 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/292 variables, 144/152 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 147/299 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 1/293 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 300 constraints, problems are : Problem set: 0 solved, 147 unsolved in 21422 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34490ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 34491ms
Starting structural reductions in LTL mode, iteration 1 : 145/162 places, 148/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34826 ms. Remains : 145/162 places, 148/157 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))&&F((p1&&X((F(p2)&&X(p3)))))))'
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p3)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-07
Stuttering criterion allowed to conclude after 253 steps with 2 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-07 finished in 35209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 157/157 transitions.
Graph (trivial) has 118 edges and 162 vertex of which 19 / 162 are part of one of the 1 SCC in 2 ms
Free SCC test removed 18 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 180 edges and 144 vertex of which 100 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Discarding 44 places :
Also discarding 38 output transitions
Drop transitions (Output transitions of discarded places.) removed 38 transitions
Ensure Unique test removed 10 places
Reduce places removed 11 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 89 transition count 48
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 39 transition count 48
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 102 place count 39 transition count 35
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 128 place count 26 transition count 35
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 144 place count 18 transition count 27
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 147 place count 18 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 153 place count 15 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 155 place count 15 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 15 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 157 place count 14 transition count 21
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 158 place count 13 transition count 21
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 159 place count 12 transition count 19
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 12 transition count 19
Applied a total of 160 rules in 24 ms. Remains 12 /162 variables (removed 150) and now considering 19/157 (removed 138) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10269622823978023191.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15795545988630794195.kers'
[2026-05-25 17:01:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10269622823978023191.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15795545988630794195.kers]
Normalized transition count is 18 out of 19 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 12 cols 44 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-25 17:01:00] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15795545988630794195.kers
Total runtime 0 ms.
[2026-05-25 17:01:00] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-25 17:01:00] [INFO ] Invariant cache hit.
[2026-05-25 17:01:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:01:00] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [4]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 100 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/162 places, 18/157 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 17
Applied a total of 1 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 17/18 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3156981259460405614.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2042111937492398270.kers'
[2026-05-25 17:01:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3156981259460405614.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2042111937492398270.kers]
Normalized transition count is 16 out of 17 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 11 cols 35 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-25 17:01:00] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2042111937492398270.kers
Total runtime 0 ms.
[2026-05-25 17:01:00] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 17:01:00] [INFO ] Invariant cache hit.
[2026-05-25 17:01:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:01:00] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/162 places, 17/157 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 208 ms. Remains : 11/162 places, 17/157 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-08
Stuttering criterion allowed to conclude after 978 steps with 66 reset in 5 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-08 finished in 301 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)))'
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 157/157 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 153 transition count 157
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 14 place count 148 transition count 152
Iterating global reduction 1 with 5 rules applied. Total rules applied 19 place count 148 transition count 152
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 146 transition count 150
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 146 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 145 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 145 transition count 149
Applied a total of 25 rules in 16 ms. Remains 145 /162 variables (removed 17) and now considering 149/157 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5100025875382915580.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9398018969745913910.kers'
[2026-05-25 17:01:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5100025875382915580.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9398018969745913910.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 149 rows 142 cols 315 entries
Finished phase 1 with 136 SingleSign rule and 2 generalized
[2026-05-25 17:01:00] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9398018969745913910.kers
Total runtime 1 ms.
[2026-05-25 17:01:00] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-25 17:01:00] [INFO ] Invariant cache hit.
[2026-05-25 17:01:00] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2026-05-25 17:01:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 149/293 variables, 144/151 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 1/294 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 152 constraints, problems are : Problem set: 0 solved, 148 unsolved in 15717 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 149/293 variables, 144/151 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 148/299 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 1/294 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 0/294 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 300 constraints, problems are : Problem set: 0 solved, 148 unsolved in 25595 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41329ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 41330ms
Starting structural reductions in LTL mode, iteration 1 : 145/162 places, 149/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41684 ms. Remains : 145/162 places, 149/157 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-09 finished in 41835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 157/157 transitions.
Graph (trivial) has 120 edges and 162 vertex of which 19 / 162 are part of one of the 1 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 180 edges and 144 vertex of which 91 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.1 ms
Discarding 53 places :
Also discarding 46 output transitions
Drop transitions (Output transitions of discarded places.) removed 46 transitions
Ensure Unique test removed 8 places
Reduce places removed 9 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 82 transition count 43
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 35 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 34 transition count 42
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 98 place count 34 transition count 32
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 118 place count 24 transition count 32
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 134 place count 16 transition count 24
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 136 place count 16 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 140 place count 14 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 14 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 13 transition count 20
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 144 place count 12 transition count 20
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 145 place count 11 transition count 18
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 11 transition count 18
Applied a total of 146 rules in 14 ms. Remains 11 /162 variables (removed 151) and now considering 18/157 (removed 139) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9656457451731056038.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4746084723521659881.kers'
[2026-05-25 17:01:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9656457451731056038.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4746084723521659881.kers]
Normalized transition count is 17 out of 18 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 17 rows 10 cols 40 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-25 17:01:42] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4746084723521659881.kers
Total runtime 2 ms.
[2026-05-25 17:01:42] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 17:01:42] [INFO ] Invariant cache hit.
[2026-05-25 17:01:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:01:42] [INFO ] Implicit Places using invariants and state equation in 32 ms returned [4]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 73 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/162 places, 17/157 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 16
Applied a total of 1 rules in 3 ms. Remains 10 /10 variables (removed 0) and now considering 16/17 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7480424123557661687.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17201352957693306422.kers'
[2026-05-25 17:01:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7480424123557661687.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17201352957693306422.kers]
Normalized transition count is 15 out of 16 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 15 rows 9 cols 31 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-25 17:01:42] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17201352957693306422.kers
Total runtime 0 ms.
[2026-05-25 17:01:42] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-25 17:01:42] [INFO ] Invariant cache hit.
[2026-05-25 17:01:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:01:42] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/162 places, 16/157 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 144 ms. Remains : 10/162 places, 16/157 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-10
Stuttering criterion allowed to conclude after 286 steps with 17 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-10 finished in 240 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))&&F(p2))))'
Support contains 2 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 157/157 transitions.
Graph (trivial) has 116 edges and 162 vertex of which 12 / 162 are part of one of the 1 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 188 edges and 151 vertex of which 98 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.1 ms
Discarding 53 places :
Also discarding 46 output transitions
Drop transitions (Output transitions of discarded places.) removed 46 transitions
Ensure Unique test removed 9 places
Reduce places removed 10 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 88 transition count 45
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 35 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 108 place count 35 transition count 34
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 130 place count 24 transition count 34
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 146 place count 16 transition count 26
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 149 place count 16 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 153 place count 14 transition count 24
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 155 place count 14 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 14 transition count 21
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 159 place count 14 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 161 place count 14 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 13 transition count 18
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 163 place count 12 transition count 18
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 164 place count 11 transition count 17
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 11 transition count 17
Applied a total of 165 rules in 19 ms. Remains 11 /162 variables (removed 151) and now considering 17/157 (removed 140) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-193635632784483488.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10106002343389090508.kers'
[2026-05-25 17:01:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-193635632784483488.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10106002343389090508.kers]
Normalized transition count is 16 out of 17 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 11 cols 37 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-25 17:01:42] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10106002343389090508.kers
Total runtime 0 ms.
[2026-05-25 17:01:42] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 17:01:42] [INFO ] Invariant cache hit.
[2026-05-25 17:01:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:01:42] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [5]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 74 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/162 places, 16/157 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 15
Applied a total of 1 rules in 3 ms. Remains 10 /10 variables (removed 0) and now considering 15/16 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10964490469148709689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16938314389877663957.kers'
[2026-05-25 17:01:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10964490469148709689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16938314389877663957.kers]
Normalized transition count is 14 out of 15 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 14 rows 10 cols 29 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-25 17:01:42] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16938314389877663957.kers
Total runtime 0 ms.
[2026-05-25 17:01:42] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-25 17:01:42] [INFO ] Invariant cache hit.
[2026-05-25 17:01:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:01:42] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/162 places, 15/157 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 170 ms. Remains : 10/162 places, 15/157 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))&&F(p2))))'
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-13
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-13 finished in 417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (G(p1) U G(p2))))'
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 157/157 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 150 transition count 157
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 145 transition count 152
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 145 transition count 152
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 143 transition count 150
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 143 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 142 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 142 transition count 149
Applied a total of 28 rules in 12 ms. Remains 142 /162 variables (removed 20) and now considering 149/157 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10368812104923089.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7623820931772860572.kers'
[2026-05-25 17:01:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10368812104923089.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7623820931772860572.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 149 rows 142 cols 315 entries
Finished phase 1 with 136 SingleSign rule and 2 generalized
[2026-05-25 17:01:43] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7623820931772860572.kers
Total runtime 1 ms.
[2026-05-25 17:01:43] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 17:01:43] [INFO ] Invariant cache hit.
[2026-05-25 17:01:43] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2026-05-25 17:01:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 149/290 variables, 141/145 constraints. Problems are: Problem set: 0 solved, 148 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 1/291 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 146 constraints, problems are : Problem set: 0 solved, 148 unsolved in 11676 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 149/290 variables, 141/145 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 148/293 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 1/291 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 294 constraints, problems are : Problem set: 0 solved, 148 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41710ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 41711ms
Starting structural reductions in LTL mode, iteration 1 : 142/162 places, 149/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42057 ms. Remains : 142/162 places, 149/157 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (G(p1) U G(p2))))'
Stuttering acceptance computed with spot in 431 ms :[(NOT p2), (NOT p0), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (AND p2 (NOT p1)), (NOT p2), (NOT p2)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-14
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-14 finished in 42551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(X(F(p0))))))))'
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 157/157 transitions.
Graph (trivial) has 119 edges and 162 vertex of which 19 / 162 are part of one of the 1 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 180 edges and 144 vertex of which 91 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.0 ms
Discarding 53 places :
Also discarding 46 output transitions
Drop transitions (Output transitions of discarded places.) removed 46 transitions
Ensure Unique test removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 82 transition count 42
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 33 transition count 42
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 100 place count 33 transition count 32
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 120 place count 23 transition count 32
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 139 place count 13 transition count 23
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 142 place count 13 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 12 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 150 place count 9 transition count 20
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 152 place count 9 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 155 place count 9 transition count 15
Applied a total of 155 rules in 7 ms. Remains 9 /162 variables (removed 153) and now considering 15/157 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11566023375675364324.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-400689781706564459.kers'
[2026-05-25 17:02:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11566023375675364324.kers, --Pflows, --basisKERS=/tmp/petrispot-output-400689781706564459.kers]
Normalized transition count is 14 out of 15 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 14 rows 9 cols 35 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-25 17:02:25] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-400689781706564459.kers
Total runtime 0 ms.
[2026-05-25 17:02:25] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 17:02:25] [INFO ] Invariant cache hit.
[2026-05-25 17:02:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:02:25] [INFO ] Implicit Places using invariants and state equation in 43 ms returned [3]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 83 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/162 places, 14/157 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 12
Applied a total of 2 rules in 3 ms. Remains 8 /8 variables (removed 0) and now considering 12/14 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4399703874690495248.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8616989388037222901.kers'
[2026-05-25 17:02:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4399703874690495248.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8616989388037222901.kers]
Normalized transition count is 11 out of 12 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 8 cols 24 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-25 17:02:25] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8616989388037222901.kers
Total runtime 0 ms.
[2026-05-25 17:02:25] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 17:02:25] [INFO ] Invariant cache hit.
[2026-05-25 17:02:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:02:25] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/162 places, 12/157 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 174 ms. Remains : 8/162 places, 12/157 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((p0||X(X(X(X(F(p0))))))))'
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-15
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-15 finished in 536 ms.
All properties solved by simple procedures.
Total runtime 258834 ms.

BK_STOP 1779728546246

--------------------
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="IBMB2S565S3960-PT-none"
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 IBMB2S565S3960-PT-none, 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 r162-smll-177961107700100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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