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.r194-tall-177969914000332.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 NoC3x3-PT-5B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914000332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 968K
-rw-r--r-- 1 mcc users 6.8K Mar 8 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 8 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 8 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 8 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 16 08:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 16 08:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 16 08:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 8 06:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Mar 8 06:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 8 06:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 8 06:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:15 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 525K 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 NoC3x3-PT-5B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779755995823

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 00:39:56] [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-26 00:39:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 00:39:57] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2026-05-26 00:39:57] [INFO ] Transformed 1571 places.
[2026-05-26 00:39:57] [INFO ] Transformed 2173 transitions.
[2026-05-26 00:39:57] [INFO ] Found NUPN structural information;
[2026-05-26 00:39:57] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA NoC3x3-PT-5B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 1571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Discarding 431 places :
Symmetric choice reduction at 0 with 431 rule applications. Total rules 431 place count 1140 transition count 1742
Iterating global reduction 0 with 431 rules applied. Total rules applied 862 place count 1140 transition count 1742
Discarding 116 places :
Symmetric choice reduction at 0 with 116 rule applications. Total rules 978 place count 1024 transition count 1619
Iterating global reduction 0 with 116 rules applied. Total rules applied 1094 place count 1024 transition count 1619
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 1183 place count 935 transition count 1471
Iterating global reduction 0 with 89 rules applied. Total rules applied 1272 place count 935 transition count 1471
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 1289 place count 918 transition count 1437
Iterating global reduction 0 with 17 rules applied. Total rules applied 1306 place count 918 transition count 1437
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 1310 place count 914 transition count 1429
Iterating global reduction 0 with 4 rules applied. Total rules applied 1314 place count 914 transition count 1429
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 1318 place count 910 transition count 1425
Iterating global reduction 0 with 4 rules applied. Total rules applied 1322 place count 910 transition count 1425
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1325 place count 907 transition count 1419
Iterating global reduction 0 with 3 rules applied. Total rules applied 1328 place count 907 transition count 1419
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1331 place count 904 transition count 1410
Iterating global reduction 0 with 3 rules applied. Total rules applied 1334 place count 904 transition count 1410
Applied a total of 1334 rules in 440 ms. Remains 904 /1571 variables (removed 667) and now considering 1410/2173 (removed 763) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2767156072976132788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10816713473041006715.kers'
[2026-05-26 00:39:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2767156072976132788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10816713473041006715.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1410 rows 904 cols 4233 entries
Finished phase 1 with 838 SingleSign rule and 0 generalized
[2026-05-26 00:39:57] [INFO ] Computed 66 invariants in 9 ms
Computed 66 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-10816713473041006715.kers
Total runtime 11 ms.
[2026-05-26 00:39:58] [INFO ] Implicit Places using invariants in 690 ms returned []
[2026-05-26 00:39:58] [INFO ] Invariant cache hit.
[2026-05-26 00:39:59] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1700 ms to find 0 implicit places.
Running 1409 sub problems to find dead transitions.
[2026-05-26 00:39:59] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2314 variables, and 0 constraints, problems are : Problem set: 0 solved, 1409 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/904 constraints, PredecessorRefiner: 1409/1409 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1409 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 903/2314 variables, and 0 constraints, problems are : Problem set: 0 solved, 1409 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/904 constraints, PredecessorRefiner: 0/1409 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60491ms problems are : Problem set: 0 solved, 1409 unsolved
Search for dead transitions found 0 dead transitions in 60512ms
Starting structural reductions in LTL mode, iteration 1 : 904/1571 places, 1410/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62687 ms. Remains : 904/1571 places, 1410/2173 transitions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1410/1410 transitions.
Applied a total of 0 rules in 20 ms. Remains 904 /904 variables (removed 0) and now considering 1410/1410 (removed 0) transitions.
[2026-05-26 00:41:00] [INFO ] Invariant cache hit.
[2026-05-26 00:41:00] [INFO ] Implicit Places using invariants in 427 ms returned []
[2026-05-26 00:41:00] [INFO ] Invariant cache hit.
[2026-05-26 00:41:01] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1335 ms. Remains : 904/904 places, 1410/1410 transitions.
Support contains 43 out of 904 places after structural reductions.
[2026-05-26 00:41:01] [INFO ] Flatten gal took : 118 ms
[2026-05-26 00:41:01] [INFO ] Flatten gal took : 75 ms
[2026-05-26 00:41:02] [INFO ] Input system was already deterministic with 1410 transitions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 40000 steps (64 resets) in 1967 ms. (20 steps per ms) remains 5/33 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
[2026-05-26 00:41:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 141/147 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 757/904 variables, 60/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/904 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1410/2314 variables, 904/970 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2314 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/2314 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2314/2314 variables, and 970 constraints, problems are : Problem set: 0 solved, 5 unsolved in 937 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 904/904 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 141/147 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 757/904 variables, 60/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/904 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1410/2314 variables, 904/970 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2314 variables, 5/975 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2314 variables, 5/980 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2314 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/2314 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2314/2314 variables, and 980 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3508 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 904/904 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4457ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 934 ms.
Support contains 6 out of 904 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 904/904 places, 1410/1410 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1339
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 833 transition count 1339
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 142 place count 833 transition count 1305
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 210 place count 799 transition count 1305
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 243 place count 766 transition count 1194
Iterating global reduction 2 with 33 rules applied. Total rules applied 276 place count 766 transition count 1194
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 280 place count 762 transition count 1187
Iterating global reduction 2 with 4 rules applied. Total rules applied 284 place count 762 transition count 1187
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 2 with 1 rules applied. Total rules applied 285 place count 762 transition count 1186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 286 place count 761 transition count 1186
Performed 192 Post agglomeration using F-continuation condition.Transition count delta: 192
Deduced a syphon composed of 192 places in 1 ms
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 4 with 384 rules applied. Total rules applied 670 place count 569 transition count 994
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 673 place count 569 transition count 991
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 676 place count 566 transition count 985
Iterating global reduction 5 with 3 rules applied. Total rules applied 679 place count 566 transition count 985
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 682 place count 563 transition count 979
Iterating global reduction 5 with 3 rules applied. Total rules applied 685 place count 563 transition count 979
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 686 place count 562 transition count 977
Iterating global reduction 5 with 1 rules applied. Total rules applied 687 place count 562 transition count 977
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 688 place count 561 transition count 974
Iterating global reduction 5 with 1 rules applied. Total rules applied 689 place count 561 transition count 974
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 690 place count 561 transition count 973
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 892 place count 460 transition count 1002
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 904 place count 460 transition count 990
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 72 rules applied. Total rules applied 976 place count 424 transition count 998
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 978 place count 424 transition count 996
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 8 with 61 rules applied. Total rules applied 1039 place count 424 transition count 935
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1048 place count 415 transition count 935
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 5 Pre rules applied. Total rules applied 1048 place count 415 transition count 930
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1058 place count 410 transition count 930
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 1094 place count 392 transition count 912
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 9 with 2 rules applied. Total rules applied 1096 place count 391 transition count 912
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1102 place count 391 transition count 912
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1103 place count 390 transition count 911
Applied a total of 1103 rules in 419 ms. Remains 390 /904 variables (removed 514) and now considering 911/1410 (removed 499) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 420 ms. Remains : 390/904 places, 911/1410 transitions.
RANDOM walk for 40000 steps (187 resets) in 499 ms. (80 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6997859419720125378.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4045444589440255859.kers'
[2026-05-26 00:41:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6997859419720125378.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4045444589440255859.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 911 rows 390 cols 3501 entries
Finished phase 1 with 317 SingleSign rule and 16 generalized
[2026-05-26 00:41:08] [INFO ] Computed 57 invariants in 3 ms
Computed 57 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4045444589440255859.kers
Total runtime 4 ms.
[2026-05-26 00:41:08] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 341/372 variables, 51/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 910/1282 variables, 372/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1282 variables, 36/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1282 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 19/1301 variables, 18/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1301 variables, 3/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1301 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1301 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1301/1301 variables, and 483 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 390/390 constraints, ReadFeed: 36/36 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 341/372 variables, 51/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 910/1282 variables, 372/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1282 variables, 36/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1282 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1282 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 19/1301 variables, 18/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1301 variables, 3/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1301 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1301 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1301/1301 variables, and 484 constraints, problems are : Problem set: 0 solved, 1 unsolved in 398 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 390/390 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 673ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 3 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 911/911 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 388 transition count 909
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 388 transition count 908
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 387 transition count 908
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 386 transition count 907
Applied a total of 7 rules in 43 ms. Remains 386 /390 variables (removed 4) and now considering 907/911 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 386/390 places, 907/911 transitions.
RANDOM walk for 40000 steps (194 resets) in 228 ms. (174 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 373325 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 1
Probabilistic random walk after 373325 steps, saw 93198 distinct states, run finished after 3006 ms. (steps per millisecond=124 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15509035482654720082.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13915709555970740209.kers'
[2026-05-26 00:41:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15509035482654720082.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13915709555970740209.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 907 rows 386 cols 3440 entries
Finished phase 1 with 313 SingleSign rule and 16 generalized
[2026-05-26 00:41:12] [INFO ] Computed 57 invariants in 8 ms
Computed 57 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-13915709555970740209.kers
Total runtime 9 ms.
[2026-05-26 00:41:12] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 111/141 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 239/380 variables, 30/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/404 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 291/695 variables, 85/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/695 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/695 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/695 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 32/727 variables, 10/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/727 variables, 26/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/727 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 272/999 variables, 46/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/999 variables, 10/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/999 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 31/1030 variables, 12/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1030 variables, 31/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1030 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 179/1209 variables, 72/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1209 variables, 6/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1209 variables, 9/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1209 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 18/1227 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1227 variables, 12/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1227 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 54/1281 variables, 22/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1281 variables, 8/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1281 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 5/1286 variables, 4/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1286 variables, 5/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1286 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 7/1293 variables, 7/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1293 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1293 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 0/1293 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1293/1293 variables, and 479 constraints, problems are : Problem set: 0 solved, 1 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 386/386 constraints, ReadFeed: 36/36 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 111/141 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 239/380 variables, 30/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/404 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 291/695 variables, 85/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/695 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/695 variables, 7/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/695 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 32/727 variables, 10/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/727 variables, 26/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/727 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 272/999 variables, 46/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/999 variables, 10/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/999 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 31/1030 variables, 12/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1030 variables, 31/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1030 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 179/1209 variables, 72/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1209 variables, 6/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1209 variables, 9/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1209 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 18/1227 variables, 8/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1227 variables, 12/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1227 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 54/1281 variables, 22/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1281 variables, 8/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1281 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 5/1286 variables, 4/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1286 variables, 5/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1286 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 7/1293 variables, 7/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1293 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1293 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 0/1293 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1293/1293 variables, and 480 constraints, problems are : Problem set: 0 solved, 1 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 386/386 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1071ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 3 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 907/907 transitions.
Applied a total of 0 rules in 11 ms. Remains 386 /386 variables (removed 0) and now considering 907/907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 386/386 places, 907/907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 907/907 transitions.
Applied a total of 0 rules in 10 ms. Remains 386 /386 variables (removed 0) and now considering 907/907 (removed 0) transitions.
[2026-05-26 00:41:13] [INFO ] Invariant cache hit.
[2026-05-26 00:41:13] [INFO ] Implicit Places using invariants in 159 ms returned []
[2026-05-26 00:41:13] [INFO ] Invariant cache hit.
[2026-05-26 00:41:14] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-26 00:41:14] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2026-05-26 00:41:14] [INFO ] Redundant transitions in 55 ms returned []
Running 852 sub problems to find dead transitions.
[2026-05-26 00:41:14] [INFO ] Invariant cache hit.
[2026-05-26 00:41:14] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/1293 variables, and 83 constraints, problems are : Problem set: 0 solved, 852 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/386 constraints, ReadFeed: 0/36 constraints, PredecessorRefiner: 852/852 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 852 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 26/83 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 4 (OVERLAPS) 907/1293 variables, 386/470 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1293 variables, 36/506 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1293 variables, 852/1358 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1293/1293 variables, and 1358 constraints, problems are : Problem set: 0 solved, 852 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 386/386 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 852/852 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60194ms problems are : Problem set: 0 solved, 852 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60885 ms. Remains : 386/386 places, 907/907 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 386 transition count 883
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 384 transition count 877
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 384 transition count 877
Applied a total of 28 rules in 24 ms. Remains 384 /386 variables (removed 2) and now considering 877/907 (removed 30) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14681944567769287412.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10615458474826080208.kers'
[2026-05-26 00:42:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14681944567769287412.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10615458474826080208.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 877 rows 384 cols 3340 entries
Finished phase 1 with 311 SingleSign rule and 16 generalized
[2026-05-26 00:42:14] [INFO ] Computed 57 invariants in 3 ms
Computed 57 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10615458474826080208.kers
Total runtime 5 ms.
[2026-05-26 00:42:14] [INFO ] [Real]Absence check using 57 positive place invariants in 8 ms returned sat
[2026-05-26 00:42:14] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 00:42:15] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2026-05-26 00:42:15] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 00:42:15] [INFO ] After 225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 00:42:15] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 636 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 65 stabilizing places and 65 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' '!(F(G(p0)))'
Support contains 1 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 903 transition count 1337
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 831 transition count 1337
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 144 place count 831 transition count 1302
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 214 place count 796 transition count 1302
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 249 place count 761 transition count 1187
Iterating global reduction 2 with 35 rules applied. Total rules applied 284 place count 761 transition count 1187
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 288 place count 757 transition count 1180
Iterating global reduction 2 with 4 rules applied. Total rules applied 292 place count 757 transition count 1180
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 2 with 1 rules applied. Total rules applied 293 place count 757 transition count 1179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 294 place count 756 transition count 1179
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 295 place count 755 transition count 1177
Iterating global reduction 4 with 1 rules applied. Total rules applied 296 place count 755 transition count 1177
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 297 place count 754 transition count 1175
Iterating global reduction 4 with 1 rules applied. Total rules applied 298 place count 754 transition count 1175
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 193
Deduced a syphon composed of 193 places in 0 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 4 with 386 rules applied. Total rules applied 684 place count 561 transition count 982
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 687 place count 561 transition count 979
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 690 place count 558 transition count 973
Iterating global reduction 5 with 3 rules applied. Total rules applied 693 place count 558 transition count 973
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 696 place count 555 transition count 967
Iterating global reduction 5 with 3 rules applied. Total rules applied 699 place count 555 transition count 967
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 700 place count 554 transition count 965
Iterating global reduction 5 with 1 rules applied. Total rules applied 701 place count 554 transition count 965
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 702 place count 553 transition count 962
Iterating global reduction 5 with 1 rules applied. Total rules applied 703 place count 553 transition count 962
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 704 place count 553 transition count 961
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 906 place count 452 transition count 989
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 920 place count 452 transition count 975
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 72 rules applied. Total rules applied 992 place count 416 transition count 983
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 7 with 62 rules applied. Total rules applied 1054 place count 416 transition count 921
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1063 place count 407 transition count 921
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 5 Pre rules applied. Total rules applied 1063 place count 407 transition count 916
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1073 place count 402 transition count 916
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 1111 place count 383 transition count 897
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1112 place count 382 transition count 896
Applied a total of 1112 rules in 250 ms. Remains 382 /904 variables (removed 522) and now considering 896/1410 (removed 514) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-700928116688233225.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13916290782506725482.kers'
[2026-05-26 00:42:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-700928116688233225.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13916290782506725482.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 896 rows 382 cols 3400 entries
Finished phase 1 with 308 SingleSign rule and 17 generalized
[2026-05-26 00:42:16] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13916290782506725482.kers
Total runtime 5 ms.
[2026-05-26 00:42:16] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-26 00:42:16] [INFO ] Invariant cache hit.
[2026-05-26 00:42:16] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-26 00:42:16] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2026-05-26 00:42:16] [INFO ] Redundant transitions in 12 ms returned []
Running 841 sub problems to find dead transitions.
[2026-05-26 00:42:16] [INFO ] Invariant cache hit.
[2026-05-26 00:42:16] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 841 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 841 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 841 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 841 unsolved
SMT process timed out in 30140ms, After SMT, problems are : Problem set: 0 solved, 841 unsolved
Search for dead transitions found 0 dead transitions in 30152ms
Starting structural reductions in SI_LTL mode, iteration 1 : 382/904 places, 896/1410 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31046 ms. Remains : 382/904 places, 896/1410 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 157 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-00
Product exploration explored 100000 steps with 489 reset in 466 ms.
Product exploration explored 100000 steps with 483 reset in 457 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 67 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 7729 steps (36 resets) in 62 ms. (122 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 55 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 38 ms :[(NOT p0)]
Knowledge-based reduction took 197 ms.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 1 out of 382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 382/382 places, 896/896 transitions.
Applied a total of 0 rules in 17 ms. Remains 382 /382 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2026-05-26 00:42:48] [INFO ] Invariant cache hit.
[2026-05-26 00:42:48] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-26 00:42:48] [INFO ] Invariant cache hit.
[2026-05-26 00:42:48] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-26 00:42:48] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2026-05-26 00:42:48] [INFO ] Redundant transitions in 10 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 650 ms. Remains : 382/382 places, 896/896 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 59 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 12523 steps (58 resets) in 85 ms. (145 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 73 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 36 ms :[(NOT p0)]
Knowledge-based reduction took 230 ms.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 484 reset in 404 ms.
Product exploration explored 100000 steps with 488 reset in 411 ms.
Built C files in :
/tmp/ltsmin14981555172892826203
[2026-05-26 00:42:50] [INFO ] Computing symmetric may disable matrix : 896 transitions.
[2026-05-26 00:42:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:42:50] [INFO ] Computing symmetric may enable matrix : 896 transitions.
[2026-05-26 00:42:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:42:50] [INFO ] Computing Do-Not-Accords matrix : 896 transitions.
[2026-05-26 00:42:50] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:42:50] [INFO ] Built C files in 205ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14981555172892826203
Running compilation step : cd /tmp/ltsmin14981555172892826203;'/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 2589 ms.
Running link step : cd /tmp/ltsmin14981555172892826203;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin14981555172892826203;'/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/stateBased6447317673994545570.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 382/382 places, 896/896 transitions.
Applied a total of 0 rules in 8 ms. Remains 382 /382 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2026-05-26 00:43:05] [INFO ] Invariant cache hit.
[2026-05-26 00:43:05] [INFO ] Implicit Places using invariants in 184 ms returned []
[2026-05-26 00:43:05] [INFO ] Invariant cache hit.
[2026-05-26 00:43:05] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-26 00:43:05] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2026-05-26 00:43:05] [INFO ] Redundant transitions in 12 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 668 ms. Remains : 382/382 places, 896/896 transitions.
Built C files in :
/tmp/ltsmin17235333932795145413
[2026-05-26 00:43:05] [INFO ] Computing symmetric may disable matrix : 896 transitions.
[2026-05-26 00:43:05] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:43:05] [INFO ] Computing symmetric may enable matrix : 896 transitions.
[2026-05-26 00:43:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:43:05] [INFO ] Computing Do-Not-Accords matrix : 896 transitions.
[2026-05-26 00:43:05] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:43:05] [INFO ] Built C files in 176ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17235333932795145413
Running compilation step : cd /tmp/ltsmin17235333932795145413;'/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 2441 ms.
Running link step : cd /tmp/ltsmin17235333932795145413;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin17235333932795145413;'/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/stateBased8056896495264099191.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 00:43:20] [INFO ] Flatten gal took : 60 ms
[2026-05-26 00:43:20] [INFO ] Flatten gal took : 39 ms
[2026-05-26 00:43:20] [INFO ] Time to serialize gal into /tmp/LTL13401062762345387642.gal : 9 ms
[2026-05-26 00:43:20] [INFO ] Time to serialize properties into /tmp/LTL1024315197301667.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13401062762345387642.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14587692244545560079.hoa' '-atoms' '/tmp/LTL1024315197301667.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...316
Loading property file /tmp/LTL1024315197301667.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14587692244545560079.hoa
Detected timeout of ITS tools.
[2026-05-26 00:43:36] [INFO ] Flatten gal took : 34 ms
[2026-05-26 00:43:36] [INFO ] Flatten gal took : 28 ms
[2026-05-26 00:43:36] [INFO ] Time to serialize gal into /tmp/LTL16006938489707454028.gal : 8 ms
[2026-05-26 00:43:36] [INFO ] Time to serialize properties into /tmp/LTL2803911570892180612.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16006938489707454028.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2803911570892180612.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 : !((F(G("(p237==0)"))))
Formula 0 simplified : GF!"(p237==0)"
Detected timeout of ITS tools.
[2026-05-26 00:43:51] [INFO ] Flatten gal took : 23 ms
[2026-05-26 00:43:51] [INFO ] Applying decomposition
[2026-05-26 00:43:51] [INFO ] Flatten gal took : 22 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/graph6376042830801776450.txt' '-o' '/tmp/graph6376042830801776450.bin' '-w' '/tmp/graph6376042830801776450.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6376042830801776450.bin' '-l' '-1' '-v' '-w' '/tmp/graph6376042830801776450.weights' '-q' '0' '-e' '0.001'
[2026-05-26 00:43:51] [INFO ] Decomposing Gal with order
[2026-05-26 00:43:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 00:43:51] [INFO ] Removed a total of 558 redundant transitions.
[2026-05-26 00:43:51] [INFO ] Flatten gal took : 128 ms
[2026-05-26 00:43:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 670 labels/synchronizations in 19 ms.
[2026-05-26 00:43:51] [INFO ] Time to serialize gal into /tmp/LTL6598450976039716684.gal : 7 ms
[2026-05-26 00:43:51] [INFO ] Time to serialize properties into /tmp/LTL13443936257182827803.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/LTL6598450976039716684.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13443936257182827803.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 : !((F(G("(i1.u6.p237==0)"))))
Formula 0 simplified : GF!"(i1.u6.p237==0)"
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-5B-LTLFireability-00 finished in 110863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((G(p1)||(p1&&F(G(p2)))))))'
Support contains 2 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1410/1410 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 890 transition count 1389
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 890 transition count 1389
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 882 transition count 1377
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 882 transition count 1377
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 877 transition count 1368
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 877 transition count 1368
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 873 transition count 1360
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 873 transition count 1360
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 871 transition count 1358
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 871 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 870 transition count 1356
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 870 transition count 1356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 869 transition count 1353
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 869 transition count 1353
Applied a total of 70 rules in 102 ms. Remains 869 /904 variables (removed 35) and now considering 1353/1410 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1956876569318898332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16030026480304032932.kers'
[2026-05-26 00:44:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1956876569318898332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16030026480304032932.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1353 rows 869 cols 4069 entries
Finished phase 1 with 803 SingleSign rule and 0 generalized
[2026-05-26 00:44:06] [INFO ] Computed 66 invariants in 9 ms
Computed 66 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-16030026480304032932.kers
Total runtime 11 ms.
[2026-05-26 00:44:07] [INFO ] Implicit Places using invariants in 412 ms returned []
[2026-05-26 00:44:07] [INFO ] Invariant cache hit.
[2026-05-26 00:44:08] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
Running 1352 sub problems to find dead transitions.
[2026-05-26 00:44:08] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 868/2222 variables, and 0 constraints, problems are : Problem set: 0 solved, 1352 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/869 constraints, PredecessorRefiner: 1352/1352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1352 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 868/2222 variables, and 0 constraints, problems are : Problem set: 0 solved, 1352 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/869 constraints, PredecessorRefiner: 0/1352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60254ms problems are : Problem set: 0 solved, 1352 unsolved
Search for dead transitions found 0 dead transitions in 60262ms
Starting structural reductions in LTL mode, iteration 1 : 869/904 places, 1353/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61658 ms. Remains : 869/904 places, 1353/1410 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((G(p1)||(p1&&F(G(p2)))))))'
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true, (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-01
Product exploration explored 100000 steps with 156 reset in 304 ms.
Product exploration explored 100000 steps with 153 reset in 294 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge based reduction with 5 factoid took 67 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 30667 steps (46 resets) in 164 ms. (185 steps per ms) remains 0/2 properties
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Knowledge-based reduction took 390 ms.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 2 out of 869 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 869/869 places, 1353/1353 transitions.
Applied a total of 0 rules in 19 ms. Remains 869 /869 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2026-05-26 00:45:09] [INFO ] Invariant cache hit.
[2026-05-26 00:45:10] [INFO ] Implicit Places using invariants in 336 ms returned []
[2026-05-26 00:45:10] [INFO ] Invariant cache hit.
[2026-05-26 00:45:10] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1193 ms. Remains : 869/869 places, 1353/1353 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 16007 steps (21 resets) in 63 ms. (250 steps per ms) remains 0/2 properties
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Knowledge-based reduction took 340 ms.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 159 reset in 262 ms.
Product exploration explored 100000 steps with 157 reset in 286 ms.
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/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/ltsmin13580426067867130749
[2026-05-26 00:45:12] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13580426067867130749
Running compilation step : cd /tmp/ltsmin13580426067867130749;'/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 2323 ms.
Running link step : cd /tmp/ltsmin13580426067867130749;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin13580426067867130749;'/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/stateBased382659578849124384.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 869 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 869/869 places, 1353/1353 transitions.
Applied a total of 0 rules in 23 ms. Remains 869 /869 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2026-05-26 00:45:27] [INFO ] Invariant cache hit.
[2026-05-26 00:45:27] [INFO ] Implicit Places using invariants in 339 ms returned []
[2026-05-26 00:45:27] [INFO ] Invariant cache hit.
[2026-05-26 00:45:28] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1217 ms. Remains : 869/869 places, 1353/1353 transitions.
Built C files in :
/tmp/ltsmin16736710925321775097
[2026-05-26 00:45:28] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16736710925321775097
Running compilation step : cd /tmp/ltsmin16736710925321775097;'/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 2319 ms.
Running link step : cd /tmp/ltsmin16736710925321775097;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16736710925321775097;'/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/stateBased9640578049021196630.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 00:45:43] [INFO ] Flatten gal took : 27 ms
[2026-05-26 00:45:43] [INFO ] Flatten gal took : 25 ms
[2026-05-26 00:45:43] [INFO ] Time to serialize gal into /tmp/LTL7599243978572630101.gal : 6 ms
[2026-05-26 00:45:43] [INFO ] Time to serialize properties into /tmp/LTL4847421796667268557.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/LTL7599243978572630101.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9131081461201560334.hoa' '-atoms' '/tmp/LTL4847421796667268557.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/LTL4847421796667268557.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9131081461201560334.hoa
Detected timeout of ITS tools.
[2026-05-26 00:45:58] [INFO ] Flatten gal took : 24 ms
[2026-05-26 00:45:58] [INFO ] Flatten gal took : 24 ms
[2026-05-26 00:45:58] [INFO ] Time to serialize gal into /tmp/LTL16375834697965319676.gal : 8 ms
[2026-05-26 00:45:58] [INFO ] Time to serialize properties into /tmp/LTL7812652331387210463.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/LTL16375834697965319676.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7812652331387210463.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 : !(((F("(p863==0)"))&&(X((G("(p695!=1)"))||(("(p695!=1)")&&(F(G("(p863!=1)"))))))))
Formula 0 simplified : G!"(p863==0)" | X(F!"(p695!=1)" & (!"(p695!=1)" | GF!"(p863!=1)"))
Detected timeout of ITS tools.
[2026-05-26 00:46:13] [INFO ] Flatten gal took : 21 ms
[2026-05-26 00:46:13] [INFO ] Applying decomposition
[2026-05-26 00:46:13] [INFO ] Flatten gal took : 21 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/graph1451579935357590931.txt' '-o' '/tmp/graph1451579935357590931.bin' '-w' '/tmp/graph1451579935357590931.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1451579935357590931.bin' '-l' '-1' '-v' '-w' '/tmp/graph1451579935357590931.weights' '-q' '0' '-e' '0.001'
[2026-05-26 00:46:13] [INFO ] Decomposing Gal with order
[2026-05-26 00:46:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 00:46:14] [INFO ] Removed a total of 1092 redundant transitions.
[2026-05-26 00:46:14] [INFO ] Flatten gal took : 67 ms
[2026-05-26 00:46:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 194 labels/synchronizations in 35 ms.
[2026-05-26 00:46:14] [INFO ] Time to serialize gal into /tmp/LTL9407455908757947377.gal : 12 ms
[2026-05-26 00:46:14] [INFO ] Time to serialize properties into /tmp/LTL3098415889208010390.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/LTL9407455908757947377.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3098415889208010390.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((F("(i7.i0.i2.u159.p863==0)"))&&(X((G("(i5.u142.p695!=1)"))||(("(i5.u142.p695!=1)")&&(F(G("(i7.i0.i2.u159.p863!=1)"))))))))
Formula 0 simplified : G!"(i7.i0.i2.u159.p863==0)" | X(F!"(i5.u142.p695!=1)" & (!"(i5.u142.p695!=1)" | GF!"(i7.i0.i2.u159.p863!=1)"))
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-5B-LTLFireability-01 finished in 142629 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((!p1||X(p2)))&&p0) U (G(p3)||X(p1))))'
Support contains 4 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1410/1410 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 890 transition count 1389
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 890 transition count 1389
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 883 transition count 1379
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 883 transition count 1379
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 879 transition count 1371
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 879 transition count 1371
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 875 transition count 1363
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 875 transition count 1363
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 873 transition count 1361
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 873 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 872 transition count 1359
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 872 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 871 transition count 1356
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 871 transition count 1356
Applied a total of 66 rules in 103 ms. Remains 871 /904 variables (removed 33) and now considering 1356/1410 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14847794328774497544.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5649883905768775432.kers'
[2026-05-26 00:46:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14847794328774497544.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5649883905768775432.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1356 rows 871 cols 4079 entries
Finished phase 1 with 805 SingleSign rule and 0 generalized
[2026-05-26 00:46:29] [INFO ] Computed 66 invariants in 10 ms
Computed 66 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-5649883905768775432.kers
Total runtime 14 ms.
[2026-05-26 00:46:29] [INFO ] Implicit Places using invariants in 383 ms returned []
[2026-05-26 00:46:29] [INFO ] Invariant cache hit.
[2026-05-26 00:46:30] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
Running 1355 sub problems to find dead transitions.
[2026-05-26 00:46:30] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 870/2227 variables, and 0 constraints, problems are : Problem set: 0 solved, 1355 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/871 constraints, PredecessorRefiner: 1355/1355 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1355 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 870/2227 variables, and 0 constraints, problems are : Problem set: 0 solved, 1355 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/871 constraints, PredecessorRefiner: 0/1355 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60269ms problems are : Problem set: 0 solved, 1355 unsolved
Search for dead transitions found 0 dead transitions in 60271ms
Starting structural reductions in LTL mode, iteration 1 : 871/904 places, 1356/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61606 ms. Remains : 871/904 places, 1356/1410 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((!p1||X(p2)))&&p0) U (G(p3)||X(p1))))'
Stuttering acceptance computed with spot in 497 ms :[(AND (NOT p1) (NOT p3)), (NOT p1), false, (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1)), false, (AND (NOT p3) (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (NOT p2), (NOT p3), (AND (NOT p2) p1 (NOT p3)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-04
Entered a terminal (fully accepting) state of product in 4914 steps with 7 reset in 15 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-04 finished in 62182 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(p0)||(p0&&(G(F(p1))||(F(p1)&&F(!p2)))))))))'
Support contains 4 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1410/1410 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 889 transition count 1392
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 889 transition count 1392
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 882 transition count 1382
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 882 transition count 1382
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 877 transition count 1373
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 877 transition count 1373
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 873 transition count 1365
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 873 transition count 1365
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 871 transition count 1363
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 871 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 870 transition count 1361
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 870 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 869 transition count 1358
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 869 transition count 1358
Applied a total of 70 rules in 93 ms. Remains 869 /904 variables (removed 35) and now considering 1358/1410 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7876523706079517546.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13067681878509236255.kers'
[2026-05-26 00:47:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7876523706079517546.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13067681878509236255.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1358 rows 869 cols 4091 entries
Finished phase 1 with 803 SingleSign rule and 0 generalized
[2026-05-26 00:47:31] [INFO ] Computed 66 invariants in 5 ms
Computed 66 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13067681878509236255.kers
Total runtime 9 ms.
[2026-05-26 00:47:31] [INFO ] Implicit Places using invariants in 342 ms returned []
[2026-05-26 00:47:31] [INFO ] Invariant cache hit.
[2026-05-26 00:47:32] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
Running 1357 sub problems to find dead transitions.
[2026-05-26 00:47:32] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 868/2227 variables, and 0 constraints, problems are : Problem set: 0 solved, 1357 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/869 constraints, PredecessorRefiner: 1357/1357 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1357 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 868/2227 variables, and 0 constraints, problems are : Problem set: 0 solved, 1357 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/869 constraints, PredecessorRefiner: 0/1357 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 1357 unsolved
Search for dead transitions found 0 dead transitions in 60264ms
Starting structural reductions in LTL mode, iteration 1 : 869/904 places, 1358/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61530 ms. Remains : 869/904 places, 1358/1410 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(p0)||(p0&&(G(F(p1))||(F(p1)&&F(p2)))))))))'
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 245 ms.
Product exploration explored 100000 steps with 33333 reset in 249 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 11 ms. Proved property starting from automaton with 6 states, 11 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 38 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-5B-LTLFireability-05 finished in 62326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 903 transition count 1337
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 831 transition count 1337
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 144 place count 831 transition count 1303
Deduced a syphon composed of 34 places in 3 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 212 place count 797 transition count 1303
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 247 place count 762 transition count 1192
Iterating global reduction 2 with 35 rules applied. Total rules applied 282 place count 762 transition count 1192
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 287 place count 757 transition count 1183
Iterating global reduction 2 with 5 rules applied. Total rules applied 292 place count 757 transition count 1183
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 2 with 1 rules applied. Total rules applied 293 place count 757 transition count 1182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 294 place count 756 transition count 1182
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 295 place count 755 transition count 1180
Iterating global reduction 4 with 1 rules applied. Total rules applied 296 place count 755 transition count 1180
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 297 place count 754 transition count 1178
Iterating global reduction 4 with 1 rules applied. Total rules applied 298 place count 754 transition count 1178
Performed 191 Post agglomeration using F-continuation condition.Transition count delta: 191
Deduced a syphon composed of 191 places in 0 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 4 with 382 rules applied. Total rules applied 680 place count 563 transition count 987
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 683 place count 563 transition count 984
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 686 place count 560 transition count 978
Iterating global reduction 5 with 3 rules applied. Total rules applied 689 place count 560 transition count 978
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 692 place count 557 transition count 972
Iterating global reduction 5 with 3 rules applied. Total rules applied 695 place count 557 transition count 972
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 696 place count 556 transition count 970
Iterating global reduction 5 with 1 rules applied. Total rules applied 697 place count 556 transition count 970
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 698 place count 555 transition count 967
Iterating global reduction 5 with 1 rules applied. Total rules applied 699 place count 555 transition count 967
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 700 place count 555 transition count 966
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 902 place count 454 transition count 996
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 916 place count 454 transition count 982
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 72 rules applied. Total rules applied 988 place count 418 transition count 990
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 7 with 61 rules applied. Total rules applied 1049 place count 418 transition count 929
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1058 place count 409 transition count 929
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 5 Pre rules applied. Total rules applied 1058 place count 409 transition count 924
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1068 place count 404 transition count 924
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 1104 place count 386 transition count 906
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1106 place count 385 transition count 908
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1107 place count 384 transition count 907
Applied a total of 1107 rules in 183 ms. Remains 384 /904 variables (removed 520) and now considering 907/1410 (removed 503) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7263716129754545906.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12996466144295366906.kers'
[2026-05-26 00:48:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7263716129754545906.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12996466144295366906.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 907 rows 384 cols 3468 entries
Finished phase 1 with 310 SingleSign rule and 17 generalized
[2026-05-26 00:48:33] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12996466144295366906.kers
Total runtime 3 ms.
[2026-05-26 00:48:34] [INFO ] Implicit Places using invariants in 485 ms returned []
[2026-05-26 00:48:34] [INFO ] Invariant cache hit.
[2026-05-26 00:48:34] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-26 00:48:34] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
[2026-05-26 00:48:34] [INFO ] Redundant transitions in 12 ms returned []
Running 885 sub problems to find dead transitions.
[2026-05-26 00:48:34] [INFO ] Invariant cache hit.
[2026-05-26 00:48:34] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 885 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/1291 variables, and 34 constraints, problems are : Problem set: 0 solved, 885 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 28/57 constraints, State Equation: 0/384 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 885/885 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 885 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 3 (OVERLAPS) 1/384 variables, 29/63 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 12/75 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 885 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/1291 variables, and 79 constraints, problems are : Problem set: 0 solved, 885 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/384 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 0/885 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 885 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Starting structural reductions in SI_LTL mode, iteration 1 : 384/904 places, 907/1410 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61348 ms. Remains : 384/904 places, 907/1410 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 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-06
Product exploration explored 100000 steps with 488 reset in 370 ms.
Product exploration explored 100000 steps with 476 reset in 393 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 3 factoid took 50 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 23069 steps (112 resets) in 146 ms. (156 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 236 ms.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 907/907 transitions.
Applied a total of 0 rules in 15 ms. Remains 384 /384 variables (removed 0) and now considering 907/907 (removed 0) transitions.
[2026-05-26 00:49:36] [INFO ] Invariant cache hit.
[2026-05-26 00:49:36] [INFO ] Implicit Places using invariants in 164 ms returned []
[2026-05-26 00:49:36] [INFO ] Invariant cache hit.
[2026-05-26 00:49:36] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-26 00:49:36] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2026-05-26 00:49:36] [INFO ] Redundant transitions in 12 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 646 ms. Remains : 384/384 places, 907/907 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 20312 steps (96 resets) in 115 ms. (175 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 251 ms.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 484 reset in 381 ms.
Product exploration explored 100000 steps with 476 reset in 396 ms.
Built C files in :
/tmp/ltsmin2891479183816201592
[2026-05-26 00:49:38] [INFO ] Computing symmetric may disable matrix : 907 transitions.
[2026-05-26 00:49:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:49:38] [INFO ] Computing symmetric may enable matrix : 907 transitions.
[2026-05-26 00:49:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:49:38] [INFO ] Computing Do-Not-Accords matrix : 907 transitions.
[2026-05-26 00:49:38] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:49:38] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2891479183816201592
Running compilation step : cd /tmp/ltsmin2891479183816201592;'/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 2534 ms.
Running link step : cd /tmp/ltsmin2891479183816201592;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin2891479183816201592;'/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/stateBased14790293731961380226.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 907/907 transitions.
Applied a total of 0 rules in 7 ms. Remains 384 /384 variables (removed 0) and now considering 907/907 (removed 0) transitions.
[2026-05-26 00:49:53] [INFO ] Invariant cache hit.
[2026-05-26 00:49:53] [INFO ] Implicit Places using invariants in 187 ms returned []
[2026-05-26 00:49:53] [INFO ] Invariant cache hit.
[2026-05-26 00:49:53] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-26 00:49:53] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2026-05-26 00:49:53] [INFO ] Redundant transitions in 13 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 671 ms. Remains : 384/384 places, 907/907 transitions.
Built C files in :
/tmp/ltsmin6774455548872084769
[2026-05-26 00:49:53] [INFO ] Computing symmetric may disable matrix : 907 transitions.
[2026-05-26 00:49:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:49:53] [INFO ] Computing symmetric may enable matrix : 907 transitions.
[2026-05-26 00:49:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:49:53] [INFO ] Computing Do-Not-Accords matrix : 907 transitions.
[2026-05-26 00:49:53] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:49:54] [INFO ] Built C files in 154ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6774455548872084769
Running compilation step : cd /tmp/ltsmin6774455548872084769;'/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 2514 ms.
Running link step : cd /tmp/ltsmin6774455548872084769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin6774455548872084769;'/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/stateBased7953143904105992399.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 00:50:08] [INFO ] Flatten gal took : 19 ms
[2026-05-26 00:50:08] [INFO ] Flatten gal took : 15 ms
[2026-05-26 00:50:08] [INFO ] Time to serialize gal into /tmp/LTL17331154291469235806.gal : 6 ms
[2026-05-26 00:50:08] [INFO ] Time to serialize properties into /tmp/LTL9753305301068674441.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/LTL17331154291469235806.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2004118031588706656.hoa' '-atoms' '/tmp/LTL9753305301068674441.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9753305301068674441.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2004118031588706656.hoa
Detected timeout of ITS tools.
[2026-05-26 00:50:24] [INFO ] Flatten gal took : 14 ms
[2026-05-26 00:50:24] [INFO ] Flatten gal took : 14 ms
[2026-05-26 00:50:24] [INFO ] Time to serialize gal into /tmp/LTL3832444713707920294.gal : 4 ms
[2026-05-26 00:50:24] [INFO ] Time to serialize properties into /tmp/LTL513783404766405676.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/LTL3832444713707920294.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL513783404766405676.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F("((p154==0)||(p688==0))"))))
Formula 0 simplified : FG!"((p154==0)||(p688==0))"
Detected timeout of ITS tools.
[2026-05-26 00:50:39] [INFO ] Flatten gal took : 15 ms
[2026-05-26 00:50:39] [INFO ] Applying decomposition
[2026-05-26 00:50:39] [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/graph4896360569661427914.txt' '-o' '/tmp/graph4896360569661427914.bin' '-w' '/tmp/graph4896360569661427914.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4896360569661427914.bin' '-l' '-1' '-v' '-w' '/tmp/graph4896360569661427914.weights' '-q' '0' '-e' '0.001'
[2026-05-26 00:50:39] [INFO ] Decomposing Gal with order
[2026-05-26 00:50:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 00:50:39] [INFO ] Removed a total of 661 redundant transitions.
[2026-05-26 00:50:39] [INFO ] Flatten gal took : 38 ms
[2026-05-26 00:50:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 691 labels/synchronizations in 9 ms.
[2026-05-26 00:50:39] [INFO ] Time to serialize gal into /tmp/LTL12084702771640345453.gal : 5 ms
[2026-05-26 00:50:39] [INFO ] Time to serialize properties into /tmp/LTL3628077342672988547.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/LTL12084702771640345453.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3628077342672988547.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("((i1.u5.p154==0)||(i4.i0.u24.p688==0))"))))
Formula 0 simplified : FG!"((i1.u5.p154==0)||(i4.i0.u24.p688==0))"
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-5B-LTLFireability-06 finished in 140521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G(p1)))))'
Support contains 3 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1410/1410 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 889 transition count 1387
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 889 transition count 1387
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 882 transition count 1376
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 882 transition count 1376
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 878 transition count 1369
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 878 transition count 1369
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 875 transition count 1363
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 875 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 874 transition count 1362
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 874 transition count 1362
Applied a total of 60 rules in 77 ms. Remains 874 /904 variables (removed 30) and now considering 1362/1410 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17017403309426253007.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9594004477610114156.kers'
[2026-05-26 00:50:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17017403309426253007.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9594004477610114156.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1362 rows 874 cols 4095 entries
Finished phase 1 with 808 SingleSign rule and 0 generalized
[2026-05-26 00:50:54] [INFO ] Computed 66 invariants in 5 ms
Computed 66 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-9594004477610114156.kers
Total runtime 9 ms.
[2026-05-26 00:50:54] [INFO ] Implicit Places using invariants in 390 ms returned []
[2026-05-26 00:50:54] [INFO ] Invariant cache hit.
[2026-05-26 00:50:55] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1251 ms to find 0 implicit places.
Running 1361 sub problems to find dead transitions.
[2026-05-26 00:50:55] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 873/2236 variables, and 0 constraints, problems are : Problem set: 0 solved, 1361 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/874 constraints, PredecessorRefiner: 1361/1361 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 873/2236 variables, and 0 constraints, problems are : Problem set: 0 solved, 1361 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/874 constraints, PredecessorRefiner: 0/1361 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60232ms problems are : Problem set: 0 solved, 1361 unsolved
Search for dead transitions found 0 dead transitions in 60235ms
Starting structural reductions in LTL mode, iteration 1 : 874/904 places, 1362/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61569 ms. Remains : 874/904 places, 1362/1410 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G(p1)))))'
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-07
Entered a terminal (fully accepting) state of product in 24441 steps with 38 reset in 62 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-07 finished in 61896 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)) U p1)&&X((X(F(p2))&&G(p3)))))'
Support contains 4 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1410/1410 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 890 transition count 1388
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 890 transition count 1388
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 883 transition count 1377
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 883 transition count 1377
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 878 transition count 1368
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 878 transition count 1368
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 874 transition count 1360
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 874 transition count 1360
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 872 transition count 1358
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 872 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 871 transition count 1356
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 871 transition count 1356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 870 transition count 1353
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 870 transition count 1353
Applied a total of 68 rules in 110 ms. Remains 870 /904 variables (removed 34) and now considering 1353/1410 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7347208485087296605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9398627166713475850.kers'
[2026-05-26 00:51:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7347208485087296605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9398627166713475850.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1353 rows 870 cols 4071 entries
Finished phase 1 with 804 SingleSign rule and 0 generalized
[2026-05-26 00:51:56] [INFO ] Computed 66 invariants in 9 ms
Computed 66 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9398627166713475850.kers
Total runtime 11 ms.
[2026-05-26 00:51:56] [INFO ] Implicit Places using invariants in 350 ms returned []
[2026-05-26 00:51:56] [INFO ] Invariant cache hit.
[2026-05-26 00:51:57] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
Running 1352 sub problems to find dead transitions.
[2026-05-26 00:51:57] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/2223 variables, and 0 constraints, problems are : Problem set: 0 solved, 1352 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 1352/1352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1352 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/2223 variables, and 0 constraints, problems are : Problem set: 0 solved, 1352 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 0/1352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60239ms problems are : Problem set: 0 solved, 1352 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Starting structural reductions in LTL mode, iteration 1 : 870/904 places, 1353/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61564 ms. Remains : 870/904 places, 1353/1410 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)) U p1)&&X((X(F(p2))&&G(p3)))))'
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p3) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (NOT p2) (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-08
Stuttering criterion allowed to conclude after 572 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-08 finished in 61870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&F(p1)) U X(X(p2))))'
Support contains 4 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1410/1410 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 889 transition count 1387
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 889 transition count 1387
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 881 transition count 1375
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 881 transition count 1375
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 876 transition count 1366
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 876 transition count 1366
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 872 transition count 1358
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 872 transition count 1358
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 870 transition count 1356
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 870 transition count 1356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 869 transition count 1354
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 869 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 868 transition count 1351
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 868 transition count 1351
Applied a total of 72 rules in 97 ms. Remains 868 /904 variables (removed 36) and now considering 1351/1410 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13730968955999506550.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2735577643026347312.kers'
[2026-05-26 00:52:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13730968955999506550.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2735577643026347312.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1351 rows 868 cols 4065 entries
Finished phase 1 with 802 SingleSign rule and 0 generalized
[2026-05-26 00:52:58] [INFO ] Computed 66 invariants in 13 ms
Computed 66 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-2735577643026347312.kers
Total runtime 15 ms.
[2026-05-26 00:52:58] [INFO ] Implicit Places using invariants in 351 ms returned []
[2026-05-26 00:52:58] [INFO ] Invariant cache hit.
[2026-05-26 00:52:59] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
Running 1350 sub problems to find dead transitions.
[2026-05-26 00:52:59] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 867/2219 variables, and 0 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/868 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 867/2219 variables, and 0 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/868 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60253ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 60256ms
Starting structural reductions in LTL mode, iteration 1 : 868/904 places, 1351/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61538 ms. Remains : 868/904 places, 1351/1410 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&F(p1)) U X(X(p2))))'
Stuttering acceptance computed with spot in 352 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-09
Stuttering criterion allowed to conclude after 927 steps with 1 reset in 4 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-09 finished in 61933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p0) U X(X(p1))) U (G(p2) U p3)))))'
Support contains 5 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1410/1410 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 891 transition count 1389
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 891 transition count 1389
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 885 transition count 1380
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 885 transition count 1380
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 882 transition count 1375
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 882 transition count 1375
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 880 transition count 1371
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 880 transition count 1371
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 878 transition count 1369
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 878 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 877 transition count 1367
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 877 transition count 1367
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 876 transition count 1364
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 876 transition count 1364
Applied a total of 56 rules in 95 ms. Remains 876 /904 variables (removed 28) and now considering 1364/1410 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12332035743121351577.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8459208023804947616.kers'
[2026-05-26 00:54:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12332035743121351577.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8459208023804947616.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1364 rows 876 cols 4103 entries
Finished phase 1 with 810 SingleSign rule and 0 generalized
[2026-05-26 00:54:00] [INFO ] Computed 66 invariants in 5 ms
Computed 66 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8459208023804947616.kers
Total runtime 7 ms.
[2026-05-26 00:54:00] [INFO ] Implicit Places using invariants in 340 ms returned []
[2026-05-26 00:54:00] [INFO ] Invariant cache hit.
[2026-05-26 00:54:01] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
Running 1363 sub problems to find dead transitions.
[2026-05-26 00:54:01] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 875/2240 variables, and 0 constraints, problems are : Problem set: 0 solved, 1363 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/876 constraints, PredecessorRefiner: 1363/1363 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1363 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 875/2240 variables, and 0 constraints, problems are : Problem set: 0 solved, 1363 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/876 constraints, PredecessorRefiner: 0/1363 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60248ms problems are : Problem set: 0 solved, 1363 unsolved
Search for dead transitions found 0 dead transitions in 60249ms
Starting structural reductions in LTL mode, iteration 1 : 876/904 places, 1364/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61543 ms. Remains : 876/904 places, 1364/1410 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p0) U X(X(p1))) U (G(p2) U p3)))))'
Stuttering acceptance computed with spot in 841 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p3) p2 (NOT p0) (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (NOT p0), (NOT p2), (NOT p3), (AND (NOT p0) (NOT p2)), (AND p2 (NOT p3) (NOT p0) p1)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-10
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-10 finished in 62474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 903 transition count 1338
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 143 place count 832 transition count 1337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 831 transition count 1337
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 144 place count 831 transition count 1302
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 214 place count 796 transition count 1302
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 250 place count 760 transition count 1186
Iterating global reduction 3 with 36 rules applied. Total rules applied 286 place count 760 transition count 1186
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 291 place count 755 transition count 1177
Iterating global reduction 3 with 5 rules applied. Total rules applied 296 place count 755 transition count 1177
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 297 place count 755 transition count 1176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 298 place count 754 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 299 place count 753 transition count 1174
Iterating global reduction 5 with 1 rules applied. Total rules applied 300 place count 753 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 301 place count 752 transition count 1172
Iterating global reduction 5 with 1 rules applied. Total rules applied 302 place count 752 transition count 1172
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 193
Deduced a syphon composed of 193 places in 0 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 5 with 386 rules applied. Total rules applied 688 place count 559 transition count 979
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 691 place count 559 transition count 976
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 694 place count 556 transition count 970
Iterating global reduction 6 with 3 rules applied. Total rules applied 697 place count 556 transition count 970
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 700 place count 553 transition count 964
Iterating global reduction 6 with 3 rules applied. Total rules applied 703 place count 553 transition count 964
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 704 place count 552 transition count 962
Iterating global reduction 6 with 1 rules applied. Total rules applied 705 place count 552 transition count 962
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 706 place count 551 transition count 959
Iterating global reduction 6 with 1 rules applied. Total rules applied 707 place count 551 transition count 959
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 708 place count 551 transition count 958
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 910 place count 450 transition count 986
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 924 place count 450 transition count 972
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 8 with 70 rules applied. Total rules applied 994 place count 415 transition count 980
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 8 with 62 rules applied. Total rules applied 1056 place count 415 transition count 918
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1065 place count 406 transition count 918
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 5 Pre rules applied. Total rules applied 1065 place count 406 transition count 913
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1075 place count 401 transition count 913
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 1113 place count 382 transition count 894
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1114 place count 381 transition count 893
Applied a total of 1114 rules in 164 ms. Remains 381 /904 variables (removed 523) and now considering 893/1410 (removed 517) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1539685622537816230.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5011985136317837608.kers'
[2026-05-26 00:55:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1539685622537816230.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5011985136317837608.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 893 rows 381 cols 3386 entries
Finished phase 1 with 307 SingleSign rule and 17 generalized
[2026-05-26 00:55:02] [INFO ] Computed 57 invariants in 3 ms
Computed 57 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5011985136317837608.kers
Total runtime 3 ms.
[2026-05-26 00:55:02] [INFO ] Implicit Places using invariants in 192 ms returned []
[2026-05-26 00:55:02] [INFO ] Invariant cache hit.
[2026-05-26 00:55:03] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-26 00:55:03] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2026-05-26 00:55:03] [INFO ] Redundant transitions in 12 ms returned []
Running 838 sub problems to find dead transitions.
[2026-05-26 00:55:03] [INFO ] Invariant cache hit.
[2026-05-26 00:55:03] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 14/91 constraints. Problems are: Problem set: 0 solved, 838 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 838 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/1274 variables, and 95 constraints, problems are : Problem set: 0 solved, 838 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/381 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 838/838 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 838 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 38/95 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 5 (OVERLAPS) 893/1274 variables, 381/487 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1274 variables, 31/518 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1274 variables, 838/1356 constraints. Problems are: Problem set: 0 solved, 838 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1274/1274 variables, and 1356 constraints, problems are : Problem set: 0 solved, 838 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 381/381 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 838/838 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 838 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in SI_LTL mode, iteration 1 : 381/904 places, 893/1410 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60984 ms. Remains : 381/904 places, 893/1410 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-12
Stuttering criterion allowed to conclude after 228 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-12 finished in 61043 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)&&F(p1))))'
Support contains 2 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1410/1410 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 889 transition count 1387
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 889 transition count 1387
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 882 transition count 1376
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 882 transition count 1376
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 877 transition count 1367
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 877 transition count 1367
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 873 transition count 1359
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 873 transition count 1359
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 871 transition count 1357
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 871 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 870 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 870 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 869 transition count 1352
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 869 transition count 1352
Applied a total of 70 rules in 99 ms. Remains 869 /904 variables (removed 35) and now considering 1352/1410 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10329016391168896728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17049589364361801475.kers'
[2026-05-26 00:56:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10329016391168896728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17049589364361801475.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1352 rows 869 cols 4069 entries
Finished phase 1 with 803 SingleSign rule and 0 generalized
[2026-05-26 00:56:03] [INFO ] Computed 66 invariants in 11 ms
Computed 66 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-17049589364361801475.kers
Total runtime 14 ms.
[2026-05-26 00:56:03] [INFO ] Implicit Places using invariants in 350 ms returned []
[2026-05-26 00:56:03] [INFO ] Invariant cache hit.
[2026-05-26 00:56:04] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
Running 1351 sub problems to find dead transitions.
[2026-05-26 00:56:04] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 868/2221 variables, and 0 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/869 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 868/2221 variables, and 0 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/869 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60247ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 60249ms
Starting structural reductions in LTL mode, iteration 1 : 869/904 places, 1352/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61525 ms. Remains : 869/904 places, 1352/1410 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)&&F(p1))))'
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-13 finished in 61726 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(G(p0))&&F(p1))))'
Support contains 3 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 903 transition count 1339
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 833 transition count 1339
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 140 place count 833 transition count 1304
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 210 place count 798 transition count 1304
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 246 place count 762 transition count 1188
Iterating global reduction 2 with 36 rules applied. Total rules applied 282 place count 762 transition count 1188
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 287 place count 757 transition count 1179
Iterating global reduction 2 with 5 rules applied. Total rules applied 292 place count 757 transition count 1179
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 2 with 1 rules applied. Total rules applied 293 place count 757 transition count 1178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 294 place count 756 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 295 place count 755 transition count 1176
Iterating global reduction 4 with 1 rules applied. Total rules applied 296 place count 755 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 297 place count 754 transition count 1174
Iterating global reduction 4 with 1 rules applied. Total rules applied 298 place count 754 transition count 1174
Performed 191 Post agglomeration using F-continuation condition.Transition count delta: 191
Deduced a syphon composed of 191 places in 0 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 4 with 382 rules applied. Total rules applied 680 place count 563 transition count 983
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 683 place count 563 transition count 980
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 685 place count 561 transition count 976
Iterating global reduction 5 with 2 rules applied. Total rules applied 687 place count 561 transition count 976
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 689 place count 559 transition count 972
Iterating global reduction 5 with 2 rules applied. Total rules applied 691 place count 559 transition count 972
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 692 place count 558 transition count 970
Iterating global reduction 5 with 1 rules applied. Total rules applied 693 place count 558 transition count 970
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 694 place count 557 transition count 967
Iterating global reduction 5 with 1 rules applied. Total rules applied 695 place count 557 transition count 967
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 696 place count 557 transition count 966
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 898 place count 456 transition count 993
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 912 place count 456 transition count 979
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 72 rules applied. Total rules applied 984 place count 420 transition count 987
Drop transitions (Redundant composition of simpler transitions.) removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 7 with 60 rules applied. Total rules applied 1044 place count 420 transition count 927
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1053 place count 411 transition count 927
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 5 Pre rules applied. Total rules applied 1053 place count 411 transition count 922
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1063 place count 406 transition count 922
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 1101 place count 387 transition count 903
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1102 place count 386 transition count 902
Applied a total of 1102 rules in 168 ms. Remains 386 /904 variables (removed 518) and now considering 902/1410 (removed 508) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2975989912627426441.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7922940132494348789.kers'
[2026-05-26 00:57:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2975989912627426441.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7922940132494348789.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 902 rows 386 cols 3439 entries
Finished phase 1 with 312 SingleSign rule and 17 generalized
[2026-05-26 00:57:05] [INFO ] Computed 57 invariants in 7 ms
Computed 57 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-7922940132494348789.kers
Total runtime 8 ms.
[2026-05-26 00:57:05] [INFO ] Implicit Places using invariants in 200 ms returned []
[2026-05-26 00:57:05] [INFO ] Invariant cache hit.
[2026-05-26 00:57:05] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-26 00:57:06] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2026-05-26 00:57:06] [INFO ] Redundant transitions in 14 ms returned []
Running 874 sub problems to find dead transitions.
[2026-05-26 00:57:06] [INFO ] Invariant cache hit.
[2026-05-26 00:57:06] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 874 unsolved
SMT process timed out in 30152ms, After SMT, problems are : Problem set: 0 solved, 874 unsolved
Search for dead transitions found 0 dead transitions in 30154ms
Starting structural reductions in SI_LTL mode, iteration 1 : 386/904 places, 902/1410 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30997 ms. Remains : 386/904 places, 902/1410 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(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-14
Stuttering criterion allowed to conclude after 150 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-14 finished in 31146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(p0))) U (F(!p2)&&p1)))))'
Support contains 6 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1410/1410 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 888 transition count 1386
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 888 transition count 1386
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 880 transition count 1374
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 880 transition count 1374
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 876 transition count 1367
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 876 transition count 1367
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 873 transition count 1361
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 873 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 872 transition count 1360
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 872 transition count 1360
Applied a total of 64 rules in 72 ms. Remains 872 /904 variables (removed 32) and now considering 1360/1410 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1623573534178086176.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17422882565812662027.kers'
[2026-05-26 00:57:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1623573534178086176.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17422882565812662027.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1360 rows 872 cols 4091 entries
Finished phase 1 with 806 SingleSign rule and 0 generalized
[2026-05-26 00:57:36] [INFO ] Computed 66 invariants in 5 ms
Computed 66 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17422882565812662027.kers
Total runtime 8 ms.
[2026-05-26 00:57:36] [INFO ] Implicit Places using invariants in 332 ms returned []
[2026-05-26 00:57:36] [INFO ] Invariant cache hit.
[2026-05-26 00:57:37] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
Running 1359 sub problems to find dead transitions.
[2026-05-26 00:57:37] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/2232 variables, and 0 constraints, problems are : Problem set: 0 solved, 1359 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/872 constraints, PredecessorRefiner: 1359/1359 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1359 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/2232 variables, and 0 constraints, problems are : Problem set: 0 solved, 1359 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/872 constraints, PredecessorRefiner: 0/1359 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60258ms problems are : Problem set: 0 solved, 1359 unsolved
Search for dead transitions found 0 dead transitions in 60261ms
Starting structural reductions in LTL mode, iteration 1 : 872/904 places, 1360/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61501 ms. Remains : 872/904 places, 1360/1410 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(p0))) U (F(!p2)&&p1)))))'
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), p2, (NOT p0), (NOT p0), true]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-15
Product exploration explored 100000 steps with 14301 reset in 187 ms.
Product exploration explored 100000 steps with 14269 reset in 210 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge based reduction with 7 factoid took 62 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
RANDOM walk for 31891 steps (48 resets) in 139 ms. (227 steps per ms) remains 0/4 properties
Knowledge based reduction with 7 factoid took 103 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), p2, (NOT p0), (NOT p0), true]
[2026-05-26 00:58:39] [INFO ] Invariant cache hit.
[2026-05-26 00:58:39] [INFO ] [Real]Absence check using 66 positive place invariants in 277 ms returned sat
[2026-05-26 00:58:45] [INFO ] [Real]Absence check using state equation in 5832 ms returned sat
[2026-05-26 00:58:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 00:58:46] [INFO ] [Nat]Absence check using 66 positive place invariants in 208 ms returned sat
[2026-05-26 00:58:56] [INFO ] [Nat]Absence check using state equation in 9732 ms returned sat
[2026-05-26 00:58:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 409 ms
[2026-05-26 00:58:56] [INFO ] Computed and/alt/rep : 1324/3774/1324 causal constraints (skipped 35 transitions) in 69 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:593)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeFacts.computeEGknowledge(KnowledgeFacts.java:231)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:52)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:248)
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)
[2026-05-26 00:59:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Knowledge-based reduction took 22087 ms.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), p2, (NOT p0), (NOT p0), true]
Support contains 6 out of 872 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 1360/1360 transitions.
Applied a total of 0 rules in 19 ms. Remains 872 /872 variables (removed 0) and now considering 1360/1360 (removed 0) transitions.
[2026-05-26 00:59:00] [INFO ] Invariant cache hit.
[2026-05-26 00:59:01] [INFO ] Implicit Places using invariants in 334 ms returned []
[2026-05-26 00:59:01] [INFO ] Invariant cache hit.
[2026-05-26 00:59:02] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1160 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1181 ms. Remains : 872/872 places, 1360/1360 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge based reduction with 7 factoid took 65 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
RANDOM walk for 31258 steps (45 resets) in 114 ms. (271 steps per ms) remains 0/4 properties
Knowledge based reduction with 7 factoid took 110 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), p2, (NOT p0), (NOT p0), true]
[2026-05-26 00:59:02] [INFO ] Invariant cache hit.
[2026-05-26 00:59:03] [INFO ] [Real]Absence check using 66 positive place invariants in 291 ms returned sat
[2026-05-26 00:59:09] [INFO ] [Real]Absence check using state equation in 5987 ms returned sat
[2026-05-26 00:59:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 00:59:10] [INFO ] [Nat]Absence check using 66 positive place invariants in 208 ms returned sat
[2026-05-26 00:59:19] [INFO ] [Nat]Absence check using state equation in 9603 ms returned sat
[2026-05-26 00:59:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 389 ms
[2026-05-26 00:59:20] [INFO ] Computed and/alt/rep : 1324/3774/1324 causal constraints (skipped 35 transitions) in 70 ms.
[2026-05-26 00:59:24] [INFO ] Added : 135 causal constraints over 27 iterations in 4364 ms. Result :unknown
Could not prove EG (NOT p1)
Knowledge-based reduction took 22293 ms.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), p2, (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), p2, (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 14294 reset in 200 ms.
Product exploration explored 100000 steps with 14314 reset in 205 ms.
Spot run failed in 49 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/ltsmin9125965229061111653
[2026-05-26 00:59:25] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9125965229061111653
Running compilation step : cd /tmp/ltsmin9125965229061111653;'/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 2368 ms.
Running link step : cd /tmp/ltsmin9125965229061111653;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9125965229061111653;'/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/stateBased14352994304140052003.hoa' '--buchi-type=spotba'
LTSmin run took 466 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property NoC3x3-PT-5B-LTLFireability-15 finished in 111976 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)))'
Spot run failed in 36 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' '!((F(p0)&&X((G(p1)||(p1&&F(G(p2)))))))'
Spot run failed in 46 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)))'
Spot run failed in 37 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-26 00:59:28] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11868675315218866532
[2026-05-26 00:59:28] [INFO ] Applying decomposition
[2026-05-26 00:59:28] [INFO ] Computing symmetric may disable matrix : 1410 transitions.
[2026-05-26 00:59:28] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:59:28] [INFO ] Computing symmetric may enable matrix : 1410 transitions.
[2026-05-26 00:59:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:59:28] [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/graph12768862122198667756.txt' '-o' '/tmp/graph12768862122198667756.bin' '-w' '/tmp/graph12768862122198667756.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12768862122198667756.bin' '-l' '-1' '-v' '-w' '/tmp/graph12768862122198667756.weights' '-q' '0' '-e' '0.001'
[2026-05-26 00:59:28] [INFO ] Decomposing Gal with order
[2026-05-26 00:59:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 00:59:28] [INFO ] Removed a total of 1255 redundant transitions.
[2026-05-26 00:59:28] [INFO ] Flatten gal took : 50 ms
[2026-05-26 00:59:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 12 ms.
[2026-05-26 00:59:28] [INFO ] Time to serialize gal into /tmp/LTLFireability3428977023977872502.gal : 9 ms
[2026-05-26 00:59:28] [INFO ] Time to serialize properties into /tmp/LTLFireability12422437172504448808.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/LTLFireability3428977023977872502.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12422437172504448808.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
[2026-05-26 00:59:28] [INFO ] Computing Do-Not-Accords matrix : 1410 transitions.
[2026-05-26 00:59:28] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:59:28] [INFO ] Built C files in 355ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11868675315218866532
Running compilation step : cd /tmp/ltsmin11868675315218866532;'/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'
Checking formula 0 : !((F(G("(i1.u57.p237==0)"))))
Formula 0 simplified : GF!"(i1.u57.p237==0)"
Compilation finished in 4830 ms.
Running link step : cd /tmp/ltsmin11868675315218866532;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin11868675315218866532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin11868675315218866532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11868675315218866532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(<>((LTLAPp1==true))&&X(([]((LTLAPp2==true))||((LTLAPp2==true)&&<>([]((LTLAPp3==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin11868675315218866532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(<>((LTLAPp1==true))&&X(([]((LTLAPp2==true))||((LTLAPp2==true)&&<>([]((LTLAPp3==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11868675315218866532;'/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' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin11868675315218866532;'/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' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin11868675315218866532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-26 01:26:12] [INFO ] Applying decomposition
[2026-05-26 01:26:13] [INFO ] Flatten gal took : 266 ms
[2026-05-26 01:26:13] [INFO ] Decomposing Gal with order
[2026-05-26 01:26:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 01:26:13] [INFO ] Removed a total of 788 redundant transitions.
[2026-05-26 01:26:13] [INFO ] Flatten gal took : 212 ms
[2026-05-26 01:26:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 1570 labels/synchronizations in 395 ms.
[2026-05-26 01:26:14] [INFO ] Time to serialize gal into /tmp/LTLFireability12408951252237608492.gal : 24 ms
[2026-05-26 01:26:14] [INFO ] Time to serialize properties into /tmp/LTLFireability11957921699364217457.ltl : 7 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/LTLFireability12408951252237608492.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11957921699364217457.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 : !((F(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...212
Formula 0 simplified : GF!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...206

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="NoC3x3-PT-5B"
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 NoC3x3-PT-5B, 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 r194-tall-177969914000332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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