Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r130-smll-177955809100348.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 FlexibleBarrier-PT-08b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809100348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.5K Mar 7 05:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 7 05:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Mar 7 05:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Mar 7 05:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 05:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 7 05:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 7 05:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 05:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 241K 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 FlexibleBarrier-PT-08b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779878381334

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 10:39:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 10:39:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 10:39:43] [INFO ] Load time of PNML (sax parser for PT used): 275 ms
[2026-05-27 10:39:43] [INFO ] Transformed 920 places.
[2026-05-27 10:39:43] [INFO ] Transformed 1057 transitions.
[2026-05-27 10:39:43] [INFO ] Found NUPN structural information;
[2026-05-27 10:39:43] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 474 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Discarding 323 places :
Symmetric choice reduction at 0 with 323 rule applications. Total rules 323 place count 597 transition count 734
Iterating global reduction 0 with 323 rules applied. Total rules applied 646 place count 597 transition count 734
Discarding 139 places :
Symmetric choice reduction at 0 with 139 rule applications. Total rules 785 place count 458 transition count 595
Iterating global reduction 0 with 139 rules applied. Total rules applied 924 place count 458 transition count 595
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 1001 place count 381 transition count 518
Iterating global reduction 0 with 77 rules applied. Total rules applied 1078 place count 381 transition count 518
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 1110 place count 381 transition count 486
Applied a total of 1110 rules in 369 ms. Remains 381 /920 variables (removed 539) and now considering 486/1057 (removed 571) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16976832764551206057.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11188779046109833990.kers'
[2026-05-27 10:39:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16976832764551206057.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11188779046109833990.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 486 rows 381 cols 1357 entries
Finished phase 1 with 371 SingleSign rule and 0 generalized
[2026-05-27 10:39:44] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11188779046109833990.kers
Total runtime 7 ms.
[2026-05-27 10:39:45] [INFO ] Implicit Places using invariants in 922 ms returned []
[2026-05-27 10:39:45] [INFO ] Invariant cache hit.
[2026-05-27 10:39:46] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1884 ms to find 0 implicit places.
Running 485 sub problems to find dead transitions.
[2026-05-27 10:39:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 1 (OVERLAPS) 1/381 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 3 (OVERLAPS) 486/867 variables, 381/391 constraints. Problems are: Problem set: 0 solved, 485 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 867/867 variables, and 391 constraints, problems are : Problem set: 0 solved, 485 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 381/381 constraints, PredecessorRefiner: 485/485 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 485 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 1 (OVERLAPS) 1/381 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 3 (OVERLAPS) 486/867 variables, 381/391 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/867 variables, 485/876 constraints. Problems are: Problem set: 0 solved, 485 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 867/867 variables, and 882 constraints, problems are : Problem set: 0 solved, 485 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 381/381 constraints, PredecessorRefiner: 485/485 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60519ms problems are : Problem set: 0 solved, 485 unsolved
Search for dead transitions found 0 dead transitions in 60552ms
Starting structural reductions in LTL mode, iteration 1 : 381/920 places, 486/1057 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62883 ms. Remains : 381/920 places, 486/1057 transitions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 486/486 transitions.
Applied a total of 0 rules in 25 ms. Remains 381 /381 variables (removed 0) and now considering 486/486 (removed 0) transitions.
[2026-05-27 10:40:47] [INFO ] Invariant cache hit.
[2026-05-27 10:40:47] [INFO ] Implicit Places using invariants in 438 ms returned []
[2026-05-27 10:40:47] [INFO ] Invariant cache hit.
[2026-05-27 10:40:48] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1147 ms. Remains : 381/381 places, 486/486 transitions.
Support contains 36 out of 381 places after structural reductions.
[2026-05-27 10:40:48] [INFO ] Flatten gal took : 118 ms
[2026-05-27 10:40:48] [INFO ] Flatten gal took : 59 ms
[2026-05-27 10:40:48] [INFO ] Input system was already deterministic with 486 transitions.
RANDOM walk for 40000 steps (623 resets) in 2286 ms. (17 steps per ms) remains 18/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
[2026-05-27 10:40:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 318/340 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 41/381 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 486/867 variables, 381/391 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/867 variables, 4/395 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/867 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/867 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/867 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 867/867 variables, and 396 constraints, problems are : Problem set: 0 solved, 17 unsolved in 3434 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 381/381 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 318/340 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 41/381 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/867 variables, and 26 constraints, problems are : Problem set: 0 solved, 17 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/381 constraints, PredecessorRefiner: 0/17 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8462ms problems are : Problem set: 0 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 381/381 places, 486/486 transitions.
Graph (trivial) has 324 edges and 381 vertex of which 42 / 381 are part of one of the 7 SCC in 14 ms
Free SCC test removed 35 places
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 346 transition count 406
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 79 place count 308 transition count 404
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 83 place count 306 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 305 transition count 402
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 84 place count 305 transition count 383
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 122 place count 286 transition count 383
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 142 place count 266 transition count 363
Iterating global reduction 4 with 20 rules applied. Total rules applied 162 place count 266 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 163 place count 266 transition count 362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 163 place count 266 transition count 361
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 165 place count 265 transition count 361
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 170 place count 260 transition count 356
Iterating global reduction 5 with 5 rules applied. Total rules applied 175 place count 260 transition count 356
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 178 place count 260 transition count 353
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 6 with 110 rules applied. Total rules applied 288 place count 205 transition count 298
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 302 place count 205 transition count 284
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 311 place count 196 transition count 275
Iterating global reduction 7 with 9 rules applied. Total rules applied 320 place count 196 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 321 place count 196 transition count 274
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 323 place count 195 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 325 place count 195 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 327 place count 194 transition count 271
Free-agglomeration rule applied 114 times.
Iterating global reduction 8 with 114 rules applied. Total rules applied 441 place count 194 transition count 157
Reduce places removed 114 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 8 with 148 rules applied. Total rules applied 589 place count 80 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 592 place count 80 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 593 place count 79 transition count 119
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 40 edges and 78 vertex of which 14 / 78 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 596 place count 71 transition count 118
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 611 place count 70 transition count 104
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 8 Pre rules applied. Total rules applied 611 place count 70 transition count 96
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 11 with 16 rules applied. Total rules applied 627 place count 62 transition count 96
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 634 place count 62 transition count 89
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 12 with 18 rules applied. Total rules applied 652 place count 53 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 653 place count 53 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 654 place count 53 transition count 78
Free-agglomeration rule applied 7 times.
Iterating global reduction 13 with 7 rules applied. Total rules applied 661 place count 53 transition count 71
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 14 rules applied. Total rules applied 675 place count 45 transition count 65
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 676 place count 44 transition count 64
Iterating global reduction 14 with 1 rules applied. Total rules applied 677 place count 44 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 678 place count 44 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 680 place count 44 transition count 61
Applied a total of 680 rules in 342 ms. Remains 44 /381 variables (removed 337) and now considering 61/486 (removed 425) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 44/381 places, 61/486 transitions.
RANDOM walk for 22424 steps (5 resets) in 651 ms. (34 steps per ms) remains 0/17 properties
FORMULA FlexibleBarrier-PT-08b-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 10 stabilizing places and 10 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(p0))'
Support contains 1 out of 381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 381/381 places, 486/486 transitions.
Graph (trivial) has 354 edges and 381 vertex of which 49 / 381 are part of one of the 8 SCC in 2 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 339 transition count 397
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 293 transition count 397
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 93 place count 293 transition count 376
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 135 place count 272 transition count 376
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 173 place count 234 transition count 338
Iterating global reduction 2 with 38 rules applied. Total rules applied 211 place count 234 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 213 place count 234 transition count 336
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 213 place count 234 transition count 335
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 215 place count 233 transition count 335
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 222 place count 226 transition count 328
Iterating global reduction 3 with 7 rules applied. Total rules applied 229 place count 226 transition count 328
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 236 place count 226 transition count 321
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 338 place count 175 transition count 270
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 346 place count 167 transition count 262
Iterating global reduction 4 with 8 rules applied. Total rules applied 354 place count 167 transition count 262
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 362 place count 167 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 370 place count 167 transition count 246
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 372 place count 165 transition count 244
Applied a total of 372 rules in 127 ms. Remains 165 /381 variables (removed 216) and now considering 244/486 (removed 242) transitions.
[2026-05-27 10:40:59] [INFO ] Flow matrix only has 230 transitions (discarded 14 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2174845817445244543.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11973008861239944964.kers'
[2026-05-27 10:40:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2174845817445244543.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11973008861239944964.kers]
Normalized transition count is 229 out of 230 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 229 rows 165 cols 702 entries
Finished phase 1 with 155 SingleSign rule and 0 generalized
[2026-05-27 10:40:59] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11973008861239944964.kers
Total runtime 4 ms.
[2026-05-27 10:40:59] [INFO ] Implicit Places using invariants in 255 ms returned []
[2026-05-27 10:40:59] [INFO ] Flow matrix only has 230 transitions (discarded 14 similar events)
[2026-05-27 10:40:59] [INFO ] Invariant cache hit.
[2026-05-27 10:40:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-27 10:41:00] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2026-05-27 10:41:00] [INFO ] Redundant transitions in 21 ms returned []
Running 122 sub problems to find dead transitions.
[2026-05-27 10:41:00] [INFO ] Flow matrix only has 230 transitions (discarded 14 similar events)
[2026-05-27 10:41:00] [INFO ] Invariant cache hit.
[2026-05-27 10:41:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 8/165 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 229/394 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/395 variables, and 176 constraints, problems are : Problem set: 0 solved, 122 unsolved in 10693 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 8/165 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 229/394 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 122/298 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/394 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/395 variables, and 298 constraints, problems are : Problem set: 0 solved, 122 unsolved in 12530 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23317ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 23319ms
Starting structural reductions in SI_LTL mode, iteration 1 : 165/381 places, 244/486 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24138 ms. Remains : 165/381 places, 244/486 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 288 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-00 finished in 24528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 486/486 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 356 transition count 461
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 356 transition count 461
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 356 transition count 459
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 70 place count 338 transition count 441
Iterating global reduction 1 with 18 rules applied. Total rules applied 88 place count 338 transition count 441
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 98 place count 338 transition count 431
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 332 transition count 425
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 332 transition count 425
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 115 place count 332 transition count 420
Applied a total of 115 rules in 59 ms. Remains 332 /381 variables (removed 49) and now considering 420/486 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7196438164584424623.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15632203652226523119.kers'
[2026-05-27 10:41:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7196438164584424623.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15632203652226523119.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 420 rows 332 cols 1157 entries
Finished phase 1 with 322 SingleSign rule and 0 generalized
[2026-05-27 10:41:23] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15632203652226523119.kers
Total runtime 3 ms.
[2026-05-27 10:41:24] [INFO ] Implicit Places using invariants in 378 ms returned []
[2026-05-27 10:41:24] [INFO ] Invariant cache hit.
[2026-05-27 10:41:24] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2026-05-27 10:41:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 420/752 variables, 332/342 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 752/752 variables, and 342 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 420/752 variables, 332/342 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/752 variables, 419/761 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/752 variables, and 769 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Starting structural reductions in LTL mode, iteration 1 : 332/381 places, 420/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61090 ms. Remains : 332/381 places, 420/486 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-01 finished in 61257 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 381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 381/381 places, 486/486 transitions.
Graph (trivial) has 353 edges and 381 vertex of which 49 / 381 are part of one of the 8 SCC in 2 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 339 transition count 397
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 293 transition count 397
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 93 place count 293 transition count 377
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 133 place count 273 transition count 377
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 170 place count 236 transition count 340
Iterating global reduction 2 with 37 rules applied. Total rules applied 207 place count 236 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 209 place count 236 transition count 338
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 209 place count 236 transition count 336
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 213 place count 234 transition count 336
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 219 place count 228 transition count 330
Iterating global reduction 3 with 6 rules applied. Total rules applied 225 place count 228 transition count 330
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 230 place count 228 transition count 325
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 330 place count 178 transition count 275
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 338 place count 170 transition count 267
Iterating global reduction 4 with 8 rules applied. Total rules applied 346 place count 170 transition count 267
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 354 place count 170 transition count 259
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 362 place count 170 transition count 251
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 364 place count 168 transition count 249
Applied a total of 364 rules in 142 ms. Remains 168 /381 variables (removed 213) and now considering 249/486 (removed 237) transitions.
[2026-05-27 10:42:25] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8283906721638288614.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9255047901490158706.kers'
[2026-05-27 10:42:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8283906721638288614.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9255047901490158706.kers]
Normalized transition count is 233 out of 234 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 233 rows 167 cols 685 entries
Finished phase 1 with 158 SingleSign rule and 0 generalized
[2026-05-27 10:42:25] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9255047901490158706.kers
Total runtime 2 ms.
[2026-05-27 10:42:25] [INFO ] Implicit Places using invariants in 272 ms returned []
[2026-05-27 10:42:25] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2026-05-27 10:42:25] [INFO ] Invariant cache hit.
[2026-05-27 10:42:25] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
[2026-05-27 10:42:25] [INFO ] Redundant transitions in 46 ms returned []
Running 125 sub problems to find dead transitions.
[2026-05-27 10:42:25] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2026-05-27 10:42:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 8/168 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 233/401 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 0/401 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/402 variables, and 178 constraints, problems are : Problem set: 0 solved, 125 unsolved in 10548 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 8/168 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 233/401 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 125/303 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/401 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/402 variables, and 303 constraints, problems are : Problem set: 0 solved, 125 unsolved in 11721 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22293ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 22294ms
Starting structural reductions in SI_LTL mode, iteration 1 : 168/381 places, 249/486 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23153 ms. Remains : 168/381 places, 249/486 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 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-02 finished in 23262 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)||X(X(X(F(p1)))))))'
Support contains 2 out of 381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 381/381 places, 486/486 transitions.
Graph (trivial) has 351 edges and 381 vertex of which 49 / 381 are part of one of the 8 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 339 transition count 399
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 89 place count 295 transition count 399
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 89 place count 295 transition count 380
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 127 place count 276 transition count 380
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 164 place count 239 transition count 343
Iterating global reduction 2 with 37 rules applied. Total rules applied 201 place count 239 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 239 transition count 341
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 203 place count 239 transition count 339
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 207 place count 237 transition count 339
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 214 place count 230 transition count 332
Iterating global reduction 3 with 7 rules applied. Total rules applied 221 place count 230 transition count 332
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 226 place count 230 transition count 327
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 326 place count 180 transition count 277
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 334 place count 172 transition count 269
Iterating global reduction 4 with 8 rules applied. Total rules applied 342 place count 172 transition count 269
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 350 place count 172 transition count 261
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 358 place count 172 transition count 253
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 360 place count 170 transition count 251
Applied a total of 360 rules in 61 ms. Remains 170 /381 variables (removed 211) and now considering 251/486 (removed 235) transitions.
[2026-05-27 10:42:48] [INFO ] Flow matrix only has 236 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15825763781566568528.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5869868093149163366.kers'
[2026-05-27 10:42:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15825763781566568528.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5869868093149163366.kers]
Normalized transition count is 235 out of 236 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 235 rows 169 cols 689 entries
Finished phase 1 with 160 SingleSign rule and 0 generalized
[2026-05-27 10:42:48] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5869868093149163366.kers
Total runtime 2 ms.
[2026-05-27 10:42:48] [INFO ] Implicit Places using invariants in 233 ms returned []
[2026-05-27 10:42:48] [INFO ] Flow matrix only has 236 transitions (discarded 15 similar events)
[2026-05-27 10:42:48] [INFO ] Invariant cache hit.
[2026-05-27 10:42:48] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2026-05-27 10:42:48] [INFO ] Redundant transitions in 5 ms returned []
Running 127 sub problems to find dead transitions.
[2026-05-27 10:42:48] [INFO ] Flow matrix only has 236 transitions (discarded 15 similar events)
[2026-05-27 10:42:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 8/170 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 235/405 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 0/405 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/406 variables, and 180 constraints, problems are : Problem set: 0 solved, 127 unsolved in 10087 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 8/170 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 235/405 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 127/307 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 0/405 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/406 variables, and 307 constraints, problems are : Problem set: 0 solved, 127 unsolved in 8859 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18987ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 18988ms
Starting structural reductions in SI_LTL mode, iteration 1 : 170/381 places, 251/486 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19612 ms. Remains : 170/381 places, 251/486 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)||X(X(X(F(p1)))))))'
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-04
Product exploration explored 100000 steps with 19987 reset in 1079 ms.
Product exploration explored 100000 steps with 19969 reset in 564 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 57 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (2852 resets) in 1267 ms. (31 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (78 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
[2026-05-27 10:43:10] [INFO ] Flow matrix only has 236 transitions (discarded 15 similar events)
[2026-05-27 10:43:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/48 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 211/259 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 117/376 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 87/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 29/405 variables, 30/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/405 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/406 variables, and 180 constraints, problems are : Problem set: 0 solved, 1 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/48 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 211/259 variables, 37/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 117/376 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 87/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 29/405 variables, 30/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/405 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/405 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/406 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 577ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 9 ms.
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1235 ms.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 251/251 transitions.
Applied a total of 0 rules in 12 ms. Remains 170 /170 variables (removed 0) and now considering 251/251 (removed 0) transitions.
[2026-05-27 10:43:11] [INFO ] Flow matrix only has 236 transitions (discarded 15 similar events)
[2026-05-27 10:43:11] [INFO ] Invariant cache hit.
[2026-05-27 10:43:11] [INFO ] Implicit Places using invariants in 248 ms returned []
[2026-05-27 10:43:11] [INFO ] Flow matrix only has 236 transitions (discarded 15 similar events)
[2026-05-27 10:43:11] [INFO ] Invariant cache hit.
[2026-05-27 10:43:11] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2026-05-27 10:43:11] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 680 ms. Remains : 170/170 places, 251/251 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 7 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (2862 resets) in 327 ms. (121 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (79 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
[2026-05-27 10:43:12] [INFO ] Flow matrix only has 236 transitions (discarded 15 similar events)
[2026-05-27 10:43:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/48 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 211/259 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 117/376 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 87/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 29/405 variables, 30/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/405 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/406 variables, and 180 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/48 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 211/259 variables, 37/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 117/376 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 87/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 29/405 variables, 30/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/405 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/405 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/406 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 406ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 23 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 2 ms.
Knowledge based reduction with 7 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 792 ms.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6825 reset in 495 ms.
Stuttering criterion allowed to conclude after 91141 steps with 6274 reset in 577 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-04 finished in 25537 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&&(p0 U p1)))))'
Support contains 2 out of 381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 381/381 places, 486/486 transitions.
Graph (trivial) has 352 edges and 381 vertex of which 49 / 381 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 339 transition count 399
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 89 place count 295 transition count 399
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 89 place count 295 transition count 377
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 133 place count 273 transition count 377
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 170 place count 236 transition count 340
Iterating global reduction 2 with 37 rules applied. Total rules applied 207 place count 236 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 209 place count 236 transition count 338
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 209 place count 236 transition count 336
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 213 place count 234 transition count 336
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 220 place count 227 transition count 329
Iterating global reduction 3 with 7 rules applied. Total rules applied 227 place count 227 transition count 329
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 234 place count 227 transition count 322
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 334 place count 177 transition count 272
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 341 place count 170 transition count 265
Iterating global reduction 4 with 7 rules applied. Total rules applied 348 place count 170 transition count 265
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 355 place count 170 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 363 place count 170 transition count 250
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 365 place count 168 transition count 248
Applied a total of 365 rules in 90 ms. Remains 168 /381 variables (removed 213) and now considering 248/486 (removed 238) transitions.
[2026-05-27 10:43:13] [INFO ] Flow matrix only has 233 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15568937865291775256.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10243307511779170312.kers'
[2026-05-27 10:43:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15568937865291775256.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10243307511779170312.kers]
Normalized transition count is 232 out of 233 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 232 rows 167 cols 679 entries
Finished phase 1 with 158 SingleSign rule and 0 generalized
[2026-05-27 10:43:13] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10243307511779170312.kers
Total runtime 2 ms.
[2026-05-27 10:43:14] [INFO ] Implicit Places using invariants in 188 ms returned []
[2026-05-27 10:43:14] [INFO ] Flow matrix only has 233 transitions (discarded 15 similar events)
[2026-05-27 10:43:14] [INFO ] Invariant cache hit.
[2026-05-27 10:43:14] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2026-05-27 10:43:14] [INFO ] Redundant transitions in 2 ms returned []
Running 125 sub problems to find dead transitions.
[2026-05-27 10:43:14] [INFO ] Flow matrix only has 233 transitions (discarded 15 similar events)
[2026-05-27 10:43:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 8/168 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 232/400 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 0/400 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/401 variables, and 178 constraints, problems are : Problem set: 0 solved, 125 unsolved in 11198 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 8/168 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 232/400 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 125/303 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/400 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/401 variables, and 303 constraints, problems are : Problem set: 0 solved, 125 unsolved in 12309 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23562ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 23563ms
Starting structural reductions in SI_LTL mode, iteration 1 : 168/381 places, 248/486 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24161 ms. Remains : 168/381 places, 248/486 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&&(p0 U p1)))))'
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-05 finished in 24292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&F(p2)))))'
Support contains 5 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 486/486 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 358 transition count 463
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 358 transition count 463
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 358 transition count 462
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 64 place count 341 transition count 445
Iterating global reduction 1 with 17 rules applied. Total rules applied 81 place count 341 transition count 445
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 89 place count 341 transition count 437
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 96 place count 334 transition count 430
Iterating global reduction 2 with 7 rules applied. Total rules applied 103 place count 334 transition count 430
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 108 place count 334 transition count 425
Applied a total of 108 rules in 24 ms. Remains 334 /381 variables (removed 47) and now considering 425/486 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18163242928294495576.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16099001712483607053.kers'
[2026-05-27 10:43:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18163242928294495576.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16099001712483607053.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 425 rows 334 cols 1179 entries
Finished phase 1 with 324 SingleSign rule and 0 generalized
[2026-05-27 10:43:38] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16099001712483607053.kers
Total runtime 3 ms.
[2026-05-27 10:43:38] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-27 10:43:38] [INFO ] Invariant cache hit.
[2026-05-27 10:43:38] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2026-05-27 10:43:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/333 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 1/334 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 425/759 variables, 334/344 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 759/759 variables, and 344 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 334/334 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/333 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 1/334 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 425/759 variables, 334/344 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/759 variables, 424/768 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 759/759 variables, and 778 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 334/334 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 334/381 places, 425/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60936 ms. Remains : 334/381 places, 425/486 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(F(p1)&&p2))))'
Stuttering acceptance computed with spot in 296 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-06
Product exploration explored 100000 steps with 1525 reset in 416 ms.
Product exploration explored 100000 steps with 1528 reset in 547 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge based reduction with 12 factoid took 64 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (615 resets) in 285 ms. (139 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (80 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (79 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (82 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (78 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 379581 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 4
Probabilistic random walk after 379581 steps, saw 100706 distinct states, run finished after 3010 ms. (steps per millisecond=126 ) properties seen :0
[2026-05-27 10:44:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 194/199 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 135/334 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 425/759 variables, 334/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/759 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 759/759 variables, and 344 constraints, problems are : Problem set: 0 solved, 4 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 334/334 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 194/199 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 135/334 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 425/759 variables, 334/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 4/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/759 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/759 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 759/759 variables, and 348 constraints, problems are : Problem set: 0 solved, 4 unsolved in 880 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 334/334 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1378ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 51 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 140 ms.
Knowledge based reduction with 12 factoid took 135 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 5194 ms.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 334 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 425/425 transitions.
Applied a total of 0 rules in 5 ms. Remains 334 /334 variables (removed 0) and now considering 425/425 (removed 0) transitions.
[2026-05-27 10:44:45] [INFO ] Invariant cache hit.
[2026-05-27 10:44:46] [INFO ] Implicit Places using invariants in 307 ms returned []
[2026-05-27 10:44:46] [INFO ] Invariant cache hit.
[2026-05-27 10:44:46] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 801 ms. Remains : 334/334 places, 425/425 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge based reduction with 5 factoid took 48 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (615 resets) in 250 ms. (159 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (78 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (82 resets) in 30 ms. (1290 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (81 resets) in 25 ms. (1538 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (76 resets) in 29 ms. (1333 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 394218 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 4
Probabilistic random walk after 394218 steps, saw 104491 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
[2026-05-27 10:44:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 194/199 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 135/334 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 425/759 variables, 334/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/759 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 759/759 variables, and 344 constraints, problems are : Problem set: 0 solved, 4 unsolved in 498 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 334/334 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 194/199 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 135/334 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 425/759 variables, 334/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 4/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/759 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/759 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 759/759 variables, and 348 constraints, problems are : Problem set: 0 solved, 4 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 334/334 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1166ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 60 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=60 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 39 ms.
Knowledge based reduction with 5 factoid took 130 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 4710 ms.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1528 reset in 292 ms.
Product exploration explored 100000 steps with 1531 reset in 479 ms.
Spot run failed in 102 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/ltsmin4991446863381202703
[2026-05-27 10:44:52] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4991446863381202703
Running compilation step : cd /tmp/ltsmin4991446863381202703;'/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 1245 ms.
Running link step : cd /tmp/ltsmin4991446863381202703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin4991446863381202703;'/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/stateBased511634386008434783.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 334 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 425/425 transitions.
Applied a total of 0 rules in 4 ms. Remains 334 /334 variables (removed 0) and now considering 425/425 (removed 0) transitions.
[2026-05-27 10:45:07] [INFO ] Invariant cache hit.
[2026-05-27 10:45:07] [INFO ] Implicit Places using invariants in 233 ms returned []
[2026-05-27 10:45:07] [INFO ] Invariant cache hit.
[2026-05-27 10:45:08] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 849 ms. Remains : 334/334 places, 425/425 transitions.
Built C files in :
/tmp/ltsmin8885737687278997551
[2026-05-27 10:45:08] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8885737687278997551
Running compilation step : cd /tmp/ltsmin8885737687278997551;'/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 1019 ms.
Running link step : cd /tmp/ltsmin8885737687278997551;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin8885737687278997551;'/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/stateBased3792058622204105089.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 10:45:23] [INFO ] Flatten gal took : 26 ms
[2026-05-27 10:45:23] [INFO ] Flatten gal took : 33 ms
[2026-05-27 10:45:23] [INFO ] Time to serialize gal into /tmp/LTL16186627742222593215.gal : 14 ms
[2026-05-27 10:45:23] [INFO ] Time to serialize properties into /tmp/LTL15297599358111385877.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16186627742222593215.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9874480303654451995.hoa' '-atoms' '/tmp/LTL15297599358111385877.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15297599358111385877.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9874480303654451995.hoa
Detected timeout of ITS tools.
[2026-05-27 10:45:38] [INFO ] Flatten gal took : 23 ms
[2026-05-27 10:45:38] [INFO ] Flatten gal took : 22 ms
[2026-05-27 10:45:38] [INFO ] Time to serialize gal into /tmp/LTL4246688657918609412.gal : 5 ms
[2026-05-27 10:45:38] [INFO ] Time to serialize properties into /tmp/LTL5645333239924867462.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4246688657918609412.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5645333239924867462.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G("(((p290==0)||(p88==0))||((p207==0)||(p721==0)))"))||((F("(p386==1)"))&&("(((p88==0)||(p207==0))||(p721==0))")))))
Formula 0 simplified : X(F!"(((p290==0)||(p88==0))||((p207==0)||(p721==0)))" & (!"(((p88==0)||(p207==0))||(p721==0))" | G!"(p386==1)"))
Detected timeout of ITS tools.
[2026-05-27 10:45:53] [INFO ] Flatten gal took : 22 ms
[2026-05-27 10:45:53] [INFO ] Applying decomposition
[2026-05-27 10:45:53] [INFO ] Flatten gal took : 19 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/graph12204589374641068329.txt' '-o' '/tmp/graph12204589374641068329.bin' '-w' '/tmp/graph12204589374641068329.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12204589374641068329.bin' '-l' '-1' '-v' '-w' '/tmp/graph12204589374641068329.weights' '-q' '0' '-e' '0.001'
[2026-05-27 10:45:53] [INFO ] Decomposing Gal with order
[2026-05-27 10:45:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 10:45:54] [INFO ] Removed a total of 209 redundant transitions.
[2026-05-27 10:45:54] [INFO ] Flatten gal took : 132 ms
[2026-05-27 10:45:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 23 ms.
[2026-05-27 10:45:54] [INFO ] Time to serialize gal into /tmp/LTL6907446107496333572.gal : 13 ms
[2026-05-27 10:45:54] [INFO ] Time to serialize properties into /tmp/LTL12177718668461356493.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/LTL6907446107496333572.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12177718668461356493.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 : !((X((G("(((i7.i1.u35.p290==0)||(i0.i1.u13.p88==0))||((i5.i1.u32.p207==0)||(u81.p721==0)))"))||((F("(i9.i1.u53.p386==1)"))&&("(((i0.i1...211
Formula 0 simplified : X(F!"(((i7.i1.u35.p290==0)||(i0.i1.u13.p88==0))||((i5.i1.u32.p207==0)||(u81.p721==0)))" & (!"(((i0.i1.u13.p88==0)||(i5.i1.u32.p207==...203
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-06 finished in 151138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(G(!p0) U X(X(!p1)))))'
Support contains 3 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 486/486 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 356 transition count 461
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 356 transition count 461
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 356 transition count 459
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 70 place count 338 transition count 441
Iterating global reduction 1 with 18 rules applied. Total rules applied 88 place count 338 transition count 441
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 98 place count 338 transition count 431
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 332 transition count 425
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 332 transition count 425
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 115 place count 332 transition count 420
Applied a total of 115 rules in 22 ms. Remains 332 /381 variables (removed 49) and now considering 420/486 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5633074587424725351.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4028589472516751479.kers'
[2026-05-27 10:46:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5633074587424725351.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4028589472516751479.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 420 rows 332 cols 1157 entries
Finished phase 1 with 322 SingleSign rule and 0 generalized
[2026-05-27 10:46:09] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4028589472516751479.kers
Total runtime 4 ms.
[2026-05-27 10:46:09] [INFO ] Implicit Places using invariants in 345 ms returned []
[2026-05-27 10:46:09] [INFO ] Invariant cache hit.
[2026-05-27 10:46:10] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2026-05-27 10:46:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 420/752 variables, 332/342 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 752/752 variables, and 342 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 420/752 variables, 332/342 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/752 variables, 419/761 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/752 variables, 12/773 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/752 variables, and 773 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 332/381 places, 420/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60964 ms. Remains : 332/381 places, 420/486 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(G(!p0) U X(X(!p1)))))'
Stuttering acceptance computed with spot in 168 ms :[true, (OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-08 finished in 61171 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)) U X(X(X(p2)))))'
Support contains 5 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 486/486 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 357 transition count 462
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 357 transition count 462
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 357 transition count 461
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 67 place count 339 transition count 443
Iterating global reduction 1 with 18 rules applied. Total rules applied 85 place count 339 transition count 443
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 94 place count 339 transition count 434
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 101 place count 332 transition count 427
Iterating global reduction 2 with 7 rules applied. Total rules applied 108 place count 332 transition count 427
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 113 place count 332 transition count 422
Applied a total of 113 rules in 30 ms. Remains 332 /381 variables (removed 49) and now considering 422/486 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-748176130219376736.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-995357928260126923.kers'
[2026-05-27 10:47:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-748176130219376736.kers, --Pflows, --basisKERS=/tmp/petrispot-output-995357928260126923.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 422 rows 332 cols 1169 entries
Finished phase 1 with 322 SingleSign rule and 0 generalized
[2026-05-27 10:47:10] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-995357928260126923.kers
Total runtime 4 ms.
[2026-05-27 10:47:10] [INFO ] Implicit Places using invariants in 361 ms returned []
[2026-05-27 10:47:10] [INFO ] Invariant cache hit.
[2026-05-27 10:47:11] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2026-05-27 10:47:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 422/754 variables, 332/342 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 754/754 variables, and 342 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 422/754 variables, 332/342 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/754 variables, 421/763 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/754 variables, 10/773 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 754/754 variables, and 773 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 332/381 places, 422/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61161 ms. Remains : 332/381 places, 422/486 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)) U X(X(X(p2)))))'
Stuttering acceptance computed with spot in 916 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-09
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-09 finished in 62165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(p1))))))'
Support contains 3 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 486/486 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 357 transition count 462
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 357 transition count 462
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 357 transition count 460
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 340 transition count 443
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 340 transition count 443
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 93 place count 340 transition count 434
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 100 place count 333 transition count 427
Iterating global reduction 2 with 7 rules applied. Total rules applied 107 place count 333 transition count 427
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 112 place count 333 transition count 422
Applied a total of 112 rules in 31 ms. Remains 333 /381 variables (removed 48) and now considering 422/486 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-842806602132102848.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11050429205047208995.kers'
[2026-05-27 10:48:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-842806602132102848.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11050429205047208995.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 422 rows 333 cols 1165 entries
Finished phase 1 with 323 SingleSign rule and 0 generalized
[2026-05-27 10:48:12] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11050429205047208995.kers
Total runtime 4 ms.
[2026-05-27 10:48:13] [INFO ] Implicit Places using invariants in 365 ms returned []
[2026-05-27 10:48:13] [INFO ] Invariant cache hit.
[2026-05-27 10:48:13] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2026-05-27 10:48:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/333 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 422/755 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 755/755 variables, and 343 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/333 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 422/755 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/755 variables, 421/764 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 755/755 variables, and 768 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 333/381 places, 422/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61085 ms. Remains : 333/381 places, 422/486 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p0)))||p1)))'
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-10 finished in 61352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(p1) U X((G(p2) U p3))))))'
Support contains 3 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 486/486 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 358 transition count 463
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 358 transition count 463
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 358 transition count 461
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 64 place count 342 transition count 445
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 342 transition count 445
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 88 place count 342 transition count 437
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 94 place count 336 transition count 431
Iterating global reduction 2 with 6 rules applied. Total rules applied 100 place count 336 transition count 431
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 104 place count 336 transition count 427
Applied a total of 104 rules in 32 ms. Remains 336 /381 variables (removed 45) and now considering 427/486 (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-321426907632665091.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16880248151600504060.kers'
[2026-05-27 10:49:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-321426907632665091.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16880248151600504060.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 427 rows 336 cols 1183 entries
Finished phase 1 with 326 SingleSign rule and 0 generalized
[2026-05-27 10:49:14] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16880248151600504060.kers
Total runtime 5 ms.
[2026-05-27 10:49:14] [INFO ] Implicit Places using invariants in 362 ms returned []
[2026-05-27 10:49:14] [INFO ] Invariant cache hit.
[2026-05-27 10:49:15] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2026-05-27 10:49:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 427/763 variables, 336/346 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/763 variables, and 346 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 427/763 variables, 336/346 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 426/772 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/763 variables, and 782 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in LTL mode, iteration 1 : 336/381 places, 427/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61186 ms. Remains : 336/381 places, 427/486 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(p1) U X((G(p2) U p3))))))'
Stuttering acceptance computed with spot in 398 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p3), (NOT p3), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 28549 steps with 441 reset in 110 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-11 finished in 61771 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((p0||X(F(p1)))))))'
Support contains 2 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 486/486 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 357 transition count 462
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 357 transition count 462
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 357 transition count 460
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 340 transition count 443
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 340 transition count 443
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 94 place count 340 transition count 433
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 99 place count 335 transition count 428
Iterating global reduction 2 with 5 rules applied. Total rules applied 104 place count 335 transition count 428
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 107 place count 335 transition count 425
Applied a total of 107 rules in 30 ms. Remains 335 /381 variables (removed 46) and now considering 425/486 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8305416287719280332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17474939423357076965.kers'
[2026-05-27 10:50:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8305416287719280332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17474939423357076965.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 425 rows 335 cols 1175 entries
Finished phase 1 with 325 SingleSign rule and 0 generalized
[2026-05-27 10:50:15] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17474939423357076965.kers
Total runtime 6 ms.
[2026-05-27 10:50:16] [INFO ] Implicit Places using invariants in 389 ms returned []
[2026-05-27 10:50:16] [INFO ] Invariant cache hit.
[2026-05-27 10:50:16] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2026-05-27 10:50:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 425/760 variables, 335/345 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/760 variables, and 345 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 425/760 variables, 335/345 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/760 variables, 424/769 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/760 variables, and 778 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 335/381 places, 425/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61180 ms. Remains : 335/381 places, 425/486 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((p0||X(F(p1)))))))'
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 253 ms.
Product exploration explored 100000 steps with 33333 reset in 333 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 19 ms. Proved property starting from automaton with 4 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 32 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-12 finished in 62036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 381/381 places, 486/486 transitions.
Graph (trivial) has 353 edges and 381 vertex of which 49 / 381 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 339 transition count 397
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 293 transition count 397
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 93 place count 293 transition count 376
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 135 place count 272 transition count 376
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 174 place count 233 transition count 337
Iterating global reduction 2 with 39 rules applied. Total rules applied 213 place count 233 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 215 place count 233 transition count 335
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 215 place count 233 transition count 333
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 219 place count 231 transition count 333
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 226 place count 224 transition count 326
Iterating global reduction 3 with 7 rules applied. Total rules applied 233 place count 224 transition count 326
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 240 place count 224 transition count 319
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 338 place count 175 transition count 270
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 346 place count 167 transition count 262
Iterating global reduction 4 with 8 rules applied. Total rules applied 354 place count 167 transition count 262
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 362 place count 167 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 370 place count 167 transition count 246
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 372 place count 165 transition count 244
Applied a total of 372 rules in 75 ms. Remains 165 /381 variables (removed 216) and now considering 244/486 (removed 242) transitions.
[2026-05-27 10:51:17] [INFO ] Flow matrix only has 229 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5394378902612215529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15943088018707776886.kers'
[2026-05-27 10:51:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5394378902612215529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15943088018707776886.kers]
Normalized transition count is 228 out of 229 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 228 rows 164 cols 667 entries
Finished phase 1 with 155 SingleSign rule and 0 generalized
[2026-05-27 10:51:17] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15943088018707776886.kers
Total runtime 3 ms.
[2026-05-27 10:51:18] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-27 10:51:18] [INFO ] Flow matrix only has 229 transitions (discarded 15 similar events)
[2026-05-27 10:51:18] [INFO ] Invariant cache hit.
[2026-05-27 10:51:18] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2026-05-27 10:51:18] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2026-05-27 10:51:18] [INFO ] Flow matrix only has 229 transitions (discarded 15 similar events)
[2026-05-27 10:51:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 8/165 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 228/393 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/393 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/394 variables, and 175 constraints, problems are : Problem set: 0 solved, 122 unsolved in 11184 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 8/165 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 228/393 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 122/297 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/393 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/394 variables, and 297 constraints, problems are : Problem set: 0 solved, 122 unsolved in 11758 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22967ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 22967ms
Starting structural reductions in SI_LTL mode, iteration 1 : 165/381 places, 244/486 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23466 ms. Remains : 165/381 places, 244/486 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-13 finished in 23577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X((p0 U X(p1))) U (p2 U p0))||F(p3))))'
Support contains 4 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 486/486 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 358 transition count 463
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 358 transition count 463
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 358 transition count 461
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 64 place count 342 transition count 445
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 342 transition count 445
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 88 place count 342 transition count 437
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 95 place count 335 transition count 430
Iterating global reduction 2 with 7 rules applied. Total rules applied 102 place count 335 transition count 430
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 107 place count 335 transition count 425
Applied a total of 107 rules in 34 ms. Remains 335 /381 variables (removed 46) and now considering 425/486 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7555153701486068128.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1890937599417434978.kers'
[2026-05-27 10:51:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7555153701486068128.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1890937599417434978.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 425 rows 335 cols 1175 entries
Finished phase 1 with 325 SingleSign rule and 0 generalized
[2026-05-27 10:51:41] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1890937599417434978.kers
Total runtime 5 ms.
[2026-05-27 10:51:41] [INFO ] Implicit Places using invariants in 345 ms returned []
[2026-05-27 10:51:41] [INFO ] Invariant cache hit.
[2026-05-27 10:51:42] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2026-05-27 10:51:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 425/760 variables, 335/345 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/760 variables, and 345 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 425/760 variables, 335/345 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/760 variables, 424/769 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/760 variables, and 781 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 335/381 places, 425/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60936 ms. Remains : 335/381 places, 425/486 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X((p0 U X(p1))) U (p2 U p0))||F(p3))))'
Stuttering acceptance computed with spot in 461 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-14
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-14 finished in 61455 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||X(X(!p1)))&&(F(p2)||X(X(!p1)))))))'
Support contains 3 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 486/486 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 357 transition count 462
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 357 transition count 462
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 357 transition count 460
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 68 place count 339 transition count 442
Iterating global reduction 1 with 18 rules applied. Total rules applied 86 place count 339 transition count 442
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 96 place count 339 transition count 432
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 102 place count 333 transition count 426
Iterating global reduction 2 with 6 rules applied. Total rules applied 108 place count 333 transition count 426
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 112 place count 333 transition count 422
Applied a total of 112 rules in 25 ms. Remains 333 /381 variables (removed 48) and now considering 422/486 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14253424653130291868.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8216338177898007692.kers'
[2026-05-27 10:52:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14253424653130291868.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8216338177898007692.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 422 rows 333 cols 1165 entries
Finished phase 1 with 323 SingleSign rule and 0 generalized
[2026-05-27 10:52:42] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8216338177898007692.kers
Total runtime 6 ms.
[2026-05-27 10:52:43] [INFO ] Implicit Places using invariants in 372 ms returned []
[2026-05-27 10:52:43] [INFO ] Invariant cache hit.
[2026-05-27 10:52:43] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2026-05-27 10:52:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/333 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 422/755 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 755/755 variables, and 343 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/333 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 422/755 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/755 variables, 421/764 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 755/755 variables, and 772 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 333/381 places, 422/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61055 ms. Remains : 333/381 places, 422/486 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||X(X(p1)))&&(F(p2)||X(X(p1)))))))'
Stuttering acceptance computed with spot in 389 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-15
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-15 finished in 61511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&F(p2)))))'
Spot run failed in 56 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-27 10:53:44] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17188666291147176623
[2026-05-27 10:53:44] [INFO ] Computing symmetric may disable matrix : 486 transitions.
[2026-05-27 10:53:44] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 10:53:44] [INFO ] Applying decomposition
[2026-05-27 10:53:44] [INFO ] Computing symmetric may enable matrix : 486 transitions.
[2026-05-27 10:53:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 10:53:44] [INFO ] Flatten gal took : 33 ms
[2026-05-27 10:53:44] [INFO ] Computing Do-Not-Accords matrix : 486 transitions.
[2026-05-27 10:53:44] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 10:53:44] [INFO ] Built C files in 120ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17188666291147176623
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/graph7158989241962211070.txt' '-o' '/tmp/graph7158989241962211070.bin' '-w' '/tmp/graph7158989241962211070.weights'
Running compilation step : cd /tmp/ltsmin17188666291147176623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7158989241962211070.bin' '-l' '-1' '-v' '-w' '/tmp/graph7158989241962211070.weights' '-q' '0' '-e' '0.001'
[2026-05-27 10:53:44] [INFO ] Decomposing Gal with order
[2026-05-27 10:53:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 10:53:44] [INFO ] Removed a total of 238 redundant transitions.
[2026-05-27 10:53:44] [INFO ] Flatten gal took : 76 ms
[2026-05-27 10:53:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 27 ms.
[2026-05-27 10:53:44] [INFO ] Time to serialize gal into /tmp/LTLFireability6883905998912973275.gal : 8 ms
[2026-05-27 10:53:44] [INFO ] Time to serialize properties into /tmp/LTLFireability17962939099387239674.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/LTLFireability6883905998912973275.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17962939099387239674.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 1 LTL properties
Checking formula 0 : !((X((G("(((i6.i0.u45.p290==0)||(i1.i1.u4.p88==0))||((i5.i0.u38.p207==0)||(i15.u96.p721==0)))"))||(("(((i1.i1.u4.p88==0)||(i5.i0.u38.p...217
Formula 0 simplified : X(F!"(((i6.i0.u45.p290==0)||(i1.i1.u4.p88==0))||((i5.i0.u38.p207==0)||(i15.u96.p721==0)))" & (!"(((i1.i1.u4.p88==0)||(i5.i0.u38.p207...209
Compilation finished in 1753 ms.
Running link step : cd /tmp/ltsmin17188666291147176623;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17188666291147176623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(([]((LTLAPp0==true))||((LTLAPp1==true)&&<>((LTLAPp2==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t70, t84, t103, t104, t136, t137, t173, t174, t209, t210, t246, t247, t281, t282, t334, t...1572
Computing Next relation with stutter on 7.42803e+10 deadlock states
Detected timeout of ITS tools.
[2026-05-27 11:18:28] [INFO ] Applying decomposition
[2026-05-27 11:18:29] [INFO ] Flatten gal took : 693 ms
[2026-05-27 11:18:29] [INFO ] Decomposing Gal with order
[2026-05-27 11:18:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 11:18:30] [INFO ] Removed a total of 117 redundant transitions.
[2026-05-27 11:18:30] [INFO ] Flatten gal took : 688 ms
[2026-05-27 11:18:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 327 labels/synchronizations in 319 ms.
[2026-05-27 11:18:31] [INFO ] Time to serialize gal into /tmp/LTLFireability11290446992916345273.gal : 150 ms
[2026-05-27 11:18:31] [INFO ] Time to serialize properties into /tmp/LTLFireability4288728521541295137.ltl : 18 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/LTLFireability11290446992916345273.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4288728521541295137.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 1 LTL properties
Checking formula 0 : !((X((G("(((i0.i0.i0.i0.i0.u11.p290==0)||(i0.i0.i0.i0.i0.i0.i0.u8.p88==0))||((i0.i0.i0.i0.i0.i0.u10.p207==0)||(i1.u17.p721==0)))"))||(...284
Formula 0 simplified : X(F!"(((i0.i0.i0.i0.i0.u11.p290==0)||(i0.i0.i0.i0.i0.i0.i0.u8.p88==0))||((i0.i0.i0.i0.i0.i0.u10.p207==0)||(i1.u17.p721==0)))" & (!"(...276

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="FlexibleBarrier-PT-08b"
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 FlexibleBarrier-PT-08b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-177955809100348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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