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.r130-smll-177955809000300.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 FireWire-PT-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.5K Mar 7 05:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 7 05:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 7 05:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 05:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 05:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Mar 7 05:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 05:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 05:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 247K 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 FireWire-PT-20-LTLFireability-00
FORMULA_NAME FireWire-PT-20-LTLFireability-01
FORMULA_NAME FireWire-PT-20-LTLFireability-02
FORMULA_NAME FireWire-PT-20-LTLFireability-03
FORMULA_NAME FireWire-PT-20-LTLFireability-04
FORMULA_NAME FireWire-PT-20-LTLFireability-05
FORMULA_NAME FireWire-PT-20-LTLFireability-06
FORMULA_NAME FireWire-PT-20-LTLFireability-07
FORMULA_NAME FireWire-PT-20-LTLFireability-08
FORMULA_NAME FireWire-PT-20-LTLFireability-09
FORMULA_NAME FireWire-PT-20-LTLFireability-10
FORMULA_NAME FireWire-PT-20-LTLFireability-11
FORMULA_NAME FireWire-PT-20-LTLFireability-12
FORMULA_NAME FireWire-PT-20-LTLFireability-13
FORMULA_NAME FireWire-PT-20-LTLFireability-14
FORMULA_NAME FireWire-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779860951293

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 05:49:13] [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-27 05:49:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 05:49:14] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2026-05-27 05:49:14] [INFO ] Transformed 626 places.
[2026-05-27 05:49:14] [INFO ] Transformed 1031 transitions.
[2026-05-27 05:49:14] [INFO ] Found NUPN structural information;
[2026-05-27 05:49:14] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 514 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA FireWire-PT-20-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-20-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-20-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-20-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1031/1031 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 611 transition count 1031
Discarding 134 places :
Symmetric choice reduction at 1 with 134 rule applications. Total rules 149 place count 477 transition count 897
Iterating global reduction 1 with 134 rules applied. Total rules applied 283 place count 477 transition count 897
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 284 place count 477 transition count 896
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 316 place count 445 transition count 851
Iterating global reduction 2 with 32 rules applied. Total rules applied 348 place count 445 transition count 851
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 357 place count 436 transition count 838
Iterating global reduction 2 with 9 rules applied. Total rules applied 366 place count 436 transition count 838
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 368 place count 436 transition count 836
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 369 place count 435 transition count 833
Iterating global reduction 3 with 1 rules applied. Total rules applied 370 place count 435 transition count 833
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 371 place count 434 transition count 831
Iterating global reduction 3 with 1 rules applied. Total rules applied 372 place count 434 transition count 831
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 373 place count 433 transition count 828
Iterating global reduction 3 with 1 rules applied. Total rules applied 374 place count 433 transition count 828
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 375 place count 432 transition count 826
Iterating global reduction 3 with 1 rules applied. Total rules applied 376 place count 432 transition count 826
Applied a total of 376 rules in 337 ms. Remains 432 /626 variables (removed 194) and now considering 826/1031 (removed 205) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2830894839790537197.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9762230091358209265.kers'
[2026-05-27 05:49:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2830894839790537197.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9762230091358209265.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 826 rows 432 cols 2672 entries
Finished phase 1 with 422 SingleSign rule and 0 generalized
[2026-05-27 05:49:15] [INFO ] Computed 10 invariants in 6 ms
Computed 10 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-9762230091358209265.kers
Total runtime 9 ms.
[2026-05-27 05:49:16] [INFO ] Implicit Places using invariants in 927 ms returned []
[2026-05-27 05:49:16] [INFO ] Invariant cache hit.
[2026-05-27 05:49:17] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 2373 ms to find 0 implicit places.
Running 825 sub problems to find dead transitions.
[2026-05-27 05:49:17] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 825 unsolved
SMT process timed out in 30955ms, After SMT, problems are : Problem set: 0 solved, 825 unsolved
Search for dead transitions found 0 dead transitions in 30999ms
Starting structural reductions in LTL mode, iteration 1 : 432/626 places, 826/1031 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33846 ms. Remains : 432/626 places, 826/1031 transitions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 826/826 transitions.
Applied a total of 0 rules in 14 ms. Remains 432 /432 variables (removed 0) and now considering 826/826 (removed 0) transitions.
[2026-05-27 05:49:48] [INFO ] Invariant cache hit.
[2026-05-27 05:49:49] [INFO ] Implicit Places using invariants in 530 ms returned []
[2026-05-27 05:49:49] [INFO ] Invariant cache hit.
[2026-05-27 05:49:50] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1464 ms. Remains : 432/432 places, 826/826 transitions.
Support contains 48 out of 432 places after structural reductions.
[2026-05-27 05:49:50] [INFO ] Flatten gal took : 199 ms
[2026-05-27 05:49:51] [INFO ] Flatten gal took : 133 ms
[2026-05-27 05:49:51] [INFO ] Input system was already deterministic with 826 transitions.
RANDOM walk for 40000 steps (36 resets) in 1658 ms. (24 steps per ms) remains 26/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
[2026-05-27 05:49:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 320/361 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 36/397 variables, 4/13 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 4/17 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 791/1188 variables, 397/414 constraints. Problems are: Problem set: 3 solved, 23 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1188/1258 variables, and 414 constraints, problems are : Problem set: 3 solved, 23 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 397/432 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 326/361 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 4/10 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 36/397 variables, 4/14 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 3/17 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 3/20 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/20 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 791/1188 variables, 397/417 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1188 variables, 22/439 constraints. Problems are: Problem set: 3 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1188/1258 variables, and 440 constraints, problems are : Problem set: 3 solved, 23 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 397/432 constraints, PredecessorRefiner: 22/26 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10058ms problems are : Problem set: 3 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 826/826 transitions.
Graph (trivial) has 263 edges and 432 vertex of which 9 / 432 are part of one of the 3 SCC in 14 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 426 transition count 767
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 53 rules applied. Total rules applied 101 place count 379 transition count 761
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 105 place count 376 transition count 760
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 375 transition count 760
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 106 place count 375 transition count 727
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 172 place count 342 transition count 727
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 176 place count 338 transition count 719
Iterating global reduction 4 with 4 rules applied. Total rules applied 180 place count 338 transition count 719
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 180 place count 338 transition count 718
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 182 place count 337 transition count 718
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 183 place count 336 transition count 716
Iterating global reduction 4 with 1 rules applied. Total rules applied 184 place count 336 transition count 716
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 185 place count 335 transition count 713
Iterating global reduction 4 with 1 rules applied. Total rules applied 186 place count 335 transition count 713
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 4 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 264 place count 296 transition count 674
Performed 40 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 344 place count 256 transition count 900
Free-agglomeration rule applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 364 place count 256 transition count 880
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 384 place count 236 transition count 880
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 389 place count 231 transition count 875
Iterating global reduction 5 with 5 rules applied. Total rules applied 394 place count 231 transition count 875
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 406 place count 231 transition count 863
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 408 place count 231 transition count 861
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 410 place count 231 transition count 861
Applied a total of 410 rules in 461 ms. Remains 231 /432 variables (removed 201) and now considering 861/826 (removed -35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 463 ms. Remains : 231/432 places, 861/826 transitions.
RANDOM walk for 40000 steps (1354 resets) in 670 ms. (59 steps per ms) remains 13/23 properties
BEST_FIRST walk for 40003 steps (287 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (278 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (273 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (266 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (279 resets) in 117 ms. (338 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (277 resets) in 137 ms. (289 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (280 resets) in 100 ms. (396 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (270 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (284 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (267 resets) in 142 ms. (279 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (161 resets) in 159 ms. (250 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (293 resets) in 141 ms. (281 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (290 resets) in 114 ms. (347 steps per ms) remains 12/12 properties
[2026-05-27 05:50:03] [INFO ] Flow matrix only has 825 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16602431008176975661.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4590843000978301172.kers'
[2026-05-27 05:50:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16602431008176975661.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4590843000978301172.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 825 rows 231 cols 3160 entries
Finished phase 1 with 221 SingleSign rule and 0 generalized
[2026-05-27 05:50:03] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4590843000978301172.kers
Total runtime 4 ms.
[2026-05-27 05:50:03] [INFO ] State equation strengthened by 54 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 187/205 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 14/219 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 825/1044 variables, 219/233 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1044 variables, 54/287 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1044 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 12/1056 variables, 12/299 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1056 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/1056 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1056/1056 variables, and 299 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2652 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 231/231 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 187/205 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 14/219 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 825/1044 variables, 219/236 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1044 variables, 54/290 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1044 variables, 11/301 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1044 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1044 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1044 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 12/1056 variables, 12/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1056 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1056 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 0/1056 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1056/1056 variables, and 318 constraints, problems are : Problem set: 0 solved, 12 unsolved in 18813 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 231/231 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21496ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 20033 ms.
Support contains 18 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 861/861 transitions.
Graph (trivial) has 38 edges and 231 vertex of which 2 / 231 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 230 transition count 855
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 226 transition count 855
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 226 transition count 852
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 223 transition count 852
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 220 transition count 699
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 220 transition count 699
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 220 transition count 697
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 219 transition count 695
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 219 transition count 695
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 218 transition count 692
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 218 transition count 692
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 217 transition count 690
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 217 transition count 690
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 216 transition count 687
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 216 transition count 687
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 215 transition count 685
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 215 transition count 685
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 41 place count 211 transition count 681
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 47 place count 208 transition count 696
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 53 place count 208 transition count 690
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 56 place count 208 transition count 687
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 77 place count 205 transition count 669
Drop transitions (Redundant composition of simpler transitions.) removed 103 transitions
Redundant transition composition rules discarded 103 transitions
Iterating global reduction 4 with 103 rules applied. Total rules applied 180 place count 205 transition count 566
Applied a total of 180 rules in 123 ms. Remains 205 /231 variables (removed 26) and now considering 566/861 (removed 295) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 205/231 places, 566/861 transitions.
RANDOM walk for 40000 steps (1372 resets) in 386 ms. (103 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40003 steps (269 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (265 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (23 resets) in 218 ms. (182 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (279 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (265 resets) in 69 ms. (571 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (244 resets) in 63 ms. (625 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (277 resets) in 68 ms. (579 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (270 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
[2026-05-27 05:50:45] [INFO ] Flow matrix only has 510 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12764232568060100014.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6677669249482433520.kers'
[2026-05-27 05:50:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12764232568060100014.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6677669249482433520.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 510 rows 205 cols 1854 entries
Finished phase 1 with 195 SingleSign rule and 0 generalized
[2026-05-27 05:50:45] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6677669249482433520.kers
Total runtime 3 ms.
[2026-05-27 05:50:45] [INFO ] State equation strengthened by 104 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 163/175 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 18/193 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 510/703 variables, 193/208 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 104/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/703 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 12/715 variables, 12/324 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/715 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/715 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 715/715 variables, and 324 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1809 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 205/205 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 163/175 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 18/193 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 510/703 variables, 193/210 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 104/314 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/703 variables, 7/321 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/703 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 12/715 variables, 12/333 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/715 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/715 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/715 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 715/715 variables, and 334 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 205/205 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6858ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 6162 ms.
Support contains 12 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 566/566 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 205 transition count 565
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 204 transition count 565
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 204 transition count 564
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 203 transition count 564
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 202 transition count 562
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 202 transition count 562
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 201 transition count 559
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 201 transition count 559
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 12 place count 201 transition count 555
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 200 transition count 554
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 200 transition count 552
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 18 place count 198 transition count 552
Applied a total of 18 rules in 52 ms. Remains 198 /205 variables (removed 7) and now considering 552/566 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 198/205 places, 552/566 transitions.
RANDOM walk for 40000 steps (1377 resets) in 231 ms. (172 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (265 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (251 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (18 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (262 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (272 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (236 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (263 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (269 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 340965 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :4 out of 8
Probabilistic random walk after 340965 steps, saw 103657 distinct states, run finished after 3010 ms. (steps per millisecond=113 ) properties seen :4
[2026-05-27 05:51:01] [INFO ] Flow matrix only has 497 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14152886009059461461.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3359101226813817315.kers'
[2026-05-27 05:51:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14152886009059461461.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3359101226813817315.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 497 rows 198 cols 1816 entries
Finished phase 1 with 188 SingleSign rule and 0 generalized
[2026-05-27 05:51:01] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3359101226813817315.kers
Total runtime 3 ms.
[2026-05-27 05:51:01] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 112/118 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 67/185 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 496/681 variables, 185/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/681 variables, 102/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/681 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 14/695 variables, 13/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/695 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/695 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 695/695 variables, and 313 constraints, problems are : Problem set: 0 solved, 4 unsolved in 929 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 112/118 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 67/185 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 496/681 variables, 185/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/681 variables, 102/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/681 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 14/695 variables, 13/320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/695 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/695 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 695/695 variables, and 320 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2646 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3595ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 1421 ms.
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 552/552 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 198 transition count 550
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 196 transition count 550
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 195 transition count 548
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 195 transition count 548
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 194 transition count 546
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 194 transition count 546
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 193 transition count 545
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 192 transition count 545
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 192 transition count 544
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 191 transition count 544
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 191 transition count 544
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 191 transition count 543
Applied a total of 17 rules in 49 ms. Remains 191 /198 variables (removed 7) and now considering 543/552 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 191/198 places, 543/552 transitions.
RANDOM walk for 40000 steps (1395 resets) in 170 ms. (233 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (271 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (268 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (261 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 408942 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 3
Probabilistic random walk after 408942 steps, saw 132038 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
[2026-05-27 05:51:10] [INFO ] Flow matrix only has 488 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1926438804046675696.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4312360542308048922.kers'
[2026-05-27 05:51:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1926438804046675696.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4312360542308048922.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 488 rows 191 cols 1796 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-05-27 05:51:10] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4312360542308048922.kers
Total runtime 2 ms.
[2026-05-27 05:51:10] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 112/117 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 62/179 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 488/667 variables, 179/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 102/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/667 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 12/679 variables, 12/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/679 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/679 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 679/679 variables, and 306 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1082 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 191/191 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 112/117 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 62/179 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 488/667 variables, 179/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/667 variables, 102/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/667 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 12/679 variables, 12/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/679 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/679 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 679/679 variables, and 311 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2506 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 191/191 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3604ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 600 ms.
Support contains 4 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 543/543 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 190 transition count 542
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 189 transition count 541
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 189 transition count 541
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 189 transition count 540
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 188 transition count 535
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 188 transition count 535
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 187 transition count 533
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 187 transition count 533
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 186 transition count 530
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 186 transition count 530
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 185 transition count 528
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 185 transition count 528
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 184 transition count 525
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 184 transition count 525
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 183 transition count 523
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 183 transition count 523
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 182 transition count 520
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 182 transition count 520
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 181 transition count 518
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 181 transition count 518
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 180 transition count 515
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 180 transition count 515
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 179 transition count 513
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 179 transition count 513
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 26 place count 178 transition count 511
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 178 transition count 511
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 177 transition count 509
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 177 transition count 509
Applied a total of 29 rules in 80 ms. Remains 177 /191 variables (removed 14) and now considering 509/543 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 177/191 places, 509/543 transitions.
RANDOM walk for 40000 steps (1393 resets) in 223 ms. (178 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (267 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (282 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 481318 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 2
Probabilistic random walk after 481318 steps, saw 152549 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
[2026-05-27 05:51:17] [INFO ] Flow matrix only has 454 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12989315482582001272.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1560766814272028440.kers'
[2026-05-27 05:51:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12989315482582001272.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1560766814272028440.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 454 rows 177 cols 1674 entries
Finished phase 1 with 167 SingleSign rule and 0 generalized
[2026-05-27 05:51:17] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1560766814272028440.kers
Total runtime 2 ms.
[2026-05-27 05:51:17] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
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) 60/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 101/165 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 454/619 variables, 165/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/619 variables, 96/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/619 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/631 variables, 12/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/631 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 631/631 variables, and 286 constraints, problems are : Problem set: 0 solved, 2 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 60/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 101/165 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 454/619 variables, 165/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/619 variables, 96/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/619 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/619 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 12/631 variables, 12/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/631 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/631 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 631/631 variables, and 288 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1071 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1807ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 230 ms.
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 509/509 transitions.
Applied a total of 0 rules in 12 ms. Remains 177 /177 variables (removed 0) and now considering 509/509 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 177/177 places, 509/509 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 509/509 transitions.
Applied a total of 0 rules in 11 ms. Remains 177 /177 variables (removed 0) and now considering 509/509 (removed 0) transitions.
[2026-05-27 05:51:19] [INFO ] Flow matrix only has 454 transitions (discarded 55 similar events)
[2026-05-27 05:51:19] [INFO ] Invariant cache hit.
[2026-05-27 05:51:19] [INFO ] Implicit Places using invariants in 314 ms returned []
[2026-05-27 05:51:19] [INFO ] Flow matrix only has 454 transitions (discarded 55 similar events)
[2026-05-27 05:51:19] [INFO ] Invariant cache hit.
[2026-05-27 05:51:20] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-27 05:51:20] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1325 ms to find 0 implicit places.
[2026-05-27 05:51:20] [INFO ] Redundant transitions in 46 ms returned []
Running 501 sub problems to find dead transitions.
[2026-05-27 05:51:20] [INFO ] Flow matrix only has 454 transitions (discarded 55 similar events)
[2026-05-27 05:51:20] [INFO ] Invariant cache hit.
[2026-05-27 05:51:20] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (OVERLAPS) 454/631 variables, 177/199 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/631 variables, 96/295 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 631/631 variables, and 295 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (OVERLAPS) 454/631 variables, 177/200 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 96/296 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 501/797 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 631/631 variables, and 797 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60385ms problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 60388ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61779 ms. Remains : 177/177 places, 509/509 transitions.
FORMULA FireWire-PT-20-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA FireWire-PT-20-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 124 stabilizing places and 194 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(G(!p0)) U !p1)))'
Support contains 5 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 826/826 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 416 transition count 743
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 416 transition count 743
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 416 transition count 742
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 411 transition count 734
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 411 transition count 734
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 411 transition count 733
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 408 transition count 725
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 408 transition count 725
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 405 transition count 718
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 405 transition count 718
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 402 transition count 710
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 402 transition count 710
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 399 transition count 703
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 399 transition count 703
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 71 place count 396 transition count 696
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 396 transition count 696
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 393 transition count 689
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 393 transition count 689
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 390 transition count 683
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 390 transition count 683
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 388 transition count 678
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 388 transition count 678
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 386 transition count 674
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 386 transition count 674
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 384 transition count 669
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 384 transition count 669
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 382 transition count 666
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 382 transition count 666
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 381 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 381 transition count 664
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 380 transition count 662
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 380 transition count 662
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 379 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 379 transition count 661
Applied a total of 108 rules in 152 ms. Remains 379 /432 variables (removed 53) and now considering 661/826 (removed 165) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9473660064484117139.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6522785127733072485.kers'
[2026-05-27 05:52:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9473660064484117139.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6522785127733072485.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 661 rows 379 cols 2054 entries
Finished phase 1 with 369 SingleSign rule and 0 generalized
[2026-05-27 05:52:22] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6522785127733072485.kers
Total runtime 6 ms.
[2026-05-27 05:52:22] [INFO ] Implicit Places using invariants in 478 ms returned []
[2026-05-27 05:52:22] [INFO ] Invariant cache hit.
[2026-05-27 05:52:23] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 1479 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2026-05-27 05:52:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 379/1040 variables, and 21 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/379 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/1040 variables, and 27 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/379 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60276ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Starting structural reductions in LTL mode, iteration 1 : 379/432 places, 661/826 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61915 ms. Remains : 379/432 places, 661/826 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(G(!p0)) U !p1)))'
Stuttering acceptance computed with spot in 436 ms :[p1, p1, p0]
Running random walk in product with property : FireWire-PT-20-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 504 ms.
Product exploration explored 100000 steps with 1 reset in 279 ms.
Computed a total of 84 stabilizing places and 108 stable transitions
Computed a total of 84 stabilizing places and 108 stable transitions
Knowledge based reduction with 4 factoid took 58 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (17 resets) in 220 ms. (180 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (28 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (17 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (23 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 613277 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 3
Probabilistic random walk after 613277 steps, saw 101409 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
[2026-05-27 05:53:28] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 199/204 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 139/343 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 625/968 variables, 343/353 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/968 variables, 0/353 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 36/1004 variables, 18/371 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1004 variables, 0/371 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 24/1028 variables, 9/380 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1028 variables, 0/380 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/1040 variables, 9/389 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1040 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1040 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1040/1040 variables, and 389 constraints, problems are : Problem set: 1 solved, 2 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 199/204 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 139/343 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 625/968 variables, 343/353 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/968 variables, 2/355 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/968 variables, 0/355 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 36/1004 variables, 18/373 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1004 variables, 0/373 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 24/1028 variables, 9/382 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1028 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 12/1040 variables, 9/391 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1040 variables, 0/391 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1040 variables, 0/391 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1040/1040 variables, and 391 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1550 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2034ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 597 ms.
Support contains 5 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 661/661 transitions.
Graph (trivial) has 274 edges and 379 vertex of which 9 / 379 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 373 transition count 597
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 58 rules applied. Total rules applied 111 place count 321 transition count 591
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 115 place count 318 transition count 590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 317 transition count 590
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 116 place count 317 transition count 551
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 194 place count 278 transition count 551
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 260 place count 245 transition count 518
Performed 46 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 352 place count 199 transition count 672
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 356 place count 199 transition count 668
Free-agglomeration rule applied 19 times.
Iterating global reduction 4 with 19 rules applied. Total rules applied 375 place count 199 transition count 649
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 402 place count 180 transition count 641
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 408 place count 174 transition count 635
Iterating global reduction 5 with 6 rules applied. Total rules applied 414 place count 174 transition count 635
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 426 place count 174 transition count 623
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 443 place count 174 transition count 606
Applied a total of 443 rules in 74 ms. Remains 174 /379 variables (removed 205) and now considering 606/661 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 174/379 places, 606/661 transitions.
RANDOM walk for 40000 steps (1788 resets) in 158 ms. (251 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (340 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
[2026-05-27 05:53:31] [INFO ] Flow matrix only has 585 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16655246556397585697.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7810930794574329614.kers'
[2026-05-27 05:53:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16655246556397585697.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7810930794574329614.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 585 rows 174 cols 2181 entries
Finished phase 1 with 164 SingleSign rule and 0 generalized
[2026-05-27 05:53:31] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7810930794574329614.kers
Total runtime 3 ms.
[2026-05-27 05:53:31] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 102/162 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 585/747 variables, 162/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 96/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/747 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/759 variables, 12/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/759 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/759 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 759/759 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 96/96 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 102/162 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 585/747 variables, 162/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 96/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/747 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/747 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/759 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/759 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/759 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 759/759 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 920ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 606/606 transitions.
Graph (trivial) has 20 edges and 174 vertex of which 2 / 174 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 172 transition count 609
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 11 place count 172 transition count 601
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 172 transition count 599
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 15 place count 170 transition count 599
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 23 place count 170 transition count 591
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 170 transition count 598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 169 transition count 598
Applied a total of 25 rules in 84 ms. Remains 169 /174 variables (removed 5) and now considering 598/606 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 169/174 places, 598/606 transitions.
RANDOM walk for 40000 steps (1328 resets) in 253 ms. (157 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (107 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 123109 steps, run visited all 1 properties in 795 ms. (steps per millisecond=154 )
Probabilistic random walk after 123109 steps, saw 37414 distinct states, run finished after 800 ms. (steps per millisecond=153 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR p0 p1), p1, p0, false, false]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9682740657249114139.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14189605412521448573.kers'
[2026-05-27 05:53:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9682740657249114139.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14189605412521448573.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 661 rows 379 cols 2054 entries
Finished phase 1 with 369 SingleSign rule and 0 generalized
[2026-05-27 05:53:33] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14189605412521448573.kers
Total runtime 3 ms.
[2026-05-27 05:53:33] [INFO ] [Real]Absence check using 10 positive place invariants in 78 ms returned sat
[2026-05-27 05:53:36] [INFO ] [Real]Absence check using state equation in 2799 ms returned sat
[2026-05-27 05:53:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:53:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 21 ms returned sat
[2026-05-27 05:53:38] [INFO ] [Nat]Absence check using state equation in 1406 ms returned sat
[2026-05-27 05:53:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 419 ms
[2026-05-27 05:53:39] [INFO ] Computed and/alt/rep : 551/1305/551 causal constraints (skipped 109 transitions) in 83 ms.
[2026-05-27 05:53:49] [INFO ] Added : 472 causal constraints over 96 iterations in 10276 ms. Result :sat
Could not prove EG p1
Knowledge-based reduction took 24464 ms.
Stuttering acceptance computed with spot in 258 ms :[(OR p0 p1), p1, p0, false, false]
Support contains 5 out of 379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 379/379 places, 661/661 transitions.
Graph (trivial) has 274 edges and 379 vertex of which 9 / 379 are part of one of the 3 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 372 transition count 602
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 58 rules applied. Total rules applied 111 place count 320 transition count 596
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 115 place count 317 transition count 595
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 316 transition count 595
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 116 place count 316 transition count 556
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 194 place count 277 transition count 556
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 258 place count 245 transition count 524
Performed 45 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 348 place count 200 transition count 678
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 352 place count 200 transition count 674
Applied a total of 352 rules in 116 ms. Remains 200 /379 variables (removed 179) and now considering 674/661 (removed -13) transitions.
[2026-05-27 05:53:49] [INFO ] Flow matrix only has 644 transitions (discarded 30 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11139465525842877477.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17223272886523900619.kers'
[2026-05-27 05:53:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11139465525842877477.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17223272886523900619.kers]
Normalized transition count is 643 out of 644 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 643 rows 200 cols 2530 entries
Finished phase 1 with 190 SingleSign rule and 0 generalized
[2026-05-27 05:53:49] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17223272886523900619.kers
Total runtime 7 ms.
[2026-05-27 05:53:50] [INFO ] Implicit Places using invariants in 317 ms returned []
[2026-05-27 05:53:50] [INFO ] Flow matrix only has 644 transitions (discarded 30 similar events)
[2026-05-27 05:53:50] [INFO ] Invariant cache hit.
[2026-05-27 05:53:50] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-27 05:53:51] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
[2026-05-27 05:53:51] [INFO ] Redundant transitions in 23 ms returned []
Running 665 sub problems to find dead transitions.
[2026-05-27 05:53:51] [INFO ] Flow matrix only has 644 transitions (discarded 30 similar events)
[2026-05-27 05:53:51] [INFO ] Invariant cache hit.
[2026-05-27 05:53:51] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (OVERLAPS) 1/200 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 200/844 variables, and 17 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/200 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 665/665 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 665 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 6 (OVERLAPS) 643/843 variables, 200/217 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/843 variables, 13/230 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/843 variables, 665/895 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 843/844 variables, and 895 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 665/665 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60798ms problems are : Problem set: 0 solved, 665 unsolved
Search for dead transitions found 0 dead transitions in 60801ms
Starting structural reductions in SI_LTL mode, iteration 1 : 200/379 places, 674/661 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62115 ms. Remains : 200/379 places, 674/661 transitions.
Computed a total of 31 stabilizing places and 56 stable transitions
Computed a total of 31 stabilizing places and 56 stable transitions
Knowledge based reduction with 11 factoid took 57 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (1484 resets) in 314 ms. (126 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (258 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (253 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
[2026-05-27 05:54:52] [INFO ] Flow matrix only has 644 transitions (discarded 30 similar events)
[2026-05-27 05:54:52] [INFO ] Invariant cache hit.
[2026-05-27 05:54:52] [INFO ] State equation strengthened by 13 read => feed constraints.
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 111/116 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/188 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 643/831 variables, 188/198 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/831 variables, 13/211 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/831 variables, 0/211 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/843 variables, 12/223 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/843 variables, 0/223 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/843 variables, 0/223 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 843/844 variables, and 223 constraints, problems are : Problem set: 1 solved, 1 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/70 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 118/188 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 643/831 variables, 188/198 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/831 variables, 13/211 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/831 variables, 1/212 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/831 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/843 variables, 12/224 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/843 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/843 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 843/844 variables, and 224 constraints, problems are : Problem set: 1 solved, 1 unsolved in 754 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1118ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 135 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=67 )
Parikh walk visited 1 properties in 9 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 12 factoid took 146 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 269 ms :[(OR p0 p1), p1, p0, false, false]
[2026-05-27 05:54:53] [INFO ] Flow matrix only has 644 transitions (discarded 30 similar events)
[2026-05-27 05:54:53] [INFO ] Invariant cache hit.
[2026-05-27 05:54:54] [INFO ] [Real]Absence check using 10 positive place invariants in 28 ms returned sat
[2026-05-27 05:54:55] [INFO ] [Real]Absence check using state equation in 1090 ms returned sat
[2026-05-27 05:54:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:54:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2026-05-27 05:54:56] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2026-05-27 05:54:56] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-27 05:54:56] [INFO ] [Nat]Added 13 Read/Feed constraints in 52 ms returned sat
[2026-05-27 05:54:56] [INFO ] Computed and/alt/rep : 392/1762/392 causal constraints (skipped 243 transitions) in 119 ms.
[2026-05-27 05:54:59] [INFO ] Added : 172 causal constraints over 35 iterations in 2680 ms. Result :sat
Could not prove EG p1
Knowledge-based reduction took 7449 ms.
Stuttering acceptance computed with spot in 268 ms :[(OR p0 p1), p1, p0, false, false]
Stuttering acceptance computed with spot in 261 ms :[(OR p0 p1), p1, p0, false, false]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-00 finished in 158135 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&&G(p1)&&F(p2)))))'
Support contains 4 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 826/826 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 415 transition count 713
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 415 transition count 713
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 415 transition count 712
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 410 transition count 704
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 410 transition count 704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 410 transition count 703
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 407 transition count 695
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 407 transition count 695
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 404 transition count 688
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 404 transition count 688
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 401 transition count 680
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 401 transition count 680
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 398 transition count 673
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 398 transition count 673
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 395 transition count 666
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 395 transition count 666
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 392 transition count 659
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 392 transition count 659
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 389 transition count 653
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 389 transition count 653
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 387 transition count 648
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 387 transition count 648
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 385 transition count 644
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 385 transition count 644
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 383 transition count 639
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 383 transition count 639
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 381 transition count 636
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 381 transition count 636
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 380 transition count 634
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 380 transition count 634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 379 transition count 632
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 379 transition count 632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 378 transition count 631
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 378 transition count 631
Applied a total of 110 rules in 153 ms. Remains 378 /432 variables (removed 54) and now considering 631/826 (removed 195) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17180503217186549241.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5174937165210353965.kers'
[2026-05-27 05:55:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17180503217186549241.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5174937165210353965.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 631 rows 378 cols 1934 entries
Finished phase 1 with 368 SingleSign rule and 0 generalized
[2026-05-27 05:55:00] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5174937165210353965.kers
Total runtime 6 ms.
[2026-05-27 05:55:00] [INFO ] Implicit Places using invariants in 447 ms returned []
[2026-05-27 05:55:00] [INFO ] Invariant cache hit.
[2026-05-27 05:55:01] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
Running 630 sub problems to find dead transitions.
[2026-05-27 05:55:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1009 variables, and 22 constraints, problems are : Problem set: 0 solved, 630 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/378 constraints, PredecessorRefiner: 630/630 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1009 variables, and 29 constraints, problems are : Problem set: 0 solved, 630 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/378 constraints, PredecessorRefiner: 0/630 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60210ms problems are : Problem set: 0 solved, 630 unsolved
Search for dead transitions found 0 dead transitions in 60213ms
Starting structural reductions in LTL mode, iteration 1 : 378/432 places, 631/826 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61736 ms. Remains : 378/432 places, 631/826 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&&G(p1)&&F(p2)))))'
Stuttering acceptance computed with spot in 303 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 207 ms.
Product exploration explored 100000 steps with 0 reset in 357 ms.
Computed a total of 84 stabilizing places and 108 stable transitions
Computed a total of 84 stabilizing places and 108 stable transitions
Knowledge based reduction with 7 factoid took 75 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (27 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (19 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 951936 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :0 out of 1
Probabilistic random walk after 951936 steps, saw 158073 distinct states, run finished after 3001 ms. (steps per millisecond=317 ) properties seen :0
[2026-05-27 05:56:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 257/342 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 595/937 variables, 342/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/937 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/973 variables, 18/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/973 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/997 variables, 9/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/997 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/1009 variables, 9/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1009 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1009 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1009/1009 variables, and 388 constraints, problems are : Problem set: 0 solved, 1 unsolved in 416 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 257/342 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 595/937 variables, 342/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/937 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/937 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 36/973 variables, 18/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/973 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/997 variables, 9/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/997 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/1009 variables, 9/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1009 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1009 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1009/1009 variables, and 389 constraints, problems are : Problem set: 0 solved, 1 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1176ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 631/631 transitions.
Graph (trivial) has 281 edges and 378 vertex of which 11 / 378 are part of one of the 3 SCC in 2 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 370 transition count 563
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 317 transition count 556
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 314 transition count 556
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 117 place count 314 transition count 517
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 195 place count 275 transition count 517
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 265 place count 240 transition count 482
Performed 44 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 353 place count 196 transition count 576
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 356 place count 196 transition count 573
Free-agglomeration rule applied 23 times.
Iterating global reduction 3 with 23 rules applied. Total rules applied 379 place count 196 transition count 550
Reduce places removed 23 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 411 place count 173 transition count 541
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 417 place count 167 transition count 535
Iterating global reduction 4 with 6 rules applied. Total rules applied 423 place count 167 transition count 535
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 432 place count 167 transition count 526
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 459 place count 167 transition count 499
Applied a total of 459 rules in 118 ms. Remains 167 /378 variables (removed 211) and now considering 499/631 (removed 132) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 167/378 places, 499/631 transitions.
RANDOM walk for 35468 steps (1156 resets) in 261 ms. (135 steps per ms) remains 0/1 properties
Knowledge based reduction with 7 factoid took 92 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 4866 ms.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 378 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 631/631 transitions.
Applied a total of 0 rules in 4 ms. Remains 378 /378 variables (removed 0) and now considering 631/631 (removed 0) transitions.
[2026-05-27 05:56:07] [INFO ] Invariant cache hit.
[2026-05-27 05:56:07] [INFO ] Implicit Places using invariants in 280 ms returned []
[2026-05-27 05:56:07] [INFO ] Invariant cache hit.
[2026-05-27 05:56:08] [INFO ] Implicit Places using invariants and state equation in 993 ms returned []
Implicit Place search using SMT with State Equation took 1275 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1280 ms. Remains : 378/378 places, 631/631 transitions.
Computed a total of 84 stabilizing places and 108 stable transitions
Computed a total of 84 stabilizing places and 108 stable transitions
Knowledge based reduction with 1 factoid took 52 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (28 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (27 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 819001 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :0 out of 1
Probabilistic random walk after 819001 steps, saw 136874 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
[2026-05-27 05:56:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 257/342 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 595/937 variables, 342/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/937 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/973 variables, 18/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/973 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/997 variables, 9/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/997 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/1009 variables, 9/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1009 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1009 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1009/1009 variables, and 388 constraints, problems are : Problem set: 0 solved, 1 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 257/342 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 595/937 variables, 342/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/937 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/937 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 36/973 variables, 18/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/973 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/997 variables, 9/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/997 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/1009 variables, 9/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1009 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1009 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1009/1009 variables, and 389 constraints, problems are : Problem set: 0 solved, 1 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1114ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 631/631 transitions.
Graph (trivial) has 281 edges and 378 vertex of which 11 / 378 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 370 transition count 563
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 317 transition count 556
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 314 transition count 556
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 117 place count 314 transition count 517
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 195 place count 275 transition count 517
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 265 place count 240 transition count 482
Performed 44 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 353 place count 196 transition count 576
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 356 place count 196 transition count 573
Free-agglomeration rule applied 23 times.
Iterating global reduction 3 with 23 rules applied. Total rules applied 379 place count 196 transition count 550
Reduce places removed 23 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 411 place count 173 transition count 541
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 417 place count 167 transition count 535
Iterating global reduction 4 with 6 rules applied. Total rules applied 423 place count 167 transition count 535
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 432 place count 167 transition count 526
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 459 place count 167 transition count 499
Applied a total of 459 rules in 99 ms. Remains 167 /378 variables (removed 211) and now considering 499/631 (removed 132) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 167/378 places, 499/631 transitions.
RANDOM walk for 30648 steps (1011 resets) in 157 ms. (193 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 4757 ms.
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 4 reset in 165 ms.
Product exploration explored 100000 steps with 0 reset in 190 ms.
Spot run failed in 149 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/ltsmin4736353523789412859
[2026-05-27 05:56:14] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4736353523789412859
Running compilation step : cd /tmp/ltsmin4736353523789412859;'/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 2477 ms.
Running link step : cd /tmp/ltsmin4736353523789412859;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin4736353523789412859;'/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/stateBased13871398341142873351.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 631/631 transitions.
Applied a total of 0 rules in 5 ms. Remains 378 /378 variables (removed 0) and now considering 631/631 (removed 0) transitions.
[2026-05-27 05:56:29] [INFO ] Invariant cache hit.
[2026-05-27 05:56:29] [INFO ] Implicit Places using invariants in 311 ms returned []
[2026-05-27 05:56:29] [INFO ] Invariant cache hit.
[2026-05-27 05:56:30] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1081 ms. Remains : 378/378 places, 631/631 transitions.
Built C files in :
/tmp/ltsmin13976601990382008761
[2026-05-27 05:56:30] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13976601990382008761
Running compilation step : cd /tmp/ltsmin13976601990382008761;'/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 1500 ms.
Running link step : cd /tmp/ltsmin13976601990382008761;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13976601990382008761;'/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/stateBased7687233800446931650.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 05:56:45] [INFO ] Flatten gal took : 36 ms
[2026-05-27 05:56:45] [INFO ] Flatten gal took : 51 ms
[2026-05-27 05:56:45] [INFO ] Time to serialize gal into /tmp/LTL763716939774280194.gal : 13 ms
[2026-05-27 05:56:45] [INFO ] Time to serialize properties into /tmp/LTL5759787946451582303.prop : 1 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/LTL763716939774280194.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14341161729039975578.hoa' '-atoms' '/tmp/LTL5759787946451582303.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/LTL5759787946451582303.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14341161729039975578.hoa
Detected timeout of ITS tools.
[2026-05-27 05:57:01] [INFO ] Flatten gal took : 34 ms
[2026-05-27 05:57:01] [INFO ] Flatten gal took : 28 ms
[2026-05-27 05:57:01] [INFO ] Time to serialize gal into /tmp/LTL9934175363761922021.gal : 7 ms
[2026-05-27 05:57:01] [INFO ] Time to serialize properties into /tmp/LTL15436341227497507714.ltl : 3 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/LTL9934175363761922021.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15436341227497507714.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...276
Read 1 LTL properties
Checking formula 0 : !((X(X((("(p533==0)")&&(G("(p498==0)")))&&(F("((p12==0)||(p347==0))"))))))
Formula 0 simplified : XX(!"(p533==0)" | F!"(p498==0)" | G!"((p12==0)||(p347==0))")
Detected timeout of ITS tools.
[2026-05-27 05:57:16] [INFO ] Flatten gal took : 25 ms
[2026-05-27 05:57:16] [INFO ] Applying decomposition
[2026-05-27 05:57:16] [INFO ] Flatten gal took : 25 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/graph9024876773750731935.txt' '-o' '/tmp/graph9024876773750731935.bin' '-w' '/tmp/graph9024876773750731935.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9024876773750731935.bin' '-l' '-1' '-v' '-w' '/tmp/graph9024876773750731935.weights' '-q' '0' '-e' '0.001'
[2026-05-27 05:57:16] [INFO ] Decomposing Gal with order
[2026-05-27 05:57:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 05:57:16] [INFO ] Removed a total of 684 redundant transitions.
[2026-05-27 05:57:16] [INFO ] Flatten gal took : 193 ms
[2026-05-27 05:57:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 28 ms.
[2026-05-27 05:57:16] [INFO ] Time to serialize gal into /tmp/LTL12316902923122331500.gal : 20 ms
[2026-05-27 05:57:16] [INFO ] Time to serialize properties into /tmp/LTL17820138545590111366.ltl : 1 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/LTL12316902923122331500.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17820138545590111366.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...256
Read 1 LTL properties
Checking formula 0 : !((X(X((("(i1.i3.u114.p533==0)")&&(G("(i13.u103.p498==0)")))&&(F("((i1.i0.u4.p12==0)||(i1.i0.u76.p347==0))"))))))
Formula 0 simplified : XX(!"(i1.i3.u114.p533==0)" | F!"(i13.u103.p498==0)" | G!"((i1.i0.u4.p12==0)||(i1.i0.u76.p347==0))")
Detected timeout of ITS tools.
Treatment of property FireWire-PT-20-LTLFireability-01 finished in 151901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((X(X(!p0)) U ((X(X(!p0))&&(p1 U (p2||G(p1))))||X(X(G(!p0)))))) U (!p0 U (p3||G(!p0))))))'
Support contains 6 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 826/826 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 417 transition count 773
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 417 transition count 773
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 413 transition count 767
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 413 transition count 767
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 413 transition count 766
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 410 transition count 758
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 410 transition count 758
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 407 transition count 751
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 407 transition count 751
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 404 transition count 743
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 404 transition count 743
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 401 transition count 736
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 401 transition count 736
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 398 transition count 729
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 398 transition count 729
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 395 transition count 722
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 395 transition count 722
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 392 transition count 716
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 392 transition count 716
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 390 transition count 711
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 390 transition count 711
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 388 transition count 707
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 388 transition count 707
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 386 transition count 702
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 386 transition count 702
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 384 transition count 699
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 384 transition count 699
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 383 transition count 697
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 383 transition count 697
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 382 transition count 695
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 382 transition count 695
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 381 transition count 694
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 381 transition count 694
Applied a total of 103 rules in 143 ms. Remains 381 /432 variables (removed 51) and now considering 694/826 (removed 132) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11426684110067318479.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12414744291682683267.kers'
[2026-05-27 05:57:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11426684110067318479.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12414744291682683267.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 694 rows 381 cols 2180 entries
Finished phase 1 with 371 SingleSign rule and 0 generalized
[2026-05-27 05:57:32] [INFO ] Computed 10 invariants in 5 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12414744291682683267.kers
Total runtime 6 ms.
[2026-05-27 05:57:32] [INFO ] Implicit Places using invariants in 507 ms returned []
[2026-05-27 05:57:32] [INFO ] Invariant cache hit.
[2026-05-27 05:57:33] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1455 ms to find 0 implicit places.
Running 693 sub problems to find dead transitions.
[2026-05-27 05:57:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (OVERLAPS) 1/381 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/1075 variables, and 20 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/381 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 693 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (OVERLAPS) 1/381 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/1075 variables, and 40 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/381 constraints, PredecessorRefiner: 0/693 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60249ms problems are : Problem set: 0 solved, 693 unsolved
Search for dead transitions found 0 dead transitions in 60252ms
Starting structural reductions in LTL mode, iteration 1 : 381/432 places, 694/826 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61853 ms. Remains : 381/432 places, 694/826 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((X(X(!p0)) U (X(X(G(!p0)))||(X(X(!p0))&&(p1 U (p2||G(p1))))))) U (!p0 U (G(!p0)||p3)))))'
Stuttering acceptance computed with spot in 897 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), p0, (AND p0 (NOT p3)), (AND p0 (NOT p3)), false, p0, (AND p0 (NOT p2) (NOT p1)), p0, (AND p0 (NOT p2) (NOT p1)), (AND (NOT p3) p0), false, true, (AND p0 (NOT p2) (NOT p1)), false, (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-02
Product exploration explored 100000 steps with 3 reset in 251 ms.
Product exploration explored 100000 steps with 18 reset in 408 ms.
Computed a total of 84 stabilizing places and 108 stable transitions
Computed a total of 84 stabilizing places and 108 stable transitions
Knowledge based reduction with 29 factoid took 912 ms. Reduced automaton from 16 states, 41 edges and 4 AP (stutter sensitive) to 16 states, 40 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (21 resets) in 242 ms. (164 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40001 steps (24 resets) in 245 ms. (162 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (24 resets) in 206 ms. (193 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (34 resets) in 208 ms. (191 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (25 resets) in 146 ms. (272 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (14 resets) in 153 ms. (259 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (25 resets) in 205 ms. (194 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (12 resets) in 252 ms. (158 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (27 resets) in 176 ms. (225 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (24 resets) in 184 ms. (216 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (28 resets) in 161 ms. (246 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (25 resets) in 195 ms. (204 steps per ms) remains 11/11 properties
[2026-05-27 05:58:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem apf4 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 200/206 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 139/345 variables, 7/10 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 658/1003 variables, 345/355 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 0/355 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 36/1039 variables, 18/373 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1039 variables, 0/373 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 24/1063 variables, 9/382 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1063 variables, 0/382 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 12/1075 variables, 9/391 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1075 variables, 0/391 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/1075 variables, 0/391 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1075/1075 variables, and 391 constraints, problems are : Problem set: 2 solved, 9 unsolved in 4266 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 381/381 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 200/206 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 139/345 variables, 7/10 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 658/1003 variables, 345/355 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 9/364 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 0/364 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 36/1039 variables, 18/382 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1039 variables, 0/382 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 24/1063 variables, 9/391 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1063 variables, 0/391 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 12/1075 variables, 9/400 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1075 variables, 1/401 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1075/1075 variables, and 401 constraints, problems are : Problem set: 2 solved, 9 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 381/381 constraints, PredecessorRefiner: 9/11 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9293ms problems are : Problem set: 2 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 381/381 places, 694/694 transitions.
Graph (trivial) has 280 edges and 381 vertex of which 11 / 381 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 373 transition count 627
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 59 rules applied. Total rules applied 112 place count 321 transition count 620
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 115 place count 318 transition count 620
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 115 place count 318 transition count 583
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 189 place count 281 transition count 583
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 259 place count 246 transition count 548
Performed 45 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 349 place count 201 transition count 756
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 358 place count 201 transition count 747
Free-agglomeration rule applied 22 times.
Iterating global reduction 3 with 22 rules applied. Total rules applied 380 place count 201 transition count 725
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 418 place count 179 transition count 709
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 424 place count 173 transition count 703
Iterating global reduction 4 with 6 rules applied. Total rules applied 430 place count 173 transition count 703
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 445 place count 173 transition count 688
Drop transitions (Redundant composition of simpler transitions.) removed 132 transitions
Redundant transition composition rules discarded 132 transitions
Iterating global reduction 5 with 132 rules applied. Total rules applied 577 place count 173 transition count 556
Applied a total of 577 rules in 110 ms. Remains 173 /381 variables (removed 208) and now considering 556/694 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 173/381 places, 556/694 transitions.
RANDOM walk for 40000 steps (1324 resets) in 494 ms. (80 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40003 steps (309 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 246 ms. (161 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (20 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (26 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
[2026-05-27 05:58:47] [INFO ] Flow matrix only has 494 transitions (discarded 62 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9903137575514536412.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18220204237512578218.kers'
[2026-05-27 05:58:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9903137575514536412.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18220204237512578218.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 494 rows 173 cols 1817 entries
Finished phase 1 with 163 SingleSign rule and 0 generalized
[2026-05-27 05:58:47] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18220204237512578218.kers
Total runtime 4 ms.
[2026-05-27 05:58:47] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 94/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 61/161 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 494/655 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/655 variables, 101/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/655 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 12/667 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/667 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 667/667 variables, and 284 constraints, problems are : Problem set: 0 solved, 4 unsolved in 785 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 94/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 61/161 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 494/655 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/655 variables, 101/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/655 variables, 4/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 12/667 variables, 12/288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/667 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/667 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 667/667 variables, and 288 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3050 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3863ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 854 ms.
Support contains 6 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 556/556 transitions.
Applied a total of 0 rules in 9 ms. Remains 173 /173 variables (removed 0) and now considering 556/556 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 173/173 places, 556/556 transitions.
RANDOM walk for 40000 steps (1290 resets) in 157 ms. (253 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (316 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (14 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
[2026-05-27 05:58:51] [INFO ] Flow matrix only has 494 transitions (discarded 62 similar events)
[2026-05-27 05:58:51] [INFO ] Invariant cache hit.
[2026-05-27 05:58:51] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/161 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 494/655 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/655 variables, 101/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/655 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/667 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/667 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 667/667 variables, and 284 constraints, problems are : Problem set: 0 solved, 2 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 101/101 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/161 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 494/655 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/655 variables, 101/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/655 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/667 variables, 12/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/667 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/667 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 667/667 variables, and 286 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1234 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1617ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 978 ms.
Support contains 6 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 556/556 transitions.
Applied a total of 0 rules in 8 ms. Remains 173 /173 variables (removed 0) and now considering 556/556 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 173/173 places, 556/556 transitions.
RANDOM walk for 40000 steps (1312 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (296 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 60356 steps, run visited all 2 properties in 453 ms. (steps per millisecond=133 )
Probabilistic random walk after 60356 steps, saw 22428 distinct states, run finished after 453 ms. (steps per millisecond=133 ) properties seen :2
Found 2 invariant AP formulas.
Knowledge based reduction with 31 factoid took 1023 ms. Reduced automaton from 16 states, 40 edges and 4 AP (stutter sensitive) to 12 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 462 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), p0, (AND p0 (NOT p3)), (AND p0 (NOT p3)), p0, (AND p0 (NOT p2)), p0, (AND p0 (NOT p2)), (AND (NOT p3) p0), true, (AND p0 (NOT p2))]
Knowledge-based reduction took 21118 ms.
Stuttering acceptance computed with spot in 601 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), p0, (AND p0 (NOT p3)), (AND p0 (NOT p3)), p0, (AND p0 (NOT p2)), p0, (AND p0 (NOT p2)), (AND (NOT p3) p0), true, (AND p0 (NOT p2))]
Support contains 6 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 694/694 transitions.
Applied a total of 0 rules in 7 ms. Remains 381 /381 variables (removed 0) and now considering 694/694 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1586237902758797990.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4360311028700528102.kers'
[2026-05-27 05:58:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1586237902758797990.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4360311028700528102.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 694 rows 381 cols 2180 entries
Finished phase 1 with 371 SingleSign rule and 0 generalized
[2026-05-27 05:58:57] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4360311028700528102.kers
Total runtime 6 ms.
[2026-05-27 05:58:57] [INFO ] Implicit Places using invariants in 471 ms returned []
[2026-05-27 05:58:57] [INFO ] Invariant cache hit.
[2026-05-27 05:58:58] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1425 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1434 ms. Remains : 381/381 places, 694/694 transitions.
Computed a total of 84 stabilizing places and 108 stable transitions
Computed a total of 84 stabilizing places and 108 stable transitions
Knowledge based reduction with 21 factoid took 413 ms. Reduced automaton from 12 states, 28 edges and 4 AP (stutter sensitive) to 12 states, 28 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (19 resets) in 212 ms. (187 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40000 steps (23 resets) in 156 ms. (254 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (31 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (27 resets) in 152 ms. (261 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (19 resets) in 164 ms. (242 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (26 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (14 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (46 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (19 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
[2026-05-27 05:58:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 200/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 139/345 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 658/1003 variables, 345/355 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 36/1039 variables, 18/373 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1039 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 24/1063 variables, 9/382 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1063 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 12/1075 variables, 9/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1075 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/1075 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1075/1075 variables, and 391 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1975 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 381/381 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 200/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 139/345 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 658/1003 variables, 345/355 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 8/363 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 36/1039 variables, 18/381 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1039 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 24/1063 variables, 9/390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1063 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 12/1075 variables, 9/399 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1075 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/1075 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1075/1075 variables, and 399 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4994 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 381/381 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6981ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1636 ms.
Support contains 6 out of 381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 381/381 places, 694/694 transitions.
Graph (trivial) has 280 edges and 381 vertex of which 11 / 381 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 373 transition count 627
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 59 rules applied. Total rules applied 112 place count 321 transition count 620
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 115 place count 318 transition count 620
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 115 place count 318 transition count 583
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 189 place count 281 transition count 583
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 259 place count 246 transition count 548
Performed 45 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 349 place count 201 transition count 756
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 358 place count 201 transition count 747
Free-agglomeration rule applied 22 times.
Iterating global reduction 3 with 22 rules applied. Total rules applied 380 place count 201 transition count 725
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 418 place count 179 transition count 709
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 424 place count 173 transition count 703
Iterating global reduction 4 with 6 rules applied. Total rules applied 430 place count 173 transition count 703
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 445 place count 173 transition count 688
Drop transitions (Redundant composition of simpler transitions.) removed 132 transitions
Redundant transition composition rules discarded 132 transitions
Iterating global reduction 5 with 132 rules applied. Total rules applied 577 place count 173 transition count 556
Applied a total of 577 rules in 58 ms. Remains 173 /381 variables (removed 208) and now considering 556/694 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 173/381 places, 556/694 transitions.
RANDOM walk for 40000 steps (1293 resets) in 166 ms. (239 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (25 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (11 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (20 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
[2026-05-27 05:59:08] [INFO ] Flow matrix only has 494 transitions (discarded 62 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15118084260524479291.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13638565067497040991.kers'
[2026-05-27 05:59:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15118084260524479291.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13638565067497040991.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 494 rows 173 cols 1817 entries
Finished phase 1 with 163 SingleSign rule and 0 generalized
[2026-05-27 05:59:08] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13638565067497040991.kers
Total runtime 3 ms.
[2026-05-27 05:59:08] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 94/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 61/161 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 494/655 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/655 variables, 101/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/655 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 12/667 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/667 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 667/667 variables, and 284 constraints, problems are : Problem set: 0 solved, 3 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 94/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 61/161 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 494/655 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/655 variables, 101/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/655 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 12/667 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/667 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/667 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 667/667 variables, and 287 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1667 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2113ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 271 ms.
Support contains 6 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 556/556 transitions.
Applied a total of 0 rules in 10 ms. Remains 173 /173 variables (removed 0) and now considering 556/556 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 173/173 places, 556/556 transitions.
RANDOM walk for 40000 steps (1288 resets) in 258 ms. (154 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (14 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (16 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 21912 steps, run visited all 3 properties in 298 ms. (steps per millisecond=73 )
Probabilistic random walk after 21912 steps, saw 9163 distinct states, run finished after 299 ms. (steps per millisecond=73 ) properties seen :3
Knowledge based reduction with 21 factoid took 601 ms. Reduced automaton from 12 states, 28 edges and 4 AP (stutter sensitive) to 12 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 597 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), p0, (AND p0 (NOT p3)), (AND p0 (NOT p3)), p0, (AND p0 (NOT p2)), p0, (AND p0 (NOT p2)), (AND (NOT p3) p0), true, (AND p0 (NOT p2))]
Knowledge-based reduction took 13890 ms.
Stuttering acceptance computed with spot in 600 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), p0, (AND p0 (NOT p3)), (AND p0 (NOT p3)), p0, (AND p0 (NOT p2)), p0, (AND p0 (NOT p2)), (AND (NOT p3) p0), true, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 597 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), p0, (AND p0 (NOT p3)), (AND p0 (NOT p3)), p0, (AND p0 (NOT p2)), p0, (AND p0 (NOT p2)), (AND (NOT p3) p0), true, (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 7 reset in 251 ms.
Product exploration explored 100000 steps with 1 reset in 286 ms.
Spot run failed in 84 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/ltsmin13437251721406381966
[2026-05-27 05:59:14] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13437251721406381966
Running compilation step : cd /tmp/ltsmin13437251721406381966;'/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 1954 ms.
Running link step : cd /tmp/ltsmin13437251721406381966;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13437251721406381966;'/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/stateBased11999052362663349084.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 694/694 transitions.
Applied a total of 0 rules in 4 ms. Remains 381 /381 variables (removed 0) and now considering 694/694 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12699585923258122868.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3347157527785750205.kers'
[2026-05-27 05:59:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12699585923258122868.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3347157527785750205.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 694 rows 381 cols 2180 entries
Finished phase 1 with 371 SingleSign rule and 0 generalized
[2026-05-27 05:59:29] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3347157527785750205.kers
Total runtime 3 ms.
[2026-05-27 05:59:29] [INFO ] Implicit Places using invariants in 302 ms returned []
[2026-05-27 05:59:29] [INFO ] Invariant cache hit.
[2026-05-27 05:59:30] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 927 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 932 ms. Remains : 381/381 places, 694/694 transitions.
Built C files in :
/tmp/ltsmin17818565720228924621
[2026-05-27 05:59:30] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17818565720228924621
Running compilation step : cd /tmp/ltsmin17818565720228924621;'/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 1567 ms.
Running link step : cd /tmp/ltsmin17818565720228924621;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17818565720228924621;'/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/stateBased18395294624703405537.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 05:59:45] [INFO ] Flatten gal took : 23 ms
[2026-05-27 05:59:45] [INFO ] Flatten gal took : 22 ms
[2026-05-27 05:59:45] [INFO ] Time to serialize gal into /tmp/LTL11579791425633453273.gal : 6 ms
[2026-05-27 05:59:45] [INFO ] Time to serialize properties into /tmp/LTL15480084748013318393.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/LTL11579791425633453273.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13390065432669321324.hoa' '-atoms' '/tmp/LTL15480084748013318393.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15480084748013318393.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13390065432669321324.hoa
Detected timeout of ITS tools.
[2026-05-27 06:00:00] [INFO ] Flatten gal took : 20 ms
[2026-05-27 06:00:00] [INFO ] Flatten gal took : 19 ms
[2026-05-27 06:00:00] [INFO ] Time to serialize gal into /tmp/LTL12981356521235499265.gal : 7 ms
[2026-05-27 06:00:00] [INFO ] Time to serialize properties into /tmp/LTL18392009915521892212.ltl : 1 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/LTL12981356521235499265.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18392009915521892212.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...277
Read 1 LTL properties
Checking formula 0 : !((G((X((X(X(!("((p36==1)&&(p205==1))"))))U((X(X(G(!("((p36==1)&&(p205==1))")))))||((X(X(!("((p36==1)&&(p205==1))"))))&&(("(p399!=1)")...333
Formula 0 simplified : F(X(XX"((p36==1)&&(p205==1))" R (XXF"((p36==1)&&(p205==1))" & (XX"((p36==1)&&(p205==1))" | (!"(p399!=1)" M !"((!((p41==1)&&(p178==1)...246
Detected timeout of ITS tools.
[2026-05-27 06:00:15] [INFO ] Flatten gal took : 18 ms
[2026-05-27 06:00:15] [INFO ] Applying decomposition
[2026-05-27 06:00:15] [INFO ] Flatten gal took : 18 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/graph11624699997984461710.txt' '-o' '/tmp/graph11624699997984461710.bin' '-w' '/tmp/graph11624699997984461710.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11624699997984461710.bin' '-l' '-1' '-v' '-w' '/tmp/graph11624699997984461710.weights' '-q' '0' '-e' '0.001'
[2026-05-27 06:00:15] [INFO ] Decomposing Gal with order
[2026-05-27 06:00:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 06:00:15] [INFO ] Removed a total of 786 redundant transitions.
[2026-05-27 06:00:15] [INFO ] Flatten gal took : 47 ms
[2026-05-27 06:00:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 21 ms.
[2026-05-27 06:00:15] [INFO ] Time to serialize gal into /tmp/LTL14157829705956892451.gal : 6 ms
[2026-05-27 06:00:15] [INFO ] Time to serialize properties into /tmp/LTL15431336749663564877.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/LTL14157829705956892451.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15431336749663564877.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...256
Read 1 LTL properties
Checking formula 0 : !((G((X((X(X(!("((i12.i0.u6.p36==1)&&(i5.u45.p205==1))"))))U((X(X(G(!("((i12.i0.u6.p36==1)&&(i5.u45.p205==1))")))))||((X(X(!("((i12.i0...492
Formula 0 simplified : F(X(XX"((i12.i0.u6.p36==1)&&(i5.u45.p205==1))" R (XXF"((i12.i0.u6.p36==1)&&(i5.u45.p205==1))" & (XX"((i12.i0.u6.p36==1)&&(i5.u45.p20...378
Detected timeout of ITS tools.
Treatment of property FireWire-PT-20-LTLFireability-02 finished in 179041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U G(p1)) U X(p2)) U X(X(p3))))'
Support contains 5 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 826/826 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 417 transition count 744
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 417 transition count 744
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 417 transition count 743
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 413 transition count 736
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 413 transition count 736
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 413 transition count 735
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 411 transition count 729
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 411 transition count 729
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 409 transition count 725
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 409 transition count 725
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 407 transition count 719
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 407 transition count 719
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 405 transition count 715
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 405 transition count 715
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 403 transition count 710
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 403 transition count 710
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 401 transition count 706
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 401 transition count 706
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 399 transition count 702
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 399 transition count 702
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 398 transition count 700
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 398 transition count 700
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 397 transition count 698
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 397 transition count 698
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 396 transition count 696
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 396 transition count 696
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 395 transition count 695
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 395 transition count 695
Applied a total of 76 rules in 73 ms. Remains 395 /432 variables (removed 37) and now considering 695/826 (removed 131) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16055045303971935222.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2169645471927486398.kers'
[2026-05-27 06:00:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16055045303971935222.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2169645471927486398.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 695 rows 395 cols 2182 entries
Finished phase 1 with 385 SingleSign rule and 0 generalized
[2026-05-27 06:00:30] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2169645471927486398.kers
Total runtime 4 ms.
[2026-05-27 06:00:31] [INFO ] Implicit Places using invariants in 317 ms returned []
[2026-05-27 06:00:31] [INFO ] Invariant cache hit.
[2026-05-27 06:00:32] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1382 ms to find 0 implicit places.
Running 694 sub problems to find dead transitions.
[2026-05-27 06:00:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 1 (OVERLAPS) 1/395 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 395/1090 variables, and 21 constraints, problems are : Problem set: 0 solved, 694 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/395 constraints, PredecessorRefiner: 694/694 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 694 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 1 (OVERLAPS) 1/395 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 4 (OVERLAPS) 695/1090 variables, 395/416 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 694/1110 constraints. Problems are: Problem set: 0 solved, 694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1110 constraints, problems are : Problem set: 0 solved, 694 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 395/395 constraints, PredecessorRefiner: 694/694 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 694 unsolved
Search for dead transitions found 0 dead transitions in 60289ms
Starting structural reductions in LTL mode, iteration 1 : 395/432 places, 695/826 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61747 ms. Remains : 395/432 places, 695/826 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U G(p1)) U X(p2)) U X(X(p3))))'
Stuttering acceptance computed with spot in 1375 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (NOT p3), true, (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-04
Product exploration explored 100000 steps with 33290 reset in 255 ms.
Stack based approach found an accepted trace after 1160 steps with 390 reset with depth 5 and stack size 5 in 4 ms.
FORMULA FireWire-PT-20-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-20-LTLFireability-04 finished in 63479 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)))'
Support contains 4 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 826/826 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 416 transition count 715
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 416 transition count 715
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 416 transition count 714
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 411 transition count 706
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 411 transition count 706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 411 transition count 705
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 408 transition count 697
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 408 transition count 697
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 405 transition count 690
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 405 transition count 690
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 402 transition count 682
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 402 transition count 682
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 399 transition count 675
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 399 transition count 675
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 71 place count 396 transition count 668
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 396 transition count 668
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 393 transition count 661
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 393 transition count 661
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 390 transition count 655
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 390 transition count 655
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 388 transition count 650
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 388 transition count 650
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 386 transition count 646
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 386 transition count 646
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 384 transition count 641
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 384 transition count 641
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 382 transition count 638
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 382 transition count 638
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 381 transition count 636
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 381 transition count 636
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 380 transition count 634
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 380 transition count 634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 379 transition count 633
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 379 transition count 633
Applied a total of 108 rules in 140 ms. Remains 379 /432 variables (removed 53) and now considering 633/826 (removed 193) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14556674662482925615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-325515775493030497.kers'
[2026-05-27 06:01:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14556674662482925615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-325515775493030497.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 633 rows 379 cols 1938 entries
Finished phase 1 with 369 SingleSign rule and 0 generalized
[2026-05-27 06:01:34] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-325515775493030497.kers
Total runtime 6 ms.
[2026-05-27 06:01:34] [INFO ] Implicit Places using invariants in 477 ms returned []
[2026-05-27 06:01:34] [INFO ] Invariant cache hit.
[2026-05-27 06:01:36] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned []
Implicit Place search using SMT with State Equation took 1557 ms to find 0 implicit places.
Running 632 sub problems to find dead transitions.
[2026-05-27 06:01:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 379/1012 variables, and 19 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/379 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/1012 variables, and 28 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/379 constraints, PredecessorRefiner: 0/632 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60202ms problems are : Problem set: 0 solved, 632 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Starting structural reductions in LTL mode, iteration 1 : 379/432 places, 633/826 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61904 ms. Remains : 379/432 places, 633/826 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)))'
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-05 finished in 62106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U X(p1)) U (G(p2) U X(p3)))||G(F(p1)))))'
Support contains 7 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 826/826 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 415 transition count 713
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 415 transition count 713
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 415 transition count 712
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 410 transition count 704
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 410 transition count 704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 410 transition count 703
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 407 transition count 695
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 407 transition count 695
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 405 transition count 690
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 405 transition count 690
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 403 transition count 685
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 403 transition count 685
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 401 transition count 680
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 401 transition count 680
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 400 transition count 678
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 400 transition count 678
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 399 transition count 675
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 399 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 398 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 398 transition count 673
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 397 transition count 670
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 397 transition count 670
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 396 transition count 668
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 396 transition count 668
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 395 transition count 665
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 395 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 394 transition count 663
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 394 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 393 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 393 transition count 661
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 392 transition count 659
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 392 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 391 transition count 658
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 391 transition count 658
Applied a total of 84 rules in 91 ms. Remains 391 /432 variables (removed 41) and now considering 658/826 (removed 168) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9994997261838363509.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4027353215070246570.kers'
[2026-05-27 06:02:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9994997261838363509.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4027353215070246570.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 658 rows 391 cols 2038 entries
Finished phase 1 with 381 SingleSign rule and 0 generalized
[2026-05-27 06:02:36] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4027353215070246570.kers
Total runtime 4 ms.
[2026-05-27 06:02:36] [INFO ] Implicit Places using invariants in 341 ms returned []
[2026-05-27 06:02:36] [INFO ] Invariant cache hit.
[2026-05-27 06:02:37] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
Running 657 sub problems to find dead transitions.
[2026-05-27 06:02:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 1 (OVERLAPS) 1/391 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 657 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 391/1049 variables, and 20 constraints, problems are : Problem set: 0 solved, 657 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/391 constraints, PredecessorRefiner: 657/657 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 657 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 1 (OVERLAPS) 1/391 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 657 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/1049 variables, and 24 constraints, problems are : Problem set: 0 solved, 657 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/391 constraints, PredecessorRefiner: 0/657 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 657 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Starting structural reductions in LTL mode, iteration 1 : 391/432 places, 658/826 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61341 ms. Remains : 391/432 places, 658/826 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U X(p1)) U (G(p2) U X(p3)))||G(F(p1)))))'
Stuttering acceptance computed with spot in 1145 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-08
Stuttering criterion allowed to conclude after 97 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-08 finished in 62629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F(((!p0&&F(p1))||(!p0&&G(!p2)))))||(!p3&&F(((!p0&&F(p1))||(!p0&&G(!p2))))))))))'
Support contains 7 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 826/826 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 416 transition count 717
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 416 transition count 717
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 416 transition count 716
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 413 transition count 711
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 413 transition count 711
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 411 transition count 706
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 411 transition count 706
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 409 transition count 701
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 409 transition count 701
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 407 transition count 696
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 407 transition count 696
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 405 transition count 691
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 405 transition count 691
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 403 transition count 686
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 403 transition count 686
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 401 transition count 681
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 401 transition count 681
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 399 transition count 676
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 399 transition count 676
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 397 transition count 671
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 397 transition count 671
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 395 transition count 667
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 395 transition count 667
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 393 transition count 662
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 393 transition count 662
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 391 transition count 659
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 391 transition count 659
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 390 transition count 657
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 390 transition count 657
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 389 transition count 655
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 389 transition count 655
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 388 transition count 654
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 388 transition count 654
Applied a total of 89 rules in 140 ms. Remains 388 /432 variables (removed 44) and now considering 654/826 (removed 172) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12012084117291444442.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14936994992081529534.kers'
[2026-05-27 06:03:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12012084117291444442.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14936994992081529534.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 654 rows 388 cols 2024 entries
Finished phase 1 with 378 SingleSign rule and 0 generalized
[2026-05-27 06:03:39] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-14936994992081529534.kers
Total runtime 6 ms.
[2026-05-27 06:03:39] [INFO ] Implicit Places using invariants in 476 ms returned []
[2026-05-27 06:03:39] [INFO ] Invariant cache hit.
[2026-05-27 06:03:40] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1417 ms to find 0 implicit places.
Running 653 sub problems to find dead transitions.
[2026-05-27 06:03:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/387 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 1 (OVERLAPS) 1/388 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 653 unsolved
SMT process timed out in 30417ms, After SMT, problems are : Problem set: 0 solved, 653 unsolved
Search for dead transitions found 0 dead transitions in 30419ms
Starting structural reductions in LTL mode, iteration 1 : 388/432 places, 654/826 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31980 ms. Remains : 388/432 places, 654/826 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F(((p0&&F(p1))||(p0&&G(p2)))))||(F(((p0&&F(p1))||(p0&&G(p2))))&&p3))))))'
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 341 ms.
Product exploration explored 100000 steps with 33333 reset in 421 ms.
Computed a total of 93 stabilizing places and 128 stable transitions
Computed a total of 93 stabilizing places and 128 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 18 ms. Proved property starting from automaton with 6 states, 13 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 31 ms.
FORMULA FireWire-PT-20-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-20-LTLFireability-10 finished in 33185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 826/826 transitions.
Graph (trivial) has 300 edges and 432 vertex of which 8 / 432 are part of one of the 2 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 425 transition count 763
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 61 rules applied. Total rules applied 117 place count 370 transition count 757
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 120 place count 367 transition count 757
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 120 place count 367 transition count 721
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 192 place count 331 transition count 721
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 206 place count 317 transition count 611
Iterating global reduction 3 with 14 rules applied. Total rules applied 220 place count 317 transition count 611
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 222 place count 317 transition count 609
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 222 place count 317 transition count 605
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 230 place count 313 transition count 605
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 234 place count 309 transition count 599
Iterating global reduction 4 with 4 rules applied. Total rules applied 238 place count 309 transition count 599
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 240 place count 309 transition count 597
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 241 place count 308 transition count 597
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 244 place count 305 transition count 589
Iterating global reduction 6 with 3 rules applied. Total rules applied 247 place count 305 transition count 589
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 250 place count 302 transition count 582
Iterating global reduction 6 with 3 rules applied. Total rules applied 253 place count 302 transition count 582
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 256 place count 299 transition count 574
Iterating global reduction 6 with 3 rules applied. Total rules applied 259 place count 299 transition count 574
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 262 place count 296 transition count 567
Iterating global reduction 6 with 3 rules applied. Total rules applied 265 place count 296 transition count 567
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 268 place count 293 transition count 560
Iterating global reduction 6 with 3 rules applied. Total rules applied 271 place count 293 transition count 560
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 274 place count 290 transition count 553
Iterating global reduction 6 with 3 rules applied. Total rules applied 277 place count 290 transition count 553
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 279 place count 288 transition count 548
Iterating global reduction 6 with 2 rules applied. Total rules applied 281 place count 288 transition count 548
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 283 place count 286 transition count 543
Iterating global reduction 6 with 2 rules applied. Total rules applied 285 place count 286 transition count 543
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 287 place count 284 transition count 539
Iterating global reduction 6 with 2 rules applied. Total rules applied 289 place count 284 transition count 539
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 291 place count 282 transition count 534
Iterating global reduction 6 with 2 rules applied. Total rules applied 293 place count 282 transition count 534
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 294 place count 281 transition count 532
Iterating global reduction 6 with 1 rules applied. Total rules applied 295 place count 281 transition count 532
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 296 place count 280 transition count 530
Iterating global reduction 6 with 1 rules applied. Total rules applied 297 place count 280 transition count 530
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 298 place count 279 transition count 528
Iterating global reduction 6 with 1 rules applied. Total rules applied 299 place count 279 transition count 528
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 375 place count 241 transition count 490
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 376 place count 240 transition count 488
Iterating global reduction 6 with 1 rules applied. Total rules applied 377 place count 240 transition count 488
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 467 place count 195 transition count 587
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 470 place count 195 transition count 584
Applied a total of 470 rules in 159 ms. Remains 195 /432 variables (removed 237) and now considering 584/826 (removed 242) transitions.
[2026-05-27 06:04:12] [INFO ] Flow matrix only has 556 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18233022912842037291.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12368681875919124569.kers'
[2026-05-27 06:04:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18233022912842037291.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12368681875919124569.kers]
Normalized transition count is 555 out of 556 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 555 rows 195 cols 2194 entries
Finished phase 1 with 185 SingleSign rule and 0 generalized
[2026-05-27 06:04:12] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12368681875919124569.kers
Total runtime 3 ms.
[2026-05-27 06:04:12] [INFO ] Implicit Places using invariants in 199 ms returned []
[2026-05-27 06:04:12] [INFO ] Flow matrix only has 556 transitions (discarded 28 similar events)
[2026-05-27 06:04:12] [INFO ] Invariant cache hit.
[2026-05-27 06:04:12] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-27 06:04:13] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
[2026-05-27 06:04:13] [INFO ] Redundant transitions in 8 ms returned []
Running 575 sub problems to find dead transitions.
[2026-05-27 06:04:13] [INFO ] Flow matrix only has 556 transitions (discarded 28 similar events)
[2026-05-27 06:04:13] [INFO ] Invariant cache hit.
[2026-05-27 06:04:13] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 195/751 variables, and 15 constraints, problems are : Problem set: 0 solved, 575 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/195 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 575/575 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 575 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 3 (OVERLAPS) 1/195 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 6 (OVERLAPS) 555/750 variables, 195/210 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/750 variables, 12/222 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/750 variables, 575/797 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/751 variables, and 797 constraints, problems are : Problem set: 0 solved, 575 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 575/575 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60292ms problems are : Problem set: 0 solved, 575 unsolved
Search for dead transitions found 0 dead transitions in 60293ms
Starting structural reductions in SI_LTL mode, iteration 1 : 195/432 places, 584/826 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61605 ms. Remains : 195/432 places, 584/826 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 50 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-12
Product exploration explored 100000 steps with 8 reset in 107 ms.
Product exploration explored 100000 steps with 0 reset in 138 ms.
Computed a total of 31 stabilizing places and 56 stable transitions
Computed a total of 31 stabilizing places and 56 stable transitions
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 195 steps (4 resets) in 5 ms. (32 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Knowledge-based reduction took 207 ms.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 584/584 transitions.
Applied a total of 0 rules in 8 ms. Remains 195 /195 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2026-05-27 06:05:14] [INFO ] Flow matrix only has 556 transitions (discarded 28 similar events)
[2026-05-27 06:05:14] [INFO ] Invariant cache hit.
[2026-05-27 06:05:14] [INFO ] Implicit Places using invariants in 264 ms returned []
[2026-05-27 06:05:14] [INFO ] Flow matrix only has 556 transitions (discarded 28 similar events)
[2026-05-27 06:05:14] [INFO ] Invariant cache hit.
[2026-05-27 06:05:14] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-27 06:05:15] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
[2026-05-27 06:05:15] [INFO ] Redundant transitions in 7 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1155 ms. Remains : 195/195 places, 584/584 transitions.
Computed a total of 31 stabilizing places and 56 stable transitions
Computed a total of 31 stabilizing places and 56 stable transitions
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 268 steps (7 resets) in 4 ms. (53 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Knowledge-based reduction took 144 ms.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 53 ms.
Product exploration explored 100000 steps with 1 reset in 72 ms.
Built C files in :
/tmp/ltsmin6649529937497090125
[2026-05-27 06:05:15] [INFO ] Computing symmetric may disable matrix : 584 transitions.
[2026-05-27 06:05:15] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 06:05:15] [INFO ] Computing symmetric may enable matrix : 584 transitions.
[2026-05-27 06:05:15] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 06:05:16] [INFO ] Computing Do-Not-Accords matrix : 584 transitions.
[2026-05-27 06:05:16] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 06:05:16] [INFO ] Built C files in 160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6649529937497090125
Running compilation step : cd /tmp/ltsmin6649529937497090125;'/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 2500 ms.
Running link step : cd /tmp/ltsmin6649529937497090125;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin6649529937497090125;'/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/stateBased4301811219305540816.hoa' '--buchi-type=spotba'
LTSmin run took 1852 ms.
FORMULA FireWire-PT-20-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-20-LTLFireability-12 finished in 68289 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||G(p1)))))'
Support contains 2 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 826/826 transitions.
Graph (trivial) has 295 edges and 432 vertex of which 9 / 432 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 425 transition count 765
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 115 place count 371 transition count 759
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 120 place count 368 transition count 757
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 122 place count 366 transition count 757
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 122 place count 366 transition count 721
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 194 place count 330 transition count 721
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 206 place count 318 transition count 614
Iterating global reduction 4 with 12 rules applied. Total rules applied 218 place count 318 transition count 614
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 220 place count 318 transition count 612
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 220 place count 318 transition count 608
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 228 place count 314 transition count 608
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 232 place count 310 transition count 602
Iterating global reduction 5 with 4 rules applied. Total rules applied 236 place count 310 transition count 602
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 238 place count 310 transition count 600
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 239 place count 309 transition count 600
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 242 place count 306 transition count 592
Iterating global reduction 7 with 3 rules applied. Total rules applied 245 place count 306 transition count 592
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 248 place count 303 transition count 585
Iterating global reduction 7 with 3 rules applied. Total rules applied 251 place count 303 transition count 585
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 254 place count 300 transition count 577
Iterating global reduction 7 with 3 rules applied. Total rules applied 257 place count 300 transition count 577
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 260 place count 297 transition count 570
Iterating global reduction 7 with 3 rules applied. Total rules applied 263 place count 297 transition count 570
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 266 place count 294 transition count 563
Iterating global reduction 7 with 3 rules applied. Total rules applied 269 place count 294 transition count 563
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 272 place count 291 transition count 556
Iterating global reduction 7 with 3 rules applied. Total rules applied 275 place count 291 transition count 556
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 277 place count 289 transition count 551
Iterating global reduction 7 with 2 rules applied. Total rules applied 279 place count 289 transition count 551
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 281 place count 287 transition count 546
Iterating global reduction 7 with 2 rules applied. Total rules applied 283 place count 287 transition count 546
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 285 place count 285 transition count 542
Iterating global reduction 7 with 2 rules applied. Total rules applied 287 place count 285 transition count 542
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 289 place count 283 transition count 537
Iterating global reduction 7 with 2 rules applied. Total rules applied 291 place count 283 transition count 537
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 292 place count 282 transition count 535
Iterating global reduction 7 with 1 rules applied. Total rules applied 293 place count 282 transition count 535
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 294 place count 281 transition count 533
Iterating global reduction 7 with 1 rules applied. Total rules applied 295 place count 281 transition count 533
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 296 place count 280 transition count 531
Iterating global reduction 7 with 1 rules applied. Total rules applied 297 place count 280 transition count 531
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 7 with 76 rules applied. Total rules applied 373 place count 242 transition count 493
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 374 place count 241 transition count 491
Iterating global reduction 7 with 1 rules applied. Total rules applied 375 place count 241 transition count 491
Performed 44 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 7 with 88 rules applied. Total rules applied 463 place count 197 transition count 585
Applied a total of 463 rules in 177 ms. Remains 197 /432 variables (removed 235) and now considering 585/826 (removed 241) transitions.
[2026-05-27 06:05:20] [INFO ] Flow matrix only has 559 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17473067025856126936.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1474463389452646279.kers'
[2026-05-27 06:05:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17473067025856126936.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1474463389452646279.kers]
Normalized transition count is 558 out of 559 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 558 rows 197 cols 2194 entries
Finished phase 1 with 187 SingleSign rule and 0 generalized
[2026-05-27 06:05:20] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1474463389452646279.kers
Total runtime 6 ms.
[2026-05-27 06:05:21] [INFO ] Implicit Places using invariants in 353 ms returned []
[2026-05-27 06:05:21] [INFO ] Flow matrix only has 559 transitions (discarded 26 similar events)
[2026-05-27 06:05:21] [INFO ] Invariant cache hit.
[2026-05-27 06:05:21] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-27 06:05:21] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1223 ms to find 0 implicit places.
[2026-05-27 06:05:21] [INFO ] Redundant transitions in 7 ms returned []
Running 576 sub problems to find dead transitions.
[2026-05-27 06:05:21] [INFO ] Flow matrix only has 559 transitions (discarded 26 similar events)
[2026-05-27 06:05:21] [INFO ] Invariant cache hit.
[2026-05-27 06:05:21] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 197/756 variables, and 20 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/197 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 576 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (OVERLAPS) 558/755 variables, 197/217 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/755 variables, 12/229 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/755 variables, 576/805 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 755/756 variables, and 805 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60266ms problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 60267ms
Starting structural reductions in SI_LTL mode, iteration 1 : 197/432 places, 585/826 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61683 ms. Remains : 197/432 places, 585/826 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||G(p1)))))'
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 73 ms.
Product exploration explored 100000 steps with 3 reset in 127 ms.
Computed a total of 31 stabilizing places and 56 stable transitions
Computed a total of 31 stabilizing places and 56 stable transitions
Knowledge based reduction with 9 factoid took 74 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 (1465 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (255 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (260 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (258 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (257 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 136561 steps, run visited all 4 properties in 1036 ms. (steps per millisecond=131 )
Probabilistic random walk after 136561 steps, saw 49309 distinct states, run finished after 1036 ms. (steps per millisecond=131 ) properties seen :4
Knowledge based reduction with 9 factoid took 88 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 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1421 ms.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 585/585 transitions.
Applied a total of 0 rules in 6 ms. Remains 197 /197 variables (removed 0) and now considering 585/585 (removed 0) transitions.
[2026-05-27 06:06:23] [INFO ] Flow matrix only has 559 transitions (discarded 26 similar events)
[2026-05-27 06:06:23] [INFO ] Invariant cache hit.
[2026-05-27 06:06:24] [INFO ] Implicit Places using invariants in 229 ms returned []
[2026-05-27 06:06:24] [INFO ] Flow matrix only has 559 transitions (discarded 26 similar events)
[2026-05-27 06:06:24] [INFO ] Invariant cache hit.
[2026-05-27 06:06:24] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-27 06:06:25] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
[2026-05-27 06:06:25] [INFO ] Redundant transitions in 11 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1034 ms. Remains : 197/197 places, 585/585 transitions.
Computed a total of 31 stabilizing places and 56 stable transitions
Computed a total of 31 stabilizing places and 56 stable transitions
Knowledge based reduction with 9 factoid took 71 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 (1465 resets) in 210 ms. (189 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (254 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
[2026-05-27 06:06:25] [INFO ] Flow matrix only has 559 transitions (discarded 26 similar events)
[2026-05-27 06:06:25] [INFO ] Invariant cache hit.
[2026-05-27 06:06:25] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/185 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/743 variables, 185/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/743 variables, 12/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/743 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/755 variables, 12/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/755 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/755 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 755/756 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/12 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/185 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/743 variables, 185/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/743 variables, 12/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/743 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/743 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/755 variables, 12/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/755 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/755 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 755/756 variables, and 220 constraints, problems are : Problem set: 0 solved, 1 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 949ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 585/585 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 197 transition count 582
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 197 transition count 581
Free-agglomeration rule applied 21 times.
Iterating global reduction 1 with 21 rules applied. Total rules applied 25 place count 197 transition count 560
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 55 place count 176 transition count 551
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 61 place count 170 transition count 545
Iterating global reduction 2 with 6 rules applied. Total rules applied 67 place count 170 transition count 545
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 76 place count 170 transition count 536
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 94 place count 170 transition count 518
Applied a total of 94 rules in 48 ms. Remains 170 /197 variables (removed 27) and now considering 518/585 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 170/197 places, 518/585 transitions.
RANDOM walk for 29976 steps (1081 resets) in 144 ms. (206 steps per ms) remains 0/1 properties
Knowledge based reduction with 9 factoid took 136 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 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1465 ms.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8 reset in 93 ms.
Product exploration explored 100000 steps with 1 reset in 109 ms.
Built C files in :
/tmp/ltsmin8261948641828906460
[2026-05-27 06:06:26] [INFO ] Computing symmetric may disable matrix : 585 transitions.
[2026-05-27 06:06:26] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 06:06:26] [INFO ] Computing symmetric may enable matrix : 585 transitions.
[2026-05-27 06:06:26] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 06:06:27] [INFO ] Computing Do-Not-Accords matrix : 585 transitions.
[2026-05-27 06:06:27] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 06:06:27] [INFO ] Built C files in 154ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8261948641828906460
Running compilation step : cd /tmp/ltsmin8261948641828906460;'/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 2474 ms.
Running link step : cd /tmp/ltsmin8261948641828906460;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin8261948641828906460;'/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/stateBased6208979067637580162.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 585/585 transitions.
Applied a total of 0 rules in 6 ms. Remains 197 /197 variables (removed 0) and now considering 585/585 (removed 0) transitions.
[2026-05-27 06:06:41] [INFO ] Flow matrix only has 559 transitions (discarded 26 similar events)
[2026-05-27 06:06:41] [INFO ] Invariant cache hit.
[2026-05-27 06:06:42] [INFO ] Implicit Places using invariants in 228 ms returned []
[2026-05-27 06:06:42] [INFO ] Flow matrix only has 559 transitions (discarded 26 similar events)
[2026-05-27 06:06:42] [INFO ] Invariant cache hit.
[2026-05-27 06:06:42] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-27 06:06:43] [INFO ] Implicit Places using invariants and state equation in 1060 ms returned []
Implicit Place search using SMT with State Equation took 1290 ms to find 0 implicit places.
[2026-05-27 06:06:43] [INFO ] Redundant transitions in 10 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1313 ms. Remains : 197/197 places, 585/585 transitions.
Built C files in :
/tmp/ltsmin16010064880551583244
[2026-05-27 06:06:43] [INFO ] Computing symmetric may disable matrix : 585 transitions.
[2026-05-27 06:06:43] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 06:06:43] [INFO ] Computing symmetric may enable matrix : 585 transitions.
[2026-05-27 06:06:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 06:06:43] [INFO ] Computing Do-Not-Accords matrix : 585 transitions.
[2026-05-27 06:06:43] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 06:06:43] [INFO ] Built C files in 129ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16010064880551583244
Running compilation step : cd /tmp/ltsmin16010064880551583244;'/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 2530 ms.
Running link step : cd /tmp/ltsmin16010064880551583244;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin16010064880551583244;'/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/stateBased18257937326926962010.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 06:06:58] [INFO ] Flatten gal took : 18 ms
[2026-05-27 06:06:58] [INFO ] Flatten gal took : 17 ms
[2026-05-27 06:06:58] [INFO ] Time to serialize gal into /tmp/LTL9257929330118689244.gal : 6 ms
[2026-05-27 06:06:58] [INFO ] Time to serialize properties into /tmp/LTL17866127404273452619.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/LTL9257929330118689244.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14799527712787390396.hoa' '-atoms' '/tmp/LTL17866127404273452619.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...319
Loading property file /tmp/LTL17866127404273452619.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14799527712787390396.hoa
Detected timeout of ITS tools.
[2026-05-27 06:07:13] [INFO ] Flatten gal took : 16 ms
[2026-05-27 06:07:13] [INFO ] Flatten gal took : 17 ms
[2026-05-27 06:07:13] [INFO ] Time to serialize gal into /tmp/LTL15038744391968310505.gal : 3 ms
[2026-05-27 06:07:13] [INFO ] Time to serialize properties into /tmp/LTL10944894560798920885.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/LTL15038744391968310505.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10944894560798920885.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p117==0)")||(G("((p47==1)||(p117==0))"))))))
Formula 0 simplified : G(F!"((p47==1)||(p117==0))" & FG!"(p117==0)")
Detected timeout of ITS tools.
[2026-05-27 06:07:28] [INFO ] Flatten gal took : 16 ms
[2026-05-27 06:07:28] [INFO ] Applying decomposition
[2026-05-27 06:07:28] [INFO ] Flatten gal took : 15 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/graph2010518264380505240.txt' '-o' '/tmp/graph2010518264380505240.bin' '-w' '/tmp/graph2010518264380505240.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2010518264380505240.bin' '-l' '-1' '-v' '-w' '/tmp/graph2010518264380505240.weights' '-q' '0' '-e' '0.001'
[2026-05-27 06:07:28] [INFO ] Decomposing Gal with order
[2026-05-27 06:07:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 06:07:28] [INFO ] Removed a total of 879 redundant transitions.
[2026-05-27 06:07:28] [INFO ] Flatten gal took : 43 ms
[2026-05-27 06:07:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 18 ms.
[2026-05-27 06:07:28] [INFO ] Time to serialize gal into /tmp/LTL7535716541718211283.gal : 4 ms
[2026-05-27 06:07:28] [INFO ] Time to serialize properties into /tmp/LTL10158188656223478885.ltl : 1 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/LTL7535716541718211283.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10158188656223478885.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(("(i5.i1.u22.p117==0)")||(G("((i2.u5.p47==1)||(i5.i1.u22.p117==0))"))))))
Formula 0 simplified : G(F!"((i2.u5.p47==1)||(i5.i1.u22.p117==0))" & FG!"(i5.i1.u22.p117==0)")
Detected timeout of ITS tools.
Treatment of property FireWire-PT-20-LTLFireability-14 finished in 143193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 826/826 transitions.
Graph (trivial) has 300 edges and 432 vertex of which 11 / 432 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 423 transition count 763
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 59 rules applied. Total rules applied 113 place count 370 transition count 757
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 117 place count 367 transition count 756
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 118 place count 366 transition count 756
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 118 place count 366 transition count 721
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 188 place count 331 transition count 721
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 200 place count 319 transition count 613
Iterating global reduction 4 with 12 rules applied. Total rules applied 212 place count 319 transition count 613
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 214 place count 319 transition count 611
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 214 place count 319 transition count 608
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 220 place count 316 transition count 608
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 224 place count 312 transition count 602
Iterating global reduction 5 with 4 rules applied. Total rules applied 228 place count 312 transition count 602
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 230 place count 312 transition count 600
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 231 place count 311 transition count 600
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 233 place count 309 transition count 595
Iterating global reduction 7 with 2 rules applied. Total rules applied 235 place count 309 transition count 595
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 237 place count 307 transition count 590
Iterating global reduction 7 with 2 rules applied. Total rules applied 239 place count 307 transition count 590
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 241 place count 305 transition count 585
Iterating global reduction 7 with 2 rules applied. Total rules applied 243 place count 305 transition count 585
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 245 place count 303 transition count 580
Iterating global reduction 7 with 2 rules applied. Total rules applied 247 place count 303 transition count 580
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 249 place count 301 transition count 576
Iterating global reduction 7 with 2 rules applied. Total rules applied 251 place count 301 transition count 576
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 253 place count 299 transition count 571
Iterating global reduction 7 with 2 rules applied. Total rules applied 255 place count 299 transition count 571
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 256 place count 298 transition count 569
Iterating global reduction 7 with 1 rules applied. Total rules applied 257 place count 298 transition count 569
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 258 place count 297 transition count 566
Iterating global reduction 7 with 1 rules applied. Total rules applied 259 place count 297 transition count 566
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 260 place count 296 transition count 564
Iterating global reduction 7 with 1 rules applied. Total rules applied 261 place count 296 transition count 564
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 262 place count 295 transition count 561
Iterating global reduction 7 with 1 rules applied. Total rules applied 263 place count 295 transition count 561
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 264 place count 294 transition count 559
Iterating global reduction 7 with 1 rules applied. Total rules applied 265 place count 294 transition count 559
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 266 place count 293 transition count 557
Iterating global reduction 7 with 1 rules applied. Total rules applied 267 place count 293 transition count 557
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 268 place count 292 transition count 555
Iterating global reduction 7 with 1 rules applied. Total rules applied 269 place count 292 transition count 555
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 347 place count 253 transition count 516
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 348 place count 252 transition count 514
Iterating global reduction 7 with 1 rules applied. Total rules applied 349 place count 252 transition count 514
Performed 44 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 7 with 88 rules applied. Total rules applied 437 place count 208 transition count 611
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 440 place count 208 transition count 608
Applied a total of 440 rules in 113 ms. Remains 208 /432 variables (removed 224) and now considering 608/826 (removed 218) transitions.
[2026-05-27 06:07:43] [INFO ] Flow matrix only has 579 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5116200462118439814.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4913336636692830177.kers'
[2026-05-27 06:07:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5116200462118439814.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4913336636692830177.kers]
Normalized transition count is 578 out of 579 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 578 rows 208 cols 2244 entries
Finished phase 1 with 198 SingleSign rule and 0 generalized
[2026-05-27 06:07:43] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4913336636692830177.kers
Total runtime 4 ms.
[2026-05-27 06:07:44] [INFO ] Implicit Places using invariants in 347 ms returned []
[2026-05-27 06:07:44] [INFO ] Flow matrix only has 579 transitions (discarded 29 similar events)
[2026-05-27 06:07:44] [INFO ] Invariant cache hit.
[2026-05-27 06:07:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-27 06:07:44] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
[2026-05-27 06:07:44] [INFO ] Redundant transitions in 7 ms returned []
Running 603 sub problems to find dead transitions.
[2026-05-27 06:07:44] [INFO ] Flow matrix only has 579 transitions (discarded 29 similar events)
[2026-05-27 06:07:44] [INFO ] Invariant cache hit.
[2026-05-27 06:07:44] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (OVERLAPS) 1/208 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 208/787 variables, and 19 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/208 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 6 (OVERLAPS) 578/786 variables, 208/227 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 12/239 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 603/842 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 786/787 variables, and 842 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60426ms problems are : Problem set: 0 solved, 603 unsolved
Search for dead transitions found 0 dead transitions in 60427ms
Starting structural reductions in SI_LTL mode, iteration 1 : 208/432 places, 608/826 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61489 ms. Remains : 208/432 places, 608/826 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-15 finished in 61579 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&&G(p1)&&F(p2)))))'
Spot run failed in 54 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' '!(G((X((X(X(!p0)) U ((X(X(!p0))&&(p1 U (p2||G(p1))))||X(X(G(!p0)))))) U (!p0 U (p3||G(!p0))))))'
Spot run failed in 77 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' '!(G(F((p0||G(p1)))))'
Spot run failed in 76 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-27 06:08:45] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2092548589965013087
[2026-05-27 06:08:45] [INFO ] Computing symmetric may disable matrix : 826 transitions.
[2026-05-27 06:08:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 06:08:45] [INFO ] Applying decomposition
[2026-05-27 06:08:45] [INFO ] Computing symmetric may enable matrix : 826 transitions.
[2026-05-27 06:08:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 06:08:45] [INFO ] Flatten gal took : 28 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/graph13934991721185409797.txt' '-o' '/tmp/graph13934991721185409797.bin' '-w' '/tmp/graph13934991721185409797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13934991721185409797.bin' '-l' '-1' '-v' '-w' '/tmp/graph13934991721185409797.weights' '-q' '0' '-e' '0.001'
[2026-05-27 06:08:45] [INFO ] Decomposing Gal with order
[2026-05-27 06:08:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 06:08:45] [INFO ] Computing Do-Not-Accords matrix : 826 transitions.
[2026-05-27 06:08:45] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 06:08:45] [INFO ] Removed a total of 1011 redundant transitions.
[2026-05-27 06:08:45] [INFO ] Built C files in 249ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2092548589965013087
Running compilation step : cd /tmp/ltsmin2092548589965013087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' '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-27 06:08:45] [INFO ] Flatten gal took : 68 ms
[2026-05-27 06:08:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 21 ms.
[2026-05-27 06:08:46] [INFO ] Time to serialize gal into /tmp/LTLFireability12724031409565730903.gal : 9 ms
[2026-05-27 06:08:46] [INFO ] Time to serialize properties into /tmp/LTLFireability5108907336043852171.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/LTLFireability12724031409565730903.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5108907336043852171.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 3 LTL properties
Checking formula 0 : !((X(X((("(i12.u129.p533==0)")&&(G("(i13.u134.p498==0)")))&&(F("((i12.u4.p12==0)||(i12.u84.p347==0))"))))))
Formula 0 simplified : XX(!"(i12.u129.p533==0)" | F!"(i13.u134.p498==0)" | G!"((i12.u4.p12==0)||(i12.u84.p347==0))")
Compilation finished in 3524 ms.
Running link step : cd /tmp/ltsmin2092548589965013087;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin2092548589965013087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(((LTLAPp0==true)&&[]((LTLAPp1==true))&&<>((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2092548589965013087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(((LTLAPp0==true)&&[]((LTLAPp1==true))&&<>((LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2092548589965013087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((X((X(X(!(LTLAPp3==true))) U ((X(X(!(LTLAPp3==true)))&&((LTLAPp4==true) U ((LTLAPp5==true)||[]((LTLAPp4==true)))))||X(X([](!(LTLAPp3==true))))))) U (!(LTLAPp3==true) U ((LTLAPp6==true)||[](!(LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2092548589965013087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((X((X(X(!(LTLAPp3==true))) U ((X(X(!(LTLAPp3==true)))&&((LTLAPp4==true) U ((LTLAPp5==true)||[]((LTLAPp4==true)))))||X(X([](!(LTLAPp3==true))))))) U (!(LTLAPp3==true) U ((LTLAPp6==true)||[](!(LTLAPp3==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2092548589965013087;'/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' '[](<>(((LTLAPp7==true)||[]((LTLAPp8==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2092548589965013087;'/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' '[](<>(((LTLAPp7==true)||[]((LTLAPp8==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin2092548589965013087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(((LTLAPp0==true)&&[]((LTLAPp1==true))&&<>((LTLAPp2==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-27 06:35:19] [INFO ] Applying decomposition
[2026-05-27 06:35:20] [INFO ] Flatten gal took : 418 ms
[2026-05-27 06:35:20] [INFO ] Decomposing Gal with order
[2026-05-27 06:35:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 06:35:21] [INFO ] Removed a total of 773 redundant transitions.
[2026-05-27 06:35:21] [INFO ] Flatten gal took : 989 ms
[2026-05-27 06:35:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 602 labels/synchronizations in 114 ms.
[2026-05-27 06:35:22] [INFO ] Time to serialize gal into /tmp/LTLFireability15322872391729565274.gal : 45 ms
[2026-05-27 06:35:22] [INFO ] Time to serialize properties into /tmp/LTLFireability17837806459050831140.ltl : 12 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/LTLFireability15322872391729565274.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17837806459050831140.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...278
Read 3 LTL properties
Checking formula 0 : !((X(X((("(i1.i1.u24.p533==0)")&&(G("(i1.i1.u24.p498==0)")))&&(F("((u1.p12==0)||(i1.i0.i1.u17.p347==0))"))))))
Formula 0 simplified : XX(!"(i1.i1.u24.p533==0)" | F!"(i1.i1.u24.p498==0)" | G!"((u1.p12==0)||(i1.i0.i1.u17.p347==0))")

BK_TIME_CONFINEMENT_REACHED

--------------------
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="FireWire-PT-20"
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 FireWire-PT-20, 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 r130-smll-177955809000300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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