About the Execution of ITS-Tools for DNAwalker-PT-12ringLLLarge
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2420.247 | 1259963.00 | 1423466.00 | 9692.00 | FFFFFFFFTFFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695800820.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 DNAwalker-PT-12ringLLLarge, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695800820
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.2K Mar 6 15:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 6 15:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 6 15:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 6 15:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 09:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 09:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 15 09:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 09:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 15:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Mar 6 15:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 6 15:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Mar 6 15:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 14 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 135K 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 DNAwalker-PT-12ringLLLarge-LTLFireability-00
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLFireability-01
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLFireability-02
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLFireability-03
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLFireability-04
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLFireability-05
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLFireability-06
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLFireability-07
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLFireability-08
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLFireability-09
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLFireability-10
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLFireability-11
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLFireability-12
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLFireability-13
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLFireability-14
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779667931080
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-12ringLLLarge
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 00:12:12] [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 00:12:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 00:12:12] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2026-05-25 00:12:12] [INFO ] Transformed 33 places.
[2026-05-25 00:12:12] [INFO ] Transformed 312 transitions.
[2026-05-25 00:12:12] [INFO ] Parsed PT model containing 33 places and 312 transitions and 916 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DNAwalker-PT-12ringLLLarge-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-12ringLLLarge-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 10 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Running 282 sub problems to find dead transitions.
[2026-05-25 00:12:12] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9700169091071372118.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3431182179678502906.kers'
[2026-05-25 00:12:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9700169091071372118.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3431182179678502906.kers]
Normalized transition count is 310 out of 311 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 33 cols 614 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-25 00:12:12] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3431182179678502906.kers
Total runtime 1 ms.
[2026-05-25 00:12:12] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 12/343 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
SMT process timed out in 20278ms, After SMT, problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 20294ms
[2026-05-25 00:12:32] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:12:32] [INFO ] Invariant cache hit.
[2026-05-25 00:12:32] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-25 00:12:32] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:12:32] [INFO ] Invariant cache hit.
[2026-05-25 00:12:33] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:12:33] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 20560 ms. Remains : 33/33 places, 312/312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:12:33] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:12:33] [INFO ] Invariant cache hit.
[2026-05-25 00:12:33] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-25 00:12:33] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:12:33] [INFO ] Invariant cache hit.
[2026-05-25 00:12:33] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:12:33] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 33/33 places, 312/312 transitions.
Support contains 25 out of 33 places after structural reductions.
[2026-05-25 00:12:33] [INFO ] Flatten gal took : 36 ms
[2026-05-25 00:12:33] [INFO ] Flatten gal took : 15 ms
[2026-05-25 00:12:33] [INFO ] Input system was already deterministic with 312 transitions.
Reduction of identical properties reduced properties to check from 40 to 38
RANDOM walk for 40000 steps (3081 resets) in 1811 ms. (22 steps per ms) remains 7/38 properties
BEST_FIRST walk for 40003 steps (165 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (188 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (235 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (187 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (194 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (184 resets) in 72 ms. (547 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (188 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
[2026-05-25 00:12:34] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:12:34] [INFO ] Invariant cache hit.
[2026-05-25 00:12:34] [INFO ] State equation strengthened by 71 read => feed constraints.
Problem AtomicPropp15 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 178/188 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 17/27 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 144/332 variables, 17/44 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 53/97 constraints. Problems are: Problem set: 1 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 11/343 variables, 6/103 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/344 variables, 1/104 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/344 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 104 constraints, problems are : Problem set: 1 solved, 6 unsolved in 361 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 162/170 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 17/25 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 162/332 variables, 19/44 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 53/97 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 6/103 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/344 variables, and 109 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5009 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5394ms problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 312/312 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 33 transition count 304
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 28 transition count 299
Applied a total of 13 rules in 36 ms. Remains 28 /33 variables (removed 5) and now considering 299/312 (removed 13) transitions.
Running 275 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13621095833050275116.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3857934848363934234.kers'
[2026-05-25 00:12:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13621095833050275116.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3857934848363934234.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 299 rows 28 cols 598 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-25 00:12:39] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3857934848363934234.kers
Total runtime 0 ms.
[2026-05-25 00:12:39] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 299/326 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 1/327 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/327 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 45 constraints, problems are : Problem set: 0 solved, 275 unsolved in 9685 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 299/326 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 275/319 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 320 constraints, problems are : Problem set: 0 solved, 275 unsolved in 20024 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29803ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 29804ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29841 ms. Remains : 28/33 places, 299/312 transitions.
RANDOM walk for 40000 steps (4470 resets) in 218 ms. (182 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (341 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (366 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (383 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (363 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (374 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (371 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 678842 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :0 out of 6
Probabilistic random walk after 678842 steps, saw 147423 distinct states, run finished after 3009 ms. (steps per millisecond=225 ) properties seen :0
[2026-05-25 00:13:12] [INFO ] Invariant cache hit.
[2026-05-25 00:13:12] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 162/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 156/326 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/327 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/327 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 45 constraints, problems are : Problem set: 0 solved, 6 unsolved in 264 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 162/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 156/326 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 51 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45006 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45277ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 299/299 transitions.
Applied a total of 0 rules in 19 ms. Remains 28 /28 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 28/28 places, 299/299 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 299/299 transitions.
Applied a total of 0 rules in 7 ms. Remains 28 /28 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2026-05-25 00:13:58] [INFO ] Invariant cache hit.
[2026-05-25 00:13:58] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-25 00:13:58] [INFO ] Invariant cache hit.
[2026-05-25 00:13:58] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-25 00:13:58] [INFO ] Implicit Places using invariants and state equation in 485 ms returned [9]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Implicit Place search using SMT with State Equation took 559 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 27/28 places, 288/299 transitions.
Applied a total of 0 rules in 5 ms. Remains 27 /27 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 571 ms. Remains : 27/28 places, 288/299 transitions.
RANDOM walk for 40000 steps (3409 resets) in 808 ms. (49 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (297 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (332 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (339 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (322 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (316 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (326 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 682266 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :0 out of 6
Probabilistic random walk after 682266 steps, saw 166641 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14313822115695634145.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14560666953539393279.kers'
[2026-05-25 00:14:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14313822115695634145.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14560666953539393279.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 288 rows 27 cols 573 entries
Finished phase 1 with 27 SingleSign rule and 0 generalized
[2026-05-25 00:14:02] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14560666953539393279.kers
Total runtime 1 ms.
[2026-05-25 00:14:02] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 162/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 144/314 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/315 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 44 constraints, problems are : Problem set: 0 solved, 6 unsolved in 261 ms.
Refiners :[State Equation: 27/27 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 162/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 144/314 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 315/315 variables, and 50 constraints, problems are : Problem set: 0 solved, 6 unsolved in 75017 ms.
Refiners :[State Equation: 27/27 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 75291ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 288/288 transitions.
Applied a total of 0 rules in 5 ms. Remains 27 /27 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 27/27 places, 288/288 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 288/288 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2026-05-25 00:15:17] [INFO ] Invariant cache hit.
[2026-05-25 00:15:17] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 00:15:17] [INFO ] Invariant cache hit.
[2026-05-25 00:15:17] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-25 00:15:17] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2026-05-25 00:15:17] [INFO ] Redundant transitions in 21 ms returned []
Running 264 sub problems to find dead transitions.
[2026-05-25 00:15:17] [INFO ] Invariant cache hit.
[2026-05-25 00:15:17] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 288/314 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 1/315 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 0/315 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 44 constraints, problems are : Problem set: 0 solved, 264 unsolved in 8476 ms.
Refiners :[State Equation: 27/27 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 288/314 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 264/307 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 315/315 variables, and 308 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30011 ms.
Refiners :[State Equation: 27/27 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38553ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 38553ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39133 ms. Remains : 27/27 places, 288/288 transitions.
FORMULA DNAwalker-PT-12ringLLLarge-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DNAwalker-PT-12ringLLLarge-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DNAwalker-PT-12ringLLLarge-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 33 stabilizing places and 310 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1) U (p2||X(p2)))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Running 282 sub problems to find dead transitions.
[2026-05-25 00:15:57] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7051269353036572087.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14963631670618752693.kers'
[2026-05-25 00:15:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7051269353036572087.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14963631670618752693.kers]
Normalized transition count is 310 out of 311 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 33 cols 614 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-25 00:15:57] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14963631670618752693.kers
Total runtime 1 ms.
[2026-05-25 00:15:57] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 12/343 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
SMT process timed out in 20076ms, After SMT, problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 20077ms
[2026-05-25 00:16:17] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:16:17] [INFO ] Invariant cache hit.
[2026-05-25 00:16:17] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 00:16:17] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:16:17] [INFO ] Invariant cache hit.
[2026-05-25 00:16:17] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:16:17] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 20581 ms. Remains : 33/33 places, 312/312 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) U p1) U (X(p2)||p2))))'
Stuttering acceptance computed with spot in 384 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLFireability-00
Stuttering criterion allowed to conclude after 21 steps with 2 reset in 3 ms.
FORMULA DNAwalker-PT-12ringLLLarge-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-12ringLLLarge-LTLFireability-00 finished in 21069 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((X(p0)&&F(p1))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:16:18] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:16:18] [INFO ] Invariant cache hit.
[2026-05-25 00:16:18] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 00:16:18] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:16:18] [INFO ] Invariant cache hit.
[2026-05-25 00:16:18] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:16:18] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 541 ms. Remains : 33/33 places, 312/312 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((X(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLFireability-01
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-12ringLLLarge-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-12ringLLLarge-LTLFireability-01 finished in 693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X(p0) U !(F(p2)&&p1))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:16:18] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:16:18] [INFO ] Invariant cache hit.
[2026-05-25 00:16:18] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 00:16:18] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:16:18] [INFO ] Invariant cache hit.
[2026-05-25 00:16:18] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:16:19] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 33/33 places, 312/312 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X(p0) U !(F(p2)&&p1))))'
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p2), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-12ringLLLarge-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-12ringLLLarge-LTLFireability-02 finished in 772 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 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 11 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:16:19] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:16:19] [INFO ] Invariant cache hit.
[2026-05-25 00:16:19] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 00:16:19] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:16:19] [INFO ] Invariant cache hit.
[2026-05-25 00:16:19] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:16:20] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2026-05-25 00:16:20] [INFO ] Redundant transitions in 14 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 459 ms. Remains : 33/33 places, 312/312 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 51 ms :[(NOT p0)]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLFireability-03
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-12ringLLLarge-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-12ringLLLarge-LTLFireability-03 finished in 546 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)&&(X(!p0) U (F(!p1)&&(G(!p2)||(!p2&&F(!p3)))))))'
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:16:20] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:16:20] [INFO ] Invariant cache hit.
[2026-05-25 00:16:20] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 00:16:20] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:16:20] [INFO ] Invariant cache hit.
[2026-05-25 00:16:20] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:16:20] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 33/33 places, 312/312 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)&&(X(!p0) U (F(!p1)&&(G(!p2)||(!p2&&F(!p3)))))))'
Stuttering acceptance computed with spot in 423 ms :[(OR (NOT p0) p1 p2), (NOT p0), (OR p2 p1 p0), (AND p2 p3), p1, true, p3, (AND p3 (NOT p0) p2), (OR (AND p1 p3) (AND p2 p3) (AND p0 p3)), (AND p3 p1)]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLFireability-04
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-12ringLLLarge-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-12ringLLLarge-LTLFireability-04 finished in 793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U p1) U (!p2 U (!p0 U p3))))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:16:20] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:16:20] [INFO ] Invariant cache hit.
[2026-05-25 00:16:21] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 00:16:21] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:16:21] [INFO ] Invariant cache hit.
[2026-05-25 00:16:21] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:16:21] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 528 ms. Remains : 33/33 places, 312/312 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U p1) U (!p2 U (!p0 U p3))))))'
Stuttering acceptance computed with spot in 292 ms :[(NOT p3), (NOT p3), (NOT p1), (NOT p3), (NOT p3), (NOT p3), true]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLFireability-07
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-12ringLLLarge-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-12ringLLLarge-LTLFireability-07 finished in 861 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 U (!p1||G(p0))))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 10 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:16:21] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:16:21] [INFO ] Invariant cache hit.
[2026-05-25 00:16:21] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 00:16:21] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:16:21] [INFO ] Invariant cache hit.
[2026-05-25 00:16:21] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:16:22] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2026-05-25 00:16:22] [INFO ] Redundant transitions in 12 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 724 ms. Remains : 33/33 places, 312/312 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 U (!p1||G(p0))))))'
Stuttering acceptance computed with spot in 80 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 180 ms.
Product exploration explored 100000 steps with 1 reset in 123 ms.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (3078 resets) in 161 ms. (246 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (224 resets) in 470 ms. (84 steps per ms) remains 1/1 properties
[2026-05-25 00:16:23] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:16:23] [INFO ] Invariant cache hit.
[2026-05-25 00:16:23] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 111/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 207/323 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 44/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/341 variables, 7/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 9/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/343 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/344 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/344 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/344 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 71/71 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, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 111/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 207/323 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 44/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/341 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 9/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/344 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1186 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1304ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 312/312 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 33 transition count 304
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 28 transition count 299
Applied a total of 13 rules in 19 ms. Remains 28 /33 variables (removed 5) and now considering 299/312 (removed 13) transitions.
Running 275 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3039491380048633756.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12677586246492961151.kers'
[2026-05-25 00:16:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3039491380048633756.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12677586246492961151.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 299 rows 28 cols 598 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-25 00:16:24] [INFO ] Computed 0 invariants in 2 ms
Computed 0 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12677586246492961151.kers
Total runtime 3 ms.
[2026-05-25 00:16:24] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 299/326 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 1/327 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/327 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 45 constraints, problems are : Problem set: 0 solved, 275 unsolved in 9411 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 299/326 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 275/319 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 320 constraints, problems are : Problem set: 0 solved, 275 unsolved in 20021 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29502ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 29503ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29523 ms. Remains : 28/33 places, 299/312 transitions.
RANDOM walk for 40000 steps (4425 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (360 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1341227 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :0 out of 1
Probabilistic random walk after 1341227 steps, saw 294936 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
[2026-05-25 00:16:57] [INFO ] Invariant cache hit.
[2026-05-25 00:16:57] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 111/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 202/318 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/327 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/327 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 45 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 17/17 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, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 111/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 202/318 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 46 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9100 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9227ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 299/299 transitions.
Applied a total of 0 rules in 8 ms. Remains 28 /28 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 28/28 places, 299/299 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 299/299 transitions.
Applied a total of 0 rules in 5 ms. Remains 28 /28 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2026-05-25 00:17:06] [INFO ] Invariant cache hit.
[2026-05-25 00:17:06] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 00:17:06] [INFO ] Invariant cache hit.
[2026-05-25 00:17:06] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-25 00:17:07] [INFO ] Implicit Places using invariants and state equation in 563 ms returned [9, 22]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 23 transitions.
Implicit Place search using SMT with State Equation took 603 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/28 places, 276/299 transitions.
Applied a total of 0 rules in 5 ms. Remains 26 /26 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 613 ms. Remains : 26/28 places, 276/299 transitions.
RANDOM walk for 40000 steps (2230 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (290 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1513084 steps, run timeout after 3003 ms. (steps per millisecond=503 ) properties seen :0 out of 1
Probabilistic random walk after 1513084 steps, saw 341596 distinct states, run finished after 3003 ms. (steps per millisecond=503 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14786608219777456585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15970467530215517411.kers'
[2026-05-25 00:17:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14786608219777456585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15970467530215517411.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 276 rows 26 cols 547 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-25 00:17:10] [INFO ] Computed 0 invariants in 2 ms
Computed 0 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15970467530215517411.kers
Total runtime 3 ms.
[2026-05-25 00:17:10] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 110/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 178/293 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/302 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 43 constraints, problems are : Problem set: 0 solved, 1 unsolved in 100 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 17/17 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, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 110/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 178/293 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 44 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15110 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15224ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 276/276 transitions.
Applied a total of 0 rules in 11 ms. Remains 26 /26 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 26/26 places, 276/276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 276/276 transitions.
Applied a total of 0 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2026-05-25 00:17:25] [INFO ] Invariant cache hit.
[2026-05-25 00:17:25] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 00:17:25] [INFO ] Invariant cache hit.
[2026-05-25 00:17:25] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-25 00:17:25] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2026-05-25 00:17:25] [INFO ] Redundant transitions in 1 ms returned []
Running 254 sub problems to find dead transitions.
[2026-05-25 00:17:25] [INFO ] Invariant cache hit.
[2026-05-25 00:17:25] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 276/301 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 1/302 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 0/302 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 43 constraints, problems are : Problem set: 0 solved, 254 unsolved in 8014 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 276/301 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 254/296 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 297 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30023 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38080ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 38081ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38599 ms. Remains : 26/26 places, 276/276 transitions.
Knowledge based reduction with 5 factoid took 264 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Knowledge-based reduction took 101413 ms.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 13 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Running 282 sub problems to find dead transitions.
[2026-05-25 00:18:04] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14042646540374946211.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5826919176527456993.kers'
[2026-05-25 00:18:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14042646540374946211.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5826919176527456993.kers]
Normalized transition count is 310 out of 311 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 33 cols 614 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-25 00:18:04] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5826919176527456993.kers
Total runtime 1 ms.
[2026-05-25 00:18:04] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 12/343 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
SMT process timed out in 20081ms, After SMT, problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 20082ms
[2026-05-25 00:18:24] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:18:24] [INFO ] Invariant cache hit.
[2026-05-25 00:18:24] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 00:18:24] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:18:24] [INFO ] Invariant cache hit.
[2026-05-25 00:18:24] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:18:25] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
[2026-05-25 00:18:25] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20841 ms. Remains : 33/33 places, 312/312 transitions.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (3103 resets) in 188 ms. (211 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (222 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
[2026-05-25 00:18:25] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:18:25] [INFO ] Invariant cache hit.
[2026-05-25 00:18:25] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 111/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 207/323 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 44/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/341 variables, 7/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 9/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/343 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/344 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/344 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/344 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 123 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 71/71 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, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 111/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 207/323 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 44/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/341 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 9/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/344 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1207 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1361ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 312/312 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 33 transition count 304
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 28 transition count 299
Applied a total of 13 rules in 10 ms. Remains 28 /33 variables (removed 5) and now considering 299/312 (removed 13) transitions.
Running 275 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5056841538009302280.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6971322811857165906.kers'
[2026-05-25 00:18:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5056841538009302280.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6971322811857165906.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 299 rows 28 cols 598 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-25 00:18:26] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6971322811857165906.kers
Total runtime 1 ms.
[2026-05-25 00:18:26] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 299/326 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 1/327 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/327 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 45 constraints, problems are : Problem set: 0 solved, 275 unsolved in 9379 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 299/326 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 275/319 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 320 constraints, problems are : Problem set: 0 solved, 275 unsolved in 20018 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29461ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 29466ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29478 ms. Remains : 28/33 places, 299/312 transitions.
RANDOM walk for 40000 steps (4351 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (368 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1391294 steps, run timeout after 3001 ms. (steps per millisecond=463 ) properties seen :0 out of 1
Probabilistic random walk after 1391294 steps, saw 305989 distinct states, run finished after 3001 ms. (steps per millisecond=463 ) properties seen :0
[2026-05-25 00:18:59] [INFO ] Invariant cache hit.
[2026-05-25 00:18:59] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 111/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 202/318 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/327 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/327 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 45 constraints, problems are : Problem set: 0 solved, 1 unsolved in 96 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 17/17 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, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 111/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 202/318 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 46 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9094 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9214ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 299/299 transitions.
Applied a total of 0 rules in 7 ms. Remains 28 /28 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 28/28 places, 299/299 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 299/299 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2026-05-25 00:19:08] [INFO ] Invariant cache hit.
[2026-05-25 00:19:08] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 00:19:08] [INFO ] Invariant cache hit.
[2026-05-25 00:19:08] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-25 00:19:09] [INFO ] Implicit Places using invariants and state equation in 518 ms returned [9, 22]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 23 transitions.
Implicit Place search using SMT with State Equation took 587 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/28 places, 276/299 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 593 ms. Remains : 26/28 places, 276/299 transitions.
RANDOM walk for 40000 steps (2247 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (310 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1522990 steps, run timeout after 3001 ms. (steps per millisecond=507 ) properties seen :0 out of 1
Probabilistic random walk after 1522990 steps, saw 343603 distinct states, run finished after 3001 ms. (steps per millisecond=507 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2851223915255637669.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1438312323157938468.kers'
[2026-05-25 00:19:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2851223915255637669.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1438312323157938468.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 276 rows 26 cols 547 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-25 00:19:12] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1438312323157938468.kers
Total runtime 1 ms.
[2026-05-25 00:19:12] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 110/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 178/293 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/302 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 43 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 17/17 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, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 110/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 178/293 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 44 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15105 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15215ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 276/276 transitions.
Applied a total of 0 rules in 8 ms. Remains 26 /26 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 26/26 places, 276/276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 276/276 transitions.
Applied a total of 0 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2026-05-25 00:19:27] [INFO ] Invariant cache hit.
[2026-05-25 00:19:27] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 00:19:27] [INFO ] Invariant cache hit.
[2026-05-25 00:19:27] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-25 00:19:28] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2026-05-25 00:19:28] [INFO ] Redundant transitions in 3 ms returned []
Running 254 sub problems to find dead transitions.
[2026-05-25 00:19:28] [INFO ] Invariant cache hit.
[2026-05-25 00:19:28] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 276/301 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 1/302 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 0/302 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 43 constraints, problems are : Problem set: 0 solved, 254 unsolved in 8088 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 276/301 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 254/296 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 1/302 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 297 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30014 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38147ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 38147ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38806 ms. Remains : 26/26 places, 276/276 transitions.
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Knowledge-based reduction took 101389 ms.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 195 ms.
Product exploration explored 100000 steps with 0 reset in 111 ms.
Built C files in :
/tmp/ltsmin3296609631628412956
[2026-05-25 00:20:07] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2026-05-25 00:20:07] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:20:07] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2026-05-25 00:20:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:20:07] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2026-05-25 00:20:07] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:20:07] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3296609631628412956
Running compilation step : cd /tmp/ltsmin3296609631628412956;'/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 731 ms.
Running link step : cd /tmp/ltsmin3296609631628412956;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin3296609631628412956;'/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/stateBased2937340616177770771.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 6 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Running 282 sub problems to find dead transitions.
[2026-05-25 00:20:22] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9343864122680665865.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13208835960954124316.kers'
[2026-05-25 00:20:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9343864122680665865.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13208835960954124316.kers]
Normalized transition count is 310 out of 311 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 33 cols 614 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-25 00:20:22] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13208835960954124316.kers
Total runtime 1 ms.
[2026-05-25 00:20:22] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 12/343 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
SMT process timed out in 20087ms, After SMT, problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 20088ms
[2026-05-25 00:20:42] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:20:42] [INFO ] Invariant cache hit.
[2026-05-25 00:20:42] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 00:20:42] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:20:42] [INFO ] Invariant cache hit.
[2026-05-25 00:20:42] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:20:42] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2026-05-25 00:20:42] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20808 ms. Remains : 33/33 places, 312/312 transitions.
Built C files in :
/tmp/ltsmin17505490318211727953
[2026-05-25 00:20:43] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2026-05-25 00:20:43] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:20:43] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2026-05-25 00:20:43] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:20:43] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2026-05-25 00:20:43] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:20:43] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17505490318211727953
Running compilation step : cd /tmp/ltsmin17505490318211727953;'/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 610 ms.
Running link step : cd /tmp/ltsmin17505490318211727953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin17505490318211727953;'/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/stateBased15587619938744112715.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 00:20:58] [INFO ] Flatten gal took : 14 ms
[2026-05-25 00:20:58] [INFO ] Flatten gal took : 10 ms
[2026-05-25 00:20:58] [INFO ] Time to serialize gal into /tmp/LTL12222017296342459703.gal : 4 ms
[2026-05-25 00:20:58] [INFO ] Time to serialize properties into /tmp/LTL9680970779526022811.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12222017296342459703.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2539183961574839836.hoa' '-atoms' '/tmp/LTL9680970779526022811.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9680970779526022811.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2539183961574839836.hoa
Detected timeout of ITS tools.
[2026-05-25 00:21:13] [INFO ] Flatten gal took : 9 ms
[2026-05-25 00:21:13] [INFO ] Flatten gal took : 9 ms
[2026-05-25 00:21:13] [INFO ] Time to serialize gal into /tmp/LTL7405647922960946142.gal : 3 ms
[2026-05-25 00:21:13] [INFO ] Time to serialize properties into /tmp/LTL9201072646604816113.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7405647922960946142.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9201072646604816113.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((A26>=2)&&(A27>=1))")U((!("(((A10>=1)&&(A12>=2))||((A2>=2)&&(A26>=1)))"))||(G("((A26>=2)&&(A27>=1))")))))))
Formula 0 simplified : FG(!"((A26>=2)&&(A27>=1))" M "(((A10>=1)&&(A12>=2))||((A2>=2)&&(A26>=1)))")
Detected timeout of ITS tools.
[2026-05-25 00:21:28] [INFO ] Flatten gal took : 9 ms
[2026-05-25 00:21:28] [INFO ] Applying decomposition
[2026-05-25 00:21:28] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14908089002604402753.txt' '-o' '/tmp/graph14908089002604402753.bin' '-w' '/tmp/graph14908089002604402753.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14908089002604402753.bin' '-l' '-1' '-v' '-w' '/tmp/graph14908089002604402753.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:21:28] [INFO ] Decomposing Gal with order
[2026-05-25 00:21:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:21:28] [INFO ] Removed a total of 544 redundant transitions.
[2026-05-25 00:21:28] [INFO ] Flatten gal took : 65 ms
[2026-05-25 00:21:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-25 00:21:28] [INFO ] Time to serialize gal into /tmp/LTL16291952604344229076.gal : 2 ms
[2026-05-25 00:21:28] [INFO ] Time to serialize properties into /tmp/LTL3476070422175640946.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16291952604344229076.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3476070422175640946.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((u25.A26>=2)&&(u26.A27>=1))")U((!("(((u9.A10>=1)&&(u11.A12>=2))||((u1.A2>=2)&&(u25.A26>=1)))"))||(G("((u25.A26>=2)&&(u26.A27...168
Formula 0 simplified : FG(!"((u25.A26>=2)&&(u26.A27>=1))" M "(((u9.A10>=1)&&(u11.A12>=2))||((u1.A2>=2)&&(u25.A26>=1)))")
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30...1825
Detected timeout of ITS tools.
Treatment of property DNAwalker-PT-12ringLLLarge-LTLFireability-08 finished in 321641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((G(!p0) U ((F(G(p1))||X(p2)) U p3))))))'
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:21:43] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:21:43] [INFO ] Invariant cache hit.
[2026-05-25 00:21:43] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-25 00:21:43] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:21:43] [INFO ] Invariant cache hit.
[2026-05-25 00:21:43] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:21:43] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 33/33 places, 312/312 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((G(!p0) U ((F(G(p1))||X(p2)) U p3))))))'
Stuttering acceptance computed with spot in 302 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND p0 (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 99 ms.
Product exploration explored 100000 steps with 0 reset in 103 ms.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge based reduction with 6 factoid took 893 ms. Reduced automaton from 7 states, 15 edges and 4 AP (stutter sensitive) to 7 states, 15 edges and 4 AP (stutter sensitive).
RANDOM walk for 3430 steps (267 resets) in 38 ms. (87 steps per ms) remains 0/8 properties
Knowledge based reduction with 6 factoid took 2229 ms. Reduced automaton from 7 states, 15 edges and 4 AP (stutter sensitive) to 7 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND p0 (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) p0)]
[2026-05-25 00:21:47] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:21:47] [INFO ] Invariant cache hit.
[2026-05-25 00:21:47] [INFO ] [Real]Absence check using state equation in 40 ms returned unsat
Proved EG (NOT p3) asserting that LTL formula F !(NOT p3) is false.
Negative knowledge disproves property using: (F p3)
Knowledge-based reduction took 3603 ms.
FORMULA DNAwalker-PT-12ringLLLarge-LTLFireability-09 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property DNAwalker-PT-12ringLLLarge-LTLFireability-09 finished in 4556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U X((X(p1)||(F(!p3)&&p2))))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:21:48] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:21:48] [INFO ] Invariant cache hit.
[2026-05-25 00:21:48] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 00:21:48] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:21:48] [INFO ] Invariant cache hit.
[2026-05-25 00:21:48] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:21:48] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 380 ms. Remains : 33/33 places, 312/312 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U X((X(p1)||(F(!p3)&&p2))))))'
Stuttering acceptance computed with spot in 489 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (NOT p1), (AND p3 (NOT p1)), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3) (AND p0 (NOT p1))), (AND (NOT p1) p3), p3, p0, (AND p3 p0)]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 103 ms.
Product exploration explored 100000 steps with 0 reset in 123 ms.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge based reduction with 13 factoid took 284 ms. Reduced automaton from 12 states, 24 edges and 4 AP (stutter sensitive) to 8 states, 17 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (3067 resets) in 257 ms. (155 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (186 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (194 resets) in 684 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (190 resets) in 287 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (180 resets) in 562 ms. (71 steps per ms) remains 4/4 properties
[2026-05-25 00:21:50] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:21:50] [INFO ] Invariant cache hit.
[2026-05-25 00:21:50] [INFO ] State equation strengthened by 71 read => feed constraints.
Problem apf5 is UNSAT
Problem apf10 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 129/135 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/26 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 199/334 variables, 22/48 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 50/98 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/98 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 9/343 variables, 5/103 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/344 variables, 1/104 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/344 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 104 constraints, problems are : Problem set: 2 solved, 2 unsolved in 153 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 9/13 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 231/331 variables, 22/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 61/96 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 2/98 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/98 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/344 variables, and 105 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2174 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2335ms problems are : Problem set: 2 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 312/312 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 33 transition count 304
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 28 transition count 299
Applied a total of 13 rules in 15 ms. Remains 28 /33 variables (removed 5) and now considering 299/312 (removed 13) transitions.
Running 275 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9339410463791974015.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2529367481896597877.kers'
[2026-05-25 00:21:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9339410463791974015.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2529367481896597877.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 299 rows 28 cols 598 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-25 00:21:52] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2529367481896597877.kers
Total runtime 2 ms.
[2026-05-25 00:21:52] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 299/326 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 1/327 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/327 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 37 constraints, problems are : Problem set: 0 solved, 275 unsolved in 8891 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 299/326 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/327 variables, and 311 constraints, problems are : Problem set: 0 solved, 275 unsolved in 20060 ms.
Refiners :[State Equation: 27/28 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29000ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 29001ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29016 ms. Remains : 28/33 places, 299/312 transitions.
RANDOM walk for 40000 steps (4423 resets) in 242 ms. (164 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (381 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (366 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 951866 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :0 out of 2
Probabilistic random walk after 951866 steps, saw 204827 distinct states, run finished after 3001 ms. (steps per millisecond=317 ) properties seen :0
[2026-05-25 00:22:24] [INFO ] Invariant cache hit.
[2026-05-25 00:22:24] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 225/325 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/327 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/327 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 37 constraints, problems are : Problem set: 0 solved, 2 unsolved in 101 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 225/325 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 39 constraints, problems are : Problem set: 0 solved, 2 unsolved in 18118 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18224ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 299/299 transitions.
Applied a total of 0 rules in 9 ms. Remains 28 /28 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 28/28 places, 299/299 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 299/299 transitions.
Applied a total of 0 rules in 5 ms. Remains 28 /28 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2026-05-25 00:22:42] [INFO ] Invariant cache hit.
[2026-05-25 00:22:42] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-25 00:22:42] [INFO ] Invariant cache hit.
[2026-05-25 00:22:42] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 00:22:43] [INFO ] Implicit Places using invariants and state equation in 414 ms returned [8, 22]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 24 transitions.
Implicit Place search using SMT with State Equation took 470 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/28 places, 275/299 transitions.
Applied a total of 0 rules in 6 ms. Remains 26 /26 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 481 ms. Remains : 26/28 places, 275/299 transitions.
RANDOM walk for 40000 steps (2169 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (267 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (259 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 959991 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :0 out of 2
Probabilistic random walk after 959991 steps, saw 215959 distinct states, run finished after 3001 ms. (steps per millisecond=319 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3722754937675434365.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14688808211164488970.kers'
[2026-05-25 00:22:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3722754937675434365.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14688808211164488970.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 275 rows 26 cols 546 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-25 00:22:46] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14688808211164488970.kers
Total runtime 1 ms.
[2026-05-25 00:22:46] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 200/299 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/301 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/301 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 35 constraints, problems are : Problem set: 0 solved, 2 unsolved in 92 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 200/299 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 37 constraints, problems are : Problem set: 0 solved, 2 unsolved in 30128 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30232ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 275/275 transitions.
Applied a total of 0 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 26/26 places, 275/275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 275/275 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 275/275 (removed 0) transitions.
[2026-05-25 00:23:16] [INFO ] Invariant cache hit.
[2026-05-25 00:23:16] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-25 00:23:16] [INFO ] Invariant cache hit.
[2026-05-25 00:23:16] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 00:23:16] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2026-05-25 00:23:16] [INFO ] Redundant transitions in 3 ms returned []
Running 252 sub problems to find dead transitions.
[2026-05-25 00:23:16] [INFO ] Invariant cache hit.
[2026-05-25 00:23:16] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 275/300 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 1/301 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/301 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 35 constraints, problems are : Problem set: 0 solved, 252 unsolved in 7445 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 275/300 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 252/286 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 1/301 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 287 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30016 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37511ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 37512ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37872 ms. Remains : 26/26 places, 275/275 transitions.
Found 2 invariant AP formulas.
Knowledge based reduction with 15 factoid took 659 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[p0, (NOT p1), (OR (NOT p1) p0), (NOT p1), (NOT p1), true, (NOT p1)]
[2026-05-25 00:23:55] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1802249945323682466.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6785206931848963543.kers'
[2026-05-25 00:23:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1802249945323682466.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6785206931848963543.kers]
Normalized transition count is 310 out of 311 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 33 cols 614 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-25 00:23:55] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6785206931848963543.kers
Total runtime 1 ms.
[2026-05-25 00:23:55] [INFO ] [Real]Absence check using state equation in 33 ms returned unsat
Proved EG (NOT p1) asserting that LTL formula F !(NOT p1) is false.
Knowledge-based reduction took 126275 ms.
Stuttering acceptance computed with spot in 283 ms :[p0, (NOT p1), (OR (NOT p1) p0), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 4 out of 33 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Running 282 sub problems to find dead transitions.
[2026-05-25 00:23:55] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:23:55] [INFO ] Invariant cache hit.
[2026-05-25 00:23:55] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 12/343 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
SMT process timed out in 20072ms, After SMT, problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 20074ms
[2026-05-25 00:24:15] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:24:15] [INFO ] Invariant cache hit.
[2026-05-25 00:24:15] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 00:24:15] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:24:15] [INFO ] Invariant cache hit.
[2026-05-25 00:24:15] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:24:16] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 20457 ms. Remains : 33/33 places, 312/312 transitions.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (3110 resets) in 215 ms. (185 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (193 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (195 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
[2026-05-25 00:24:16] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:24:16] [INFO ] Invariant cache hit.
[2026-05-25 00:24:16] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 231/331 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 61/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/343 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/344 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/344 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 104 constraints, problems are : Problem set: 0 solved, 2 unsolved in 139 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 231/331 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 61/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/344 variables, and 105 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2161 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2313ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 312/312 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 33 transition count 304
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 28 transition count 299
Applied a total of 13 rules in 5 ms. Remains 28 /33 variables (removed 5) and now considering 299/312 (removed 13) transitions.
Running 275 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15603542061011852725.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12281334295699547918.kers'
[2026-05-25 00:24:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15603542061011852725.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12281334295699547918.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 299 rows 28 cols 598 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-25 00:24:18] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12281334295699547918.kers
Total runtime 1 ms.
[2026-05-25 00:24:18] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 299/326 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 1/327 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/327 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 37 constraints, problems are : Problem set: 0 solved, 275 unsolved in 8781 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 299/326 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/327 variables, and 311 constraints, problems are : Problem set: 0 solved, 275 unsolved in 20056 ms.
Refiners :[State Equation: 27/28 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28900ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 28901ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28908 ms. Remains : 28/33 places, 299/312 transitions.
RANDOM walk for 40000 steps (4422 resets) in 224 ms. (177 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (381 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (371 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 972576 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :0 out of 2
Probabilistic random walk after 972576 steps, saw 209198 distinct states, run finished after 3001 ms. (steps per millisecond=324 ) properties seen :0
[2026-05-25 00:24:50] [INFO ] Invariant cache hit.
[2026-05-25 00:24:50] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 225/325 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/327 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/327 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 37 constraints, problems are : Problem set: 0 solved, 2 unsolved in 89 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 225/325 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 39 constraints, problems are : Problem set: 0 solved, 2 unsolved in 18118 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18213ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 299/299 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 28/28 places, 299/299 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 299/299 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2026-05-25 00:25:08] [INFO ] Invariant cache hit.
[2026-05-25 00:25:08] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 00:25:08] [INFO ] Invariant cache hit.
[2026-05-25 00:25:09] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 00:25:09] [INFO ] Implicit Places using invariants and state equation in 446 ms returned [8, 22]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 24 transitions.
Implicit Place search using SMT with State Equation took 485 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/28 places, 275/299 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 489 ms. Remains : 26/28 places, 275/299 transitions.
RANDOM walk for 40000 steps (2172 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (266 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (256 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 933102 steps, run timeout after 3001 ms. (steps per millisecond=310 ) properties seen :0 out of 2
Probabilistic random walk after 933102 steps, saw 210886 distinct states, run finished after 3001 ms. (steps per millisecond=310 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11188176746874267833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18436809646928557015.kers'
[2026-05-25 00:25:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11188176746874267833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18436809646928557015.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 275 rows 26 cols 546 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-25 00:25:12] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18436809646928557015.kers
Total runtime 1 ms.
[2026-05-25 00:25:12] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 200/299 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/301 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/301 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 35 constraints, problems are : Problem set: 0 solved, 2 unsolved in 79 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 200/299 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 37 constraints, problems are : Problem set: 0 solved, 2 unsolved in 30100 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30188ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 275/275 transitions.
Applied a total of 0 rules in 9 ms. Remains 26 /26 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 26/26 places, 275/275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 275/275 transitions.
Applied a total of 0 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 275/275 (removed 0) transitions.
[2026-05-25 00:25:42] [INFO ] Invariant cache hit.
[2026-05-25 00:25:42] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 00:25:42] [INFO ] Invariant cache hit.
[2026-05-25 00:25:42] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 00:25:43] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2026-05-25 00:25:43] [INFO ] Redundant transitions in 2 ms returned []
Running 252 sub problems to find dead transitions.
[2026-05-25 00:25:43] [INFO ] Invariant cache hit.
[2026-05-25 00:25:43] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 275/300 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 1/301 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/301 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 35 constraints, problems are : Problem set: 0 solved, 252 unsolved in 7371 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 275/300 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 252/286 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 1/301 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 287 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30025 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37445ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 37446ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37814 ms. Remains : 26/26 places, 275/275 transitions.
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[p0, (NOT p1), (OR (NOT p1) p0), (NOT p1), (NOT p1), true, (NOT p1)]
[2026-05-25 00:26:20] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9995586979817352507.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10252614233537941000.kers'
[2026-05-25 00:26:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9995586979817352507.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10252614233537941000.kers]
Normalized transition count is 310 out of 311 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 33 cols 614 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-25 00:26:20] [INFO ] Computed 0 invariants in 2 ms
Computed 0 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10252614233537941000.kers
Total runtime 3 ms.
[2026-05-25 00:26:21] [INFO ] [Real]Absence check using state equation in 33 ms returned unsat
Proved EG (NOT p1) asserting that LTL formula F !(NOT p1) is false.
Knowledge-based reduction took 124820 ms.
Stuttering acceptance computed with spot in 233 ms :[p0, (NOT p1), (OR (NOT p1) p0), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 264 ms :[p0, (NOT p1), (OR (NOT p1) p0), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-12ringLLLarge-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-12ringLLLarge-LTLFireability-10 finished in 273522 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&&G(p1)&&X(X(F(p2))))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Running 282 sub problems to find dead transitions.
[2026-05-25 00:26:21] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:26:21] [INFO ] Invariant cache hit.
[2026-05-25 00:26:21] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 12/343 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
SMT process timed out in 20083ms, After SMT, problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 20085ms
[2026-05-25 00:26:41] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:26:41] [INFO ] Invariant cache hit.
[2026-05-25 00:26:41] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-25 00:26:41] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:26:41] [INFO ] Invariant cache hit.
[2026-05-25 00:26:41] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:26:42] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 20668 ms. Remains : 33/33 places, 312/312 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(X(F(p1)))&&p2)))'
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-12ringLLLarge-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-12ringLLLarge-LTLFireability-11 finished in 20911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X((!p1 U (G(!p1)||(!p1&&G(!p2))))))||p0)))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:26:42] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:26:42] [INFO ] Invariant cache hit.
[2026-05-25 00:26:42] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 00:26:42] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:26:42] [INFO ] Invariant cache hit.
[2026-05-25 00:26:42] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:26:42] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 403 ms. Remains : 33/33 places, 312/312 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X((!p1 U (G(!p1)||(!p1&&G(!p2))))))||p0)))))'
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, true, (AND p1 p2), p2]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 88 ms.
Product exploration explored 100000 steps with 0 reset in 94 ms.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (3093 resets) in 179 ms. (222 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (165 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
[2026-05-25 00:26:43] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:26:43] [INFO ] Invariant cache hit.
[2026-05-25 00:26:43] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 100/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 228/332 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 59/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/343 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/344 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/344 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 71/71 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 100/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 228/332 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 59/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/344 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1118 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1235ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 312/312 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 33 transition count 304
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 28 transition count 299
Applied a total of 13 rules in 14 ms. Remains 28 /33 variables (removed 5) and now considering 299/312 (removed 13) transitions.
Running 275 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13353624923943833421.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17301790174594069604.kers'
[2026-05-25 00:26:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13353624923943833421.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17301790174594069604.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 299 rows 28 cols 598 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-25 00:26:44] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17301790174594069604.kers
Total runtime 1 ms.
[2026-05-25 00:26:44] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 299/326 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 1/327 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/327 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 39 constraints, problems are : Problem set: 0 solved, 275 unsolved in 8957 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 299/326 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 275/313 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (OVERLAPS) 1/327 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 314 constraints, problems are : Problem set: 0 solved, 275 unsolved in 20022 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29029ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 29030ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29045 ms. Remains : 28/33 places, 299/312 transitions.
RANDOM walk for 40000 steps (4415 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (344 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1423228 steps, run timeout after 3001 ms. (steps per millisecond=474 ) properties seen :0 out of 1
Probabilistic random walk after 1423228 steps, saw 307746 distinct states, run finished after 3001 ms. (steps per millisecond=474 ) properties seen :0
[2026-05-25 00:27:16] [INFO ] Invariant cache hit.
[2026-05-25 00:27:16] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 100/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 222/326 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/327 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/327 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 39 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 11/11 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 100/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 222/326 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 40 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9097 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9224ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 299/299 transitions.
Applied a total of 0 rules in 4 ms. Remains 28 /28 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 28/28 places, 299/299 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 299/299 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2026-05-25 00:27:26] [INFO ] Invariant cache hit.
[2026-05-25 00:27:26] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 00:27:26] [INFO ] Invariant cache hit.
[2026-05-25 00:27:26] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-25 00:27:26] [INFO ] Implicit Places using invariants and state equation in 538 ms returned [9, 22]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 24 transitions.
Implicit Place search using SMT with State Equation took 577 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/28 places, 275/299 transitions.
Applied a total of 0 rules in 6 ms. Remains 26 /26 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 585 ms. Remains : 26/28 places, 275/299 transitions.
RANDOM walk for 40000 steps (2133 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (259 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1497959 steps, run timeout after 3001 ms. (steps per millisecond=499 ) properties seen :0 out of 1
Probabilistic random walk after 1497959 steps, saw 333651 distinct states, run finished after 3001 ms. (steps per millisecond=499 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4883530289143035200.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-497282105893278305.kers'
[2026-05-25 00:27:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4883530289143035200.kers, --Pflows, --basisKERS=/tmp/petrispot-output-497282105893278305.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 275 rows 26 cols 546 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-25 00:27:29] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-497282105893278305.kers
Total runtime 1 ms.
[2026-05-25 00:27:29] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 197/300 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/301 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/301 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 37 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 11/11 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 197/300 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 38 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15076 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15183ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 275/275 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 26/26 places, 275/275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 275/275 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 275/275 (removed 0) transitions.
[2026-05-25 00:27:44] [INFO ] Invariant cache hit.
[2026-05-25 00:27:44] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-25 00:27:44] [INFO ] Invariant cache hit.
[2026-05-25 00:27:45] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-25 00:27:45] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2026-05-25 00:27:45] [INFO ] Redundant transitions in 4 ms returned []
Running 252 sub problems to find dead transitions.
[2026-05-25 00:27:45] [INFO ] Invariant cache hit.
[2026-05-25 00:27:45] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 275/300 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 1/301 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/301 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 37 constraints, problems are : Problem set: 0 solved, 252 unsolved in 6746 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 275/300 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 252/288 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 289 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30017 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36819ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 36820ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37174 ms. Remains : 26/26 places, 275/275 transitions.
Knowledge based reduction with 5 factoid took 226 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, true, (AND p1 p2), p2]
Knowledge-based reduction took 99321 ms.
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, true, (AND p1 p2), p2]
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Running 282 sub problems to find dead transitions.
[2026-05-25 00:28:23] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17691358162222603619.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6168358772214799107.kers'
[2026-05-25 00:28:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17691358162222603619.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6168358772214799107.kers]
Normalized transition count is 310 out of 311 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 33 cols 614 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-25 00:28:23] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6168358772214799107.kers
Total runtime 1 ms.
[2026-05-25 00:28:23] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 12/343 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
SMT process timed out in 20089ms, After SMT, problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 20090ms
[2026-05-25 00:28:43] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:28:43] [INFO ] Invariant cache hit.
[2026-05-25 00:28:43] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 00:28:43] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:28:43] [INFO ] Invariant cache hit.
[2026-05-25 00:28:43] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:28:43] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 20484 ms. Remains : 33/33 places, 312/312 transitions.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 5 factoid took 103 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (3083 resets) in 155 ms. (256 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (165 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
[2026-05-25 00:28:43] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:28:43] [INFO ] Invariant cache hit.
[2026-05-25 00:28:43] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 100/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 228/332 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 59/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/343 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/344 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/344 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 71/71 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 100/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 228/332 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 59/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/344 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1126 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1233ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 312/312 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 33 transition count 304
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 28 transition count 299
Applied a total of 13 rules in 11 ms. Remains 28 /33 variables (removed 5) and now considering 299/312 (removed 13) transitions.
Running 275 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12716622785574491454.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2615512421713557604.kers'
[2026-05-25 00:28:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12716622785574491454.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2615512421713557604.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 299 rows 28 cols 598 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-25 00:28:44] [INFO ] Computed 0 invariants in 2 ms
Computed 0 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2615512421713557604.kers
Total runtime 3 ms.
[2026-05-25 00:28:44] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 299/326 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 1/327 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/327 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 39 constraints, problems are : Problem set: 0 solved, 275 unsolved in 9244 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 299/326 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 275/313 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (OVERLAPS) 1/327 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 314 constraints, problems are : Problem set: 0 solved, 275 unsolved in 20017 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29317ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 29318ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29330 ms. Remains : 28/33 places, 299/312 transitions.
RANDOM walk for 40000 steps (4462 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (346 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1370150 steps, run timeout after 3001 ms. (steps per millisecond=456 ) properties seen :0 out of 1
Probabilistic random walk after 1370150 steps, saw 296486 distinct states, run finished after 3001 ms. (steps per millisecond=456 ) properties seen :0
[2026-05-25 00:29:17] [INFO ] Invariant cache hit.
[2026-05-25 00:29:17] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 100/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 222/326 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/327 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/327 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 39 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 11/11 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 100/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 222/326 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 40 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9091 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9210ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 299/299 transitions.
Applied a total of 0 rules in 6 ms. Remains 28 /28 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 28/28 places, 299/299 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 299/299 transitions.
Applied a total of 0 rules in 4 ms. Remains 28 /28 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2026-05-25 00:29:26] [INFO ] Invariant cache hit.
[2026-05-25 00:29:26] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 00:29:26] [INFO ] Invariant cache hit.
[2026-05-25 00:29:26] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-25 00:29:27] [INFO ] Implicit Places using invariants and state equation in 537 ms returned [9, 22]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 24 transitions.
Implicit Place search using SMT with State Equation took 574 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/28 places, 275/299 transitions.
Applied a total of 0 rules in 6 ms. Remains 26 /26 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 584 ms. Remains : 26/28 places, 275/299 transitions.
RANDOM walk for 40000 steps (2132 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (263 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1543269 steps, run timeout after 3001 ms. (steps per millisecond=514 ) properties seen :0 out of 1
Probabilistic random walk after 1543269 steps, saw 343641 distinct states, run finished after 3001 ms. (steps per millisecond=514 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1970583094798981234.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17315877414388807918.kers'
[2026-05-25 00:29:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1970583094798981234.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17315877414388807918.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 275 rows 26 cols 546 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-25 00:29:30] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17315877414388807918.kers
Total runtime 2 ms.
[2026-05-25 00:29:30] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 197/300 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/301 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/301 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 37 constraints, problems are : Problem set: 0 solved, 1 unsolved in 84 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 11/11 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 197/300 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 38 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15095 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15191ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 275/275 transitions.
Applied a total of 0 rules in 7 ms. Remains 26 /26 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 26/26 places, 275/275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 275/275 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 275/275 (removed 0) transitions.
[2026-05-25 00:29:45] [INFO ] Invariant cache hit.
[2026-05-25 00:29:45] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 00:29:45] [INFO ] Invariant cache hit.
[2026-05-25 00:29:45] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-25 00:29:45] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2026-05-25 00:29:45] [INFO ] Redundant transitions in 1 ms returned []
Running 252 sub problems to find dead transitions.
[2026-05-25 00:29:45] [INFO ] Invariant cache hit.
[2026-05-25 00:29:45] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 275/300 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 1/301 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/301 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 37 constraints, problems are : Problem set: 0 solved, 252 unsolved in 6936 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 275/300 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 300/301 variables, and 288 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30068 ms.
Refiners :[State Equation: 25/26 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37053ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 37054ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37419 ms. Remains : 26/26 places, 275/275 transitions.
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, true, (AND p1 p2), p2]
Knowledge-based reduction took 99772 ms.
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, true, (AND p1 p2), p2]
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, true, (AND p1 p2), p2]
Product exploration explored 100000 steps with 0 reset in 81 ms.
Product exploration explored 100000 steps with 0 reset in 89 ms.
Spot run failed in 80 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin8723293693846692402
[2026-05-25 00:30:24] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8723293693846692402
Running compilation step : cd /tmp/ltsmin8723293693846692402;'/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 477 ms.
Running link step : cd /tmp/ltsmin8723293693846692402;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8723293693846692402;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased2418516374431065064.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Running 282 sub problems to find dead transitions.
[2026-05-25 00:30:39] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12455795524952140037.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16773990792814039867.kers'
[2026-05-25 00:30:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12455795524952140037.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16773990792814039867.kers]
Normalized transition count is 310 out of 311 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 33 cols 614 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-25 00:30:39] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16773990792814039867.kers
Total runtime 1 ms.
[2026-05-25 00:30:39] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 12/343 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
SMT process timed out in 20065ms, After SMT, problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 20066ms
[2026-05-25 00:30:59] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:30:59] [INFO ] Invariant cache hit.
[2026-05-25 00:30:59] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 00:30:59] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:30:59] [INFO ] Invariant cache hit.
[2026-05-25 00:30:59] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:30:59] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 20463 ms. Remains : 33/33 places, 312/312 transitions.
Built C files in :
/tmp/ltsmin15406933424513962106
[2026-05-25 00:30:59] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15406933424513962106
Running compilation step : cd /tmp/ltsmin15406933424513962106;'/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 467 ms.
Running link step : cd /tmp/ltsmin15406933424513962106;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin15406933424513962106;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased17128591911262540718.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 00:31:14] [INFO ] Flatten gal took : 9 ms
[2026-05-25 00:31:14] [INFO ] Flatten gal took : 8 ms
[2026-05-25 00:31:14] [INFO ] Time to serialize gal into /tmp/LTL9845753828996872743.gal : 2 ms
[2026-05-25 00:31:14] [INFO ] Time to serialize properties into /tmp/LTL8682509727088946784.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9845753828996872743.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4840072671444276578.hoa' '-atoms' '/tmp/LTL8682509727088946784.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8682509727088946784.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4840072671444276578.hoa
Detected timeout of ITS tools.
[2026-05-25 00:31:29] [INFO ] Flatten gal took : 23 ms
[2026-05-25 00:31:29] [INFO ] Flatten gal took : 15 ms
[2026-05-25 00:31:29] [INFO ] Time to serialize gal into /tmp/LTL101100266343454631.gal : 6 ms
[2026-05-25 00:31:29] [INFO ] Time to serialize properties into /tmp/LTL1995463666442555754.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL101100266343454631.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1995463666442555754.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((A3<1)||(A5<2))")||(X(X((!("((A4>=2)&&(A25>=1))"))U((G(!("((A4>=2)&&(A25>=1))")))||((!("((A4>=2)&&(A25>=1))"))&&(G(!("((A1...184
Formula 0 simplified : XXF(!"((A3<1)||(A5<2))" & XX(F"((A1>=2)&&(A27>=1))" U "((A4>=2)&&(A25>=1))"))
Detected timeout of ITS tools.
[2026-05-25 00:31:44] [INFO ] Flatten gal took : 8 ms
[2026-05-25 00:31:44] [INFO ] Applying decomposition
[2026-05-25 00:31:44] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7599795786502323275.txt' '-o' '/tmp/graph7599795786502323275.bin' '-w' '/tmp/graph7599795786502323275.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7599795786502323275.bin' '-l' '-1' '-v' '-w' '/tmp/graph7599795786502323275.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:31:44] [INFO ] Decomposing Gal with order
[2026-05-25 00:31:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:31:44] [INFO ] Removed a total of 544 redundant transitions.
[2026-05-25 00:31:44] [INFO ] Flatten gal took : 15 ms
[2026-05-25 00:31:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 00:31:44] [INFO ] Time to serialize gal into /tmp/LTL7557472694228110800.gal : 2 ms
[2026-05-25 00:31:44] [INFO ] Time to serialize properties into /tmp/LTL3920880574292048626.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7557472694228110800.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3920880574292048626.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((u2.A3<1)||(u4.A5<2))")||(X(X((!("((u3.A4>=2)&&(u24.A25>=1))"))U((G(!("((u3.A4>=2)&&(u24.A25>=1))")))||((!("((u3.A4>=2)&&(...218
Formula 0 simplified : XXF(!"((u2.A3<1)||(u4.A5<2))" & XX(F"((u0.A1>=2)&&(u26.A27>=1))" U "((u3.A4>=2)&&(u24.A25>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30...1825
Detected timeout of ITS tools.
Treatment of property DNAwalker-PT-12ringLLLarge-LTLFireability-12 finished in 317582 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 U (!p1||G(p0))))))'
Spot run failed in 40 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X((!p1 U (G(!p1)||(!p1&&G(!p2))))))||p0)))))'
Spot run failed in 38 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 00:32:00] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10696605423881918295
[2026-05-25 00:32:00] [INFO ] Applying decomposition
[2026-05-25 00:32:00] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2026-05-25 00:32:00] [INFO ] Flatten gal took : 6 ms
[2026-05-25 00:32:00] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:32:00] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2026-05-25 00:32:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12516065489025472977.txt' '-o' '/tmp/graph12516065489025472977.bin' '-w' '/tmp/graph12516065489025472977.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12516065489025472977.bin' '-l' '-1' '-v' '-w' '/tmp/graph12516065489025472977.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:32:00] [INFO ] Decomposing Gal with order
[2026-05-25 00:32:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:32:00] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2026-05-25 00:32:00] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:32:00] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10696605423881918295
Running compilation step : cd /tmp/ltsmin10696605423881918295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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'
[2026-05-25 00:32:00] [INFO ] Removed a total of 544 redundant transitions.
[2026-05-25 00:32:00] [INFO ] Flatten gal took : 13 ms
[2026-05-25 00:32:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2026-05-25 00:32:00] [INFO ] Time to serialize gal into /tmp/LTLFireability11517488553449133776.gal : 1 ms
[2026-05-25 00:32:00] [INFO ] Time to serialize properties into /tmp/LTLFireability4542665393283402870.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11517488553449133776.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4542665393283402870.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(F(("((u25.A26>=2)&&(u26.A27>=1))")U((!("(((u9.A10>=1)&&(u11.A12>=2))||((u1.A2>=2)&&(u25.A26>=1)))"))||(G("((u25.A26>=2)&&(u26.A27...168
Formula 0 simplified : FG(!"((u25.A26>=2)&&(u26.A27>=1))" M "(((u9.A10>=1)&&(u11.A12>=2))||((u1.A2>=2)&&(u25.A26>=1)))")
Compilation finished in 644 ms.
Running link step : cd /tmp/ltsmin10696605423881918295;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10696605423881918295;'/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' '--ltl' '[](<>(((LTLAPp0==true) U (!(LTLAPp1==true)||[]((LTLAPp0==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30...1825
61 unique states visited
0 strongly connected components in search stack
62 transitions explored
32 items max in DFS search stack
5015 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,50.1666,1604264,1,0,3.1272e+06,203,2304,5.22354e+06,59,213,8933241
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DNAwalker-PT-12ringLLLarge-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(G(("((u2.A3<1)||(u4.A5<2))")||(X(X((!("((u3.A4>=2)&&(u24.A25>=1))"))U((G(!("((u3.A4>=2)&&(u24.A25>=1))")))||((!("((u3.A4>=2)&&(...218
Formula 1 simplified : XXF(!"((u2.A3<1)||(u4.A5<2))" & XX(F"((u0.A1>=2)&&(u26.A27>=1))" U "((u3.A4>=2)&&(u24.A25>=1))"))
42 unique states visited
32 strongly connected components in search stack
45 transitions explored
33 items max in DFS search stack
760 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,57.7707,1814648,1,0,3.53733e+06,203,2652,5.89661e+06,61,220,10126442
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DNAwalker-PT-12ringLLLarge-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1258750 ms.
BK_STOP 1779669191043
--------------------
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="DNAwalker-PT-12ringLLLarge"
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 DNAwalker-PT-12ringLLLarge, 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 r098-tall-177955695800820"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-12ringLLLarge.tgz
mv DNAwalker-PT-12ringLLLarge 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 '
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 ;