Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860066800124.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is DLCround-PT-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860066800124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 944K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 432K May 29 14:32 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 DLCround-PT-03b-LTLFireability-00
FORMULA_NAME DLCround-PT-03b-LTLFireability-01
FORMULA_NAME DLCround-PT-03b-LTLFireability-02
FORMULA_NAME DLCround-PT-03b-LTLFireability-03
FORMULA_NAME DLCround-PT-03b-LTLFireability-04
FORMULA_NAME DLCround-PT-03b-LTLFireability-05
FORMULA_NAME DLCround-PT-03b-LTLFireability-06
FORMULA_NAME DLCround-PT-03b-LTLFireability-07
FORMULA_NAME DLCround-PT-03b-LTLFireability-08
FORMULA_NAME DLCround-PT-03b-LTLFireability-09
FORMULA_NAME DLCround-PT-03b-LTLFireability-10
FORMULA_NAME DLCround-PT-03b-LTLFireability-11
FORMULA_NAME DLCround-PT-03b-LTLFireability-12
FORMULA_NAME DLCround-PT-03b-LTLFireability-13
FORMULA_NAME DLCround-PT-03b-LTLFireability-14
FORMULA_NAME DLCround-PT-03b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748663344064

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 03:49:05] [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]
[2025-05-31 03:49:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 03:49:05] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2025-05-31 03:49:05] [INFO ] Transformed 1383 places.
[2025-05-31 03:49:05] [INFO ] Transformed 1887 transitions.
[2025-05-31 03:49:05] [INFO ] Found NUPN structural information;
[2025-05-31 03:49:05] [INFO ] Parsed PT model containing 1383 places and 1887 transitions and 4809 arcs in 226 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA DLCround-PT-03b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 1383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1383/1383 places, 1887/1887 transitions.
Discarding 228 places :
Symmetric choice reduction at 0 with 228 rule applications. Total rules 228 place count 1155 transition count 1659
Iterating global reduction 0 with 228 rules applied. Total rules applied 456 place count 1155 transition count 1659
Discarding 171 places :
Symmetric choice reduction at 0 with 171 rule applications. Total rules 627 place count 984 transition count 1488
Iterating global reduction 0 with 171 rules applied. Total rules applied 798 place count 984 transition count 1488
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 802 place count 984 transition count 1484
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 841 place count 945 transition count 1417
Iterating global reduction 1 with 39 rules applied. Total rules applied 880 place count 945 transition count 1417
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 908 place count 917 transition count 1389
Iterating global reduction 1 with 28 rules applied. Total rules applied 936 place count 917 transition count 1389
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 940 place count 917 transition count 1385
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 953 place count 904 transition count 1372
Iterating global reduction 2 with 13 rules applied. Total rules applied 966 place count 904 transition count 1372
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 979 place count 891 transition count 1359
Iterating global reduction 2 with 13 rules applied. Total rules applied 992 place count 891 transition count 1359
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1005 place count 878 transition count 1346
Iterating global reduction 2 with 13 rules applied. Total rules applied 1018 place count 878 transition count 1346
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1026 place count 870 transition count 1338
Iterating global reduction 2 with 8 rules applied. Total rules applied 1034 place count 870 transition count 1338
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1039 place count 865 transition count 1333
Iterating global reduction 2 with 5 rules applied. Total rules applied 1044 place count 865 transition count 1333
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1049 place count 860 transition count 1328
Iterating global reduction 2 with 5 rules applied. Total rules applied 1054 place count 860 transition count 1328
Applied a total of 1054 rules in 561 ms. Remains 860 /1383 variables (removed 523) and now considering 1328/1887 (removed 559) transitions.
// Phase 1: matrix 1328 rows 860 cols
[2025-05-31 03:49:06] [INFO ] Computed 52 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:49:06] [INFO ] Implicit Places using invariants in 508 ms returned []
[2025-05-31 03:49:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:49:07] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
Running 1327 sub problems to find dead transitions.
[2025-05-31 03:49:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s463 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 859/2188 variables, and 0 constraints, problems are : Problem set: 0 solved, 1327 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/52 constraints, State Equation: 0/860 constraints, PredecessorRefiner: 1327/1327 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1327 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 859/2188 variables, and 0 constraints, problems are : Problem set: 0 solved, 1327 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/52 constraints, State Equation: 0/860 constraints, PredecessorRefiner: 0/1327 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60453ms problems are : Problem set: 0 solved, 1327 unsolved
Search for dead transitions found 0 dead transitions in 60475ms
Starting structural reductions in LTL mode, iteration 1 : 860/1383 places, 1328/1887 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62290 ms. Remains : 860/1383 places, 1328/1887 transitions.
Support contains 29 out of 860 places after structural reductions.
[2025-05-31 03:50:08] [INFO ] Flatten gal took : 108 ms
[2025-05-31 03:50:08] [INFO ] Flatten gal took : 62 ms
[2025-05-31 03:50:08] [INFO ] Input system was already deterministic with 1328 transitions.
RANDOM walk for 40000 steps (8 resets) in 1683 ms. (23 steps per ms) remains 3/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
[2025-05-31 03:50:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 358/365 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 495/860 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/860 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1328/2188 variables, 860/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2188 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/2188 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2188/2188 variables, and 912 constraints, problems are : Problem set: 0 solved, 3 unsolved in 660 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 860/860 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 358/365 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 495/860 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/860 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1328/2188 variables, 860/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2188 variables, 3/915 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2188 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/2188 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2188/2188 variables, and 915 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1279 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 860/860 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1954ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 2 properties in 289 ms.
Support contains 3 out of 860 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 860/860 places, 1328/1328 transitions.
Graph (trivial) has 808 edges and 860 vertex of which 242 / 860 are part of one of the 19 SCC in 5 ms
Free SCC test removed 223 places
Drop transitions (Empty/Sink Transition effects.) removed 254 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 261 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 176 transitions
Trivial Post-agglo rules discarded 176 transitions
Performed 176 trivial Post agglomeration. Transition count delta: 176
Iterating post reduction 0 with 176 rules applied. Total rules applied 177 place count 637 transition count 891
Reduce places removed 176 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 200 rules applied. Total rules applied 377 place count 461 transition count 867
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 393 place count 445 transition count 867
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 393 place count 445 transition count 812
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 503 place count 390 transition count 812
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 539 place count 354 transition count 683
Iterating global reduction 3 with 36 rules applied. Total rules applied 575 place count 354 transition count 683
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 578 place count 354 transition count 680
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 578 place count 354 transition count 676
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 586 place count 350 transition count 676
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 587 place count 349 transition count 672
Iterating global reduction 4 with 1 rules applied. Total rules applied 588 place count 349 transition count 672
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 589 place count 349 transition count 671
Performed 127 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 5 with 254 rules applied. Total rules applied 843 place count 222 transition count 540
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 847 place count 222 transition count 536
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 860 place count 209 transition count 457
Iterating global reduction 6 with 13 rules applied. Total rules applied 873 place count 209 transition count 457
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 885 place count 209 transition count 445
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 7 with 2 rules applied. Total rules applied 887 place count 208 transition count 444
Performed 28 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 943 place count 180 transition count 585
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 955 place count 180 transition count 573
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 966 place count 169 transition count 439
Iterating global reduction 8 with 11 rules applied. Total rules applied 977 place count 169 transition count 439
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 1001 place count 169 transition count 415
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 9 with 49 rules applied. Total rules applied 1050 place count 169 transition count 366
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1054 place count 165 transition count 337
Iterating global reduction 9 with 4 rules applied. Total rules applied 1058 place count 165 transition count 337
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1062 place count 165 transition count 333
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1070 place count 161 transition count 366
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1075 place count 161 transition count 361
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 11 with 22 rules applied. Total rules applied 1097 place count 161 transition count 339
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 1105 place count 157 transition count 366
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1111 place count 157 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 1132 place count 157 transition count 339
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1140 place count 153 transition count 366
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1146 place count 153 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 1167 place count 153 transition count 339
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1175 place count 149 transition count 368
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1181 place count 149 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 1202 place count 149 transition count 341
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 1210 place count 145 transition count 369
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 1217 place count 145 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 15 with 20 rules applied. Total rules applied 1237 place count 145 transition count 342
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 1245 place count 141 transition count 369
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1251 place count 141 transition count 363
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 1272 place count 141 transition count 342
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 1280 place count 137 transition count 369
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 1285 place count 137 transition count 364
Renaming transitions due to excessive name length > 1024 char.
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 1306 place count 137 transition count 343
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 1314 place count 133 transition count 366
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 1318 place count 133 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 18 with 19 rules applied. Total rules applied 1337 place count 133 transition count 343
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 1345 place count 129 transition count 365
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 1349 place count 129 transition count 361
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 19 with 19 rules applied. Total rules applied 1368 place count 129 transition count 342
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 19 with 6 rules applied. Total rules applied 1374 place count 126 transition count 352
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 1377 place count 126 transition count 349
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 20 with 10 rules applied. Total rules applied 1387 place count 126 transition count 339
Free-agglomeration rule applied 22 times with reduction of 2 identical transitions.
Iterating global reduction 20 with 22 rules applied. Total rules applied 1409 place count 126 transition count 315
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 109 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 116 transitions.
Graph (complete) has 310 edges and 104 vertex of which 92 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Iterating post reduction 20 with 139 rules applied. Total rules applied 1548 place count 92 transition count 199
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 21 with 12 rules applied. Total rules applied 1560 place count 92 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 22 with 22 rules applied. Total rules applied 1582 place count 92 transition count 165
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 22 with 1 rules applied. Total rules applied 1583 place count 91 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 1585 place count 89 transition count 164
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 23 with 24 rules applied. Total rules applied 1609 place count 73 transition count 156
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 23 with 20 rules applied. Total rules applied 1629 place count 73 transition count 136
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 24 with 36 rules applied. Total rules applied 1665 place count 49 transition count 124
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 28 transitions.
Graph (trivial) has 9 edges and 49 vertex of which 8 / 49 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 29 rules applied. Total rules applied 1694 place count 45 transition count 96
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 39 transitions.
Graph (complete) has 73 edges and 41 vertex of which 25 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Iterating post reduction 25 with 44 rules applied. Total rules applied 1738 place count 25 transition count 49
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 26 with 8 rules applied. Total rules applied 1746 place count 25 transition count 41
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 27 with 21 rules applied. Total rules applied 1767 place count 11 transition count 34
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 27 with 18 rules applied. Total rules applied 1785 place count 11 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 28 with 4 rules applied. Total rules applied 1789 place count 11 transition count 12
Graph (complete) has 18 edges and 11 vertex of which 7 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 28 with 1 rules applied. Total rules applied 1790 place count 7 transition count 12
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 1794 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 30 with 1 Pre rules applied. Total rules applied 1794 place count 7 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 1796 place count 6 transition count 7
Applied a total of 1796 rules in 381 ms. Remains 6 /860 variables (removed 854) and now considering 7/1328 (removed 1321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 381 ms. Remains : 6/860 places, 7/1328 transitions.
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Computed a total of 104 stabilizing places and 104 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||G((G(p1) U X(p2)))) U X(p3))))'
Support contains 4 out of 860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 860/860 places, 1328/1328 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 850 transition count 1318
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 850 transition count 1318
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 842 transition count 1310
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 842 transition count 1310
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 837 transition count 1305
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 837 transition count 1305
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 834 transition count 1302
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 834 transition count 1302
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 832 transition count 1300
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 832 transition count 1300
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 830 transition count 1298
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 830 transition count 1298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 829 transition count 1297
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 829 transition count 1297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 828 transition count 1296
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 828 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 827 transition count 1295
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 827 transition count 1295
Applied a total of 66 rules in 158 ms. Remains 827 /860 variables (removed 33) and now considering 1295/1328 (removed 33) transitions.
// Phase 1: matrix 1295 rows 827 cols
[2025-05-31 03:50:12] [INFO ] Computed 52 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:50:12] [INFO ] Implicit Places using invariants in 280 ms returned []
[2025-05-31 03:50:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:50:13] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 942 ms to find 0 implicit places.
Running 1294 sub problems to find dead transitions.
[2025-05-31 03:50:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/826 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1294 unsolved
SMT process timed out in 30232ms, After SMT, problems are : Problem set: 0 solved, 1294 unsolved
Search for dead transitions found 0 dead transitions in 30237ms
Starting structural reductions in LTL mode, iteration 1 : 827/860 places, 1295/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31343 ms. Remains : 827/860 places, 1295/1328 transitions.
Stuttering acceptance computed with spot in 685 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 13130 steps with 8 reset in 88 ms.
FORMULA DLCround-PT-03b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-01 finished in 32202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 860 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 860/860 places, 1328/1328 transitions.
Graph (trivial) has 811 edges and 860 vertex of which 234 / 860 are part of one of the 21 SCC in 3 ms
Free SCC test removed 213 places
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 178 transitions
Trivial Post-agglo rules discarded 178 transitions
Performed 178 trivial Post agglomeration. Transition count delta: 178
Iterating post reduction 0 with 178 rules applied. Total rules applied 179 place count 646 transition count 920
Reduce places removed 178 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 202 rules applied. Total rules applied 381 place count 468 transition count 896
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 397 place count 452 transition count 896
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 397 place count 452 transition count 839
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 511 place count 395 transition count 839
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 546 place count 360 transition count 705
Iterating global reduction 3 with 35 rules applied. Total rules applied 581 place count 360 transition count 705
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 584 place count 360 transition count 702
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 584 place count 360 transition count 698
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 592 place count 356 transition count 698
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 593 place count 355 transition count 694
Iterating global reduction 4 with 1 rules applied. Total rules applied 594 place count 355 transition count 694
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 595 place count 355 transition count 693
Performed 129 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 5 with 258 rules applied. Total rules applied 853 place count 226 transition count 560
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 858 place count 226 transition count 555
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 869 place count 215 transition count 490
Iterating global reduction 6 with 11 rules applied. Total rules applied 880 place count 215 transition count 490
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 890 place count 215 transition count 480
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 894 place count 213 transition count 478
Performed 17 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 928 place count 196 transition count 568
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 929 place count 196 transition count 567
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 933 place count 192 transition count 529
Iterating global reduction 8 with 4 rules applied. Total rules applied 937 place count 192 transition count 529
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 954 place count 192 transition count 512
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 9 with 17 rules applied. Total rules applied 971 place count 192 transition count 495
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 977 place count 186 transition count 483
Iterating global reduction 9 with 6 rules applied. Total rules applied 983 place count 186 transition count 483
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 989 place count 180 transition count 441
Iterating global reduction 9 with 6 rules applied. Total rules applied 995 place count 180 transition count 441
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1001 place count 180 transition count 435
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1002 place count 179 transition count 434
Applied a total of 1002 rules in 161 ms. Remains 179 /860 variables (removed 681) and now considering 434/1328 (removed 894) transitions.
[2025-05-31 03:50:44] [INFO ] Flow matrix only has 410 transitions (discarded 24 similar events)
// Phase 1: matrix 410 rows 179 cols
[2025-05-31 03:50:44] [INFO ] Computed 52 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:50:44] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-05-31 03:50:44] [INFO ] Flow matrix only has 410 transitions (discarded 24 similar events)
[2025-05-31 03:50:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:50:44] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 03:50:44] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 03:50:44] [INFO ] Redundant transitions in 22 ms returned []
Running 389 sub problems to find dead transitions.
[2025-05-31 03:50:44] [INFO ] Flow matrix only has 410 transitions (discarded 24 similar events)
[2025-05-31 03:50:44] [INFO ] Invariant cache hit.
[2025-05-31 03:50:44] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 2/179 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 409/588 variables, 179/231 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 39/270 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (OVERLAPS) 0/588 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 588/589 variables, and 270 constraints, problems are : Problem set: 0 solved, 389 unsolved in 22146 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 179/179 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 2/179 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 409/588 variables, 179/231 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 39/270 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 389/659 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 0/588 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 588/589 variables, and 659 constraints, problems are : Problem set: 0 solved, 389 unsolved in 27252 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 179/179 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49514ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 49515ms
Starting structural reductions in SI_LTL mode, iteration 1 : 179/860 places, 434/1328 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49971 ms. Remains : 179/860 places, 434/1328 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-03
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 4 ms.
FORMULA DLCround-PT-03b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-03 finished in 50039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(F(!p0))||(F(!p0)&&X(F((p1&&X((p1 U (p2||G(p1)))))))))))'
Support contains 3 out of 860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 860/860 places, 1328/1328 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 850 transition count 1318
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 850 transition count 1318
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 843 transition count 1311
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 843 transition count 1311
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 838 transition count 1306
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 838 transition count 1306
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 835 transition count 1303
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 835 transition count 1303
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 833 transition count 1301
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 833 transition count 1301
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 831 transition count 1299
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 831 transition count 1299
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 829 transition count 1297
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 829 transition count 1297
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 827 transition count 1295
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 827 transition count 1295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 826 transition count 1294
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 826 transition count 1294
Applied a total of 68 rules in 159 ms. Remains 826 /860 variables (removed 34) and now considering 1294/1328 (removed 34) transitions.
// Phase 1: matrix 1294 rows 826 cols
[2025-05-31 03:51:34] [INFO ] Computed 52 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:51:34] [INFO ] Implicit Places using invariants in 272 ms returned []
[2025-05-31 03:51:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:51:35] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
Running 1293 sub problems to find dead transitions.
[2025-05-31 03:51:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/825 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
SMT process timed out in 30215ms, After SMT, problems are : Problem set: 0 solved, 1293 unsolved
Search for dead transitions found 0 dead transitions in 30219ms
Starting structural reductions in LTL mode, iteration 1 : 826/860 places, 1294/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31289 ms. Remains : 826/860 places, 1294/1328 transitions.
Stuttering acceptance computed with spot in 280 ms :[true, (NOT p0), p0, (AND p0 (NOT p1)), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-06
Product exploration explored 100000 steps with 151 reset in 306 ms.
Product exploration explored 100000 steps with 139 reset in 373 ms.
Computed a total of 102 stabilizing places and 102 stable transitions
Computed a total of 102 stabilizing places and 102 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 152 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND p0 (NOT p1)), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 296 ms. (134 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
[2025-05-31 03:52:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 170/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 653/826 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/826 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1294/2120 variables, 826/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2120 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2120 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2120/2120 variables, and 878 constraints, problems are : Problem set: 0 solved, 1 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 826/826 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
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 170/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 653/826 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/826 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1294/2120 variables, 826/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2120 variables, 1/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:52:08] [INFO ] Deduced a trap along path composed of 5 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:52:08] [INFO ] Deduced a trap along path composed of 5 places in 29 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2120 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2120 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2120 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2120/2120 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 766 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 826/826 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1339ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 3 out of 826 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 826/826 places, 1294/1294 transitions.
Graph (trivial) has 773 edges and 826 vertex of which 234 / 826 are part of one of the 21 SCC in 1 ms
Free SCC test removed 213 places
Drop transitions (Empty/Sink Transition effects.) removed 244 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 251 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 151 place count 613 transition count 893
Reduce places removed 150 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 174 rules applied. Total rules applied 325 place count 463 transition count 869
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 341 place count 447 transition count 869
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 341 place count 447 transition count 810
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 459 place count 388 transition count 810
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 488 place count 359 transition count 679
Iterating global reduction 3 with 29 rules applied. Total rules applied 517 place count 359 transition count 679
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 521 place count 359 transition count 675
Performed 131 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 4 with 262 rules applied. Total rules applied 783 place count 228 transition count 540
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 787 place count 228 transition count 536
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 797 place count 218 transition count 475
Iterating global reduction 5 with 10 rules applied. Total rules applied 807 place count 218 transition count 475
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 816 place count 218 transition count 466
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 6 with 2 rules applied. Total rules applied 818 place count 217 transition count 465
Performed 29 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 876 place count 188 transition count 604
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 882 place count 188 transition count 598
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 893 place count 177 transition count 466
Iterating global reduction 7 with 11 rules applied. Total rules applied 904 place count 177 transition count 466
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 926 place count 177 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 8 with 43 rules applied. Total rules applied 969 place count 177 transition count 401
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 973 place count 173 transition count 373
Iterating global reduction 8 with 4 rules applied. Total rules applied 977 place count 173 transition count 373
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 981 place count 173 transition count 369
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 989 place count 169 transition count 397
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 994 place count 169 transition count 392
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 10 with 22 rules applied. Total rules applied 1016 place count 169 transition count 370
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1024 place count 165 transition count 401
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 1031 place count 165 transition count 394
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 11 with 20 rules applied. Total rules applied 1051 place count 165 transition count 374
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 1059 place count 161 transition count 416
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 1069 place count 161 transition count 406
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 12 with 27 rules applied. Total rules applied 1096 place count 161 transition count 379
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1104 place count 157 transition count 417
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1113 place count 157 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 13 with 28 rules applied. Total rules applied 1141 place count 157 transition count 380
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1149 place count 153 transition count 404
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1154 place count 153 transition count 399
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 14 with 18 rules applied. Total rules applied 1172 place count 153 transition count 381
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 1178 place count 150 transition count 404
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 1183 place count 150 transition count 399
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 15 with 18 rules applied. Total rules applied 1201 place count 150 transition count 381
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 15 with 6 rules applied. Total rules applied 1207 place count 147 transition count 405
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 1211 place count 147 transition count 401
Renaming transitions due to excessive name length > 1024 char.
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 16 with 19 rules applied. Total rules applied 1230 place count 147 transition count 382
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 16 with 6 rules applied. Total rules applied 1236 place count 144 transition count 405
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 1241 place count 144 transition count 400
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 17 with 18 rules applied. Total rules applied 1259 place count 144 transition count 382
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 17 with 6 rules applied. Total rules applied 1265 place count 141 transition count 403
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 1268 place count 141 transition count 400
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 18 with 18 rules applied. Total rules applied 1286 place count 141 transition count 382
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 18 with 6 rules applied. Total rules applied 1292 place count 138 transition count 404
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 18 with 5 rules applied. Total rules applied 1297 place count 138 transition count 399
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 19 with 20 rules applied. Total rules applied 1317 place count 138 transition count 379
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 19 with 6 rules applied. Total rules applied 1323 place count 135 transition count 408
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 1330 place count 135 transition count 401
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 20 with 23 rules applied. Total rules applied 1353 place count 135 transition count 378
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 20 with 6 rules applied. Total rules applied 1359 place count 132 transition count 397
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 1362 place count 132 transition count 394
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 21 with 17 rules applied. Total rules applied 1379 place count 132 transition count 377
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 1381 place count 131 transition count 380
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 1382 place count 131 transition count 379
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 22 with 3 rules applied. Total rules applied 1385 place count 131 transition count 376
Free-agglomeration rule applied 22 times.
Iterating global reduction 22 with 22 rules applied. Total rules applied 1407 place count 131 transition count 354
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 102 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 104 transitions.
Graph (complete) has 344 edges and 109 vertex of which 97 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Iterating post reduction 22 with 127 rules applied. Total rules applied 1534 place count 97 transition count 250
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 23 with 12 rules applied. Total rules applied 1546 place count 97 transition count 238
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 24 with 45 rules applied. Total rules applied 1591 place count 97 transition count 193
Graph (complete) has 299 edges and 97 vertex of which 91 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Iterating post reduction 24 with 1 rules applied. Total rules applied 1592 place count 91 transition count 193
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 25 with 6 rules applied. Total rules applied 1598 place count 91 transition count 187
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 1599 place count 91 transition count 187
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 26 with 1 rules applied. Total rules applied 1600 place count 90 transition count 186
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 26 with 3 rules applied. Total rules applied 1603 place count 87 transition count 186
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 27 with 33 rules applied. Total rules applied 1636 place count 65 transition count 175
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 27 with 34 rules applied. Total rules applied 1670 place count 65 transition count 141
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 28 with 47 rules applied. Total rules applied 1717 place count 34 transition count 125
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (trivial) has 13 edges and 34 vertex of which 8 / 34 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 50 rules applied. Total rules applied 1767 place count 30 transition count 76
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 56 edges and 27 vertex of which 19 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Iterating post reduction 29 with 29 rules applied. Total rules applied 1796 place count 19 transition count 48
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 30 with 5 rules applied. Total rules applied 1801 place count 19 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 31 with 1 Pre rules applied. Total rules applied 1801 place count 19 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 1803 place count 18 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 31 with 9 rules applied. Total rules applied 1812 place count 12 transition count 39
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 31 with 18 rules applied. Total rules applied 1830 place count 12 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 32 with 6 rules applied. Total rules applied 1836 place count 12 transition count 15
Graph (complete) has 17 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 32 with 1 rules applied. Total rules applied 1837 place count 10 transition count 15
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 33 with 6 rules applied. Total rules applied 1843 place count 10 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 1845 place count 8 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 35 with 1 Pre rules applied. Total rules applied 1845 place count 8 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 1847 place count 7 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 35 with 1 rules applied. Total rules applied 1848 place count 7 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 35 with 1 Pre rules applied. Total rules applied 1848 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 1850 place count 6 transition count 6
Applied a total of 1850 rules in 201 ms. Remains 6 /826 variables (removed 820) and now considering 6/1294 (removed 1288) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 6/826 places, 6/1294 transitions.
RANDOM walk for 54 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0) p2))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F p0)]
Knowledge based reduction with 14 factoid took 395 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND p0 (NOT p1)), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND p0 (NOT p1)), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2))]
[2025-05-31 03:52:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 03:52:10] [INFO ] [Real]Absence check using 52 positive place invariants in 86 ms returned sat
[2025-05-31 03:52:13] [INFO ] [Real]Absence check using state equation in 3276 ms returned sat
[2025-05-31 03:52:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 03:52:13] [INFO ] [Nat]Absence check using 52 positive place invariants in 69 ms returned sat
[2025-05-31 03:52:16] [INFO ] [Nat]Absence check using state equation in 2266 ms returned sat
[2025-05-31 03:52:16] [INFO ] Computed and/alt/rep : 1261/2374/1261 causal constraints (skipped 32 transitions) in 57 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-05-31 03:52:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
[2025-05-31 03:52:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 03:52:28] [INFO ] [Real]Absence check using 52 positive place invariants in 89 ms returned sat
[2025-05-31 03:52:31] [INFO ] [Real]Absence check using state equation in 3093 ms returned sat
[2025-05-31 03:52:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 03:52:32] [INFO ] [Nat]Absence check using 52 positive place invariants in 71 ms returned sat
[2025-05-31 03:52:34] [INFO ] [Nat]Absence check using state equation in 2298 ms returned sat
[2025-05-31 03:52:34] [INFO ] Computed and/alt/rep : 1261/2374/1261 causal constraints (skipped 32 transitions) in 66 ms.
Could not prove EG (NOT p0)
Support contains 3 out of 826 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 826/826 places, 1294/1294 transitions.
Applied a total of 0 rules in 16 ms. Remains 826 /826 variables (removed 0) and now considering 1294/1294 (removed 0) transitions.
[2025-05-31 03:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:52:47] [INFO ] Implicit Places using invariants in 268 ms returned []
[2025-05-31 03:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:52:47] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
Running 1293 sub problems to find dead transitions.
[2025-05-31 03:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/825 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
SMT process timed out in 30229ms, After SMT, problems are : Problem set: 0 solved, 1293 unsolved
Search for dead transitions found 0 dead transitions in 30234ms
Finished structural reductions in LTL mode , in 1 iterations and 31170 ms. Remains : 826/826 places, 1294/1294 transitions.
Computed a total of 102 stabilizing places and 102 stable transitions
Computed a total of 102 stabilizing places and 102 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 151 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND p0 (NOT p1)), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 179 ms. (222 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
[2025-05-31 03:53:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 170/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 653/826 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/826 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1294/2120 variables, 826/878 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2120 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/2120 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2120/2120 variables, and 878 constraints, problems are : Problem set: 0 solved, 3 unsolved in 836 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 826/826 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 170/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 653/826 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:53:19] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/826 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/826 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1294/2120 variables, 826/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2120 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2120 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/2120 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2120/2120 variables, and 882 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1089 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 826/826 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1934ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 751 steps, including 1 resets, run visited all 3 properties in 10 ms. (steps per millisecond=75 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 15 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : [(F p1), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0) p2))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F p0)]
Knowledge based reduction with 14 factoid took 422 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND p0 (NOT p1)), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND p0 (NOT p1)), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2))]
[2025-05-31 03:53:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 03:53:22] [INFO ] [Real]Absence check using 52 positive place invariants in 91 ms returned sat
[2025-05-31 03:53:25] [INFO ] [Real]Absence check using state equation in 3340 ms returned sat
[2025-05-31 03:53:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 03:53:25] [INFO ] [Nat]Absence check using 52 positive place invariants in 74 ms returned sat
[2025-05-31 03:53:28] [INFO ] [Nat]Absence check using state equation in 2437 ms returned sat
[2025-05-31 03:53:28] [INFO ] Computed and/alt/rep : 1261/2374/1261 causal constraints (skipped 32 transitions) in 61 ms.
[2025-05-31 03:53:40] [INFO ] Added : 720 causal constraints over 144 iterations in 12069 ms. Result :unknown
Could not prove EG (NOT p1)
[2025-05-31 03:53:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 03:53:40] [INFO ] [Real]Absence check using 52 positive place invariants in 85 ms returned sat
[2025-05-31 03:53:43] [INFO ] [Real]Absence check using state equation in 2922 ms returned sat
[2025-05-31 03:53:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 03:53:44] [INFO ] [Nat]Absence check using 52 positive place invariants in 73 ms returned sat
[2025-05-31 03:53:46] [INFO ] [Nat]Absence check using state equation in 2187 ms returned sat
[2025-05-31 03:53:46] [INFO ] Computed and/alt/rep : 1261/2374/1261 causal constraints (skipped 32 transitions) in 64 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-05-31 03:53:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND p0 (NOT p1)), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 154 reset in 221 ms.
Product exploration explored 100000 steps with 155 reset in 246 ms.
Applying partial POR strategy [false, true, false, false, false, false]
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND p0 (NOT p1)), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2))]
Support contains 3 out of 826 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 826/826 places, 1294/1294 transitions.
Graph (trivial) has 773 edges and 826 vertex of which 234 / 826 are part of one of the 21 SCC in 3 ms
Free SCC test removed 213 places
Ensure Unique test removed 230 transitions
Reduce isomorphic transitions removed 230 transitions.
Performed 149 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 149 rules applied. Total rules applied 150 place count 613 transition count 1064
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 16 rules applied. Total rules applied 166 place count 613 transition count 1056
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 166 place count 613 transition count 1061
Deduced a syphon composed of 167 places in 1 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 176 place count 613 transition count 1061
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 266 place count 523 transition count 869
Deduced a syphon composed of 106 places in 1 ms
Iterating global reduction 2 with 90 rules applied. Total rules applied 356 place count 523 transition count 869
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 360 place count 523 transition count 865
Performed 181 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 287 places in 0 ms
Iterating global reduction 3 with 181 rules applied. Total rules applied 541 place count 523 transition count 868
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 545 place count 523 transition count 864
Discarding 145 places :
Symmetric choice reduction at 4 with 145 rule applications. Total rules 690 place count 378 transition count 668
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 4 with 145 rules applied. Total rules applied 835 place count 378 transition count 668
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 844 place count 378 transition count 659
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 848 place count 374 transition count 655
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 5 with 4 rules applied. Total rules applied 852 place count 374 transition count 655
Performed 25 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 173 places in 0 ms
Iterating global reduction 5 with 25 rules applied. Total rules applied 877 place count 374 transition count 824
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 889 place count 374 transition count 812
Discarding 34 places :
Symmetric choice reduction at 6 with 34 rule applications. Total rules 923 place count 340 transition count 712
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 6 with 34 rules applied. Total rules applied 957 place count 340 transition count 712
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 977 place count 340 transition count 692
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 985 place count 332 transition count 676
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 993 place count 332 transition count 676
Deduced a syphon composed of 135 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 7 with 23 rules applied. Total rules applied 1016 place count 332 transition count 653
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1022 place count 326 transition count 641
Deduced a syphon composed of 135 places in 1 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 1028 place count 326 transition count 641
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1034 place count 320 transition count 593
Deduced a syphon composed of 135 places in 1 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 1040 place count 320 transition count 593
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1049 place count 320 transition count 584
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1055 place count 314 transition count 575
Deduced a syphon composed of 129 places in 0 ms
Iterating global reduction 8 with 6 rules applied. Total rules applied 1061 place count 314 transition count 575
Deduced a syphon composed of 129 places in 0 ms
Applied a total of 1061 rules in 157 ms. Remains 314 /826 variables (removed 512) and now considering 575/1294 (removed 719) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 03:54:00] [INFO ] Redundant transitions in 13 ms returned []
Running 574 sub problems to find dead transitions.
[2025-05-31 03:54:00] [INFO ] Flow matrix only has 558 transitions (discarded 17 similar events)
// Phase 1: matrix 558 rows 314 cols
[2025-05-31 03:54:00] [INFO ] Computed 52 invariants in 7 ms
[2025-05-31 03:54:00] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (OVERLAPS) 1/314 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:08] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:08] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:08] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:08] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:09] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:09] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:09] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD108 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:09] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:09] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
Problem TDEAD117 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:09] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 3 ms to minimize.
Problem TDEAD120 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:09] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Problem TDEAD123 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:09] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:09] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Problem TDEAD164 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:09] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD168 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD179 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:09] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:09] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:09] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD191 is UNSAT
Problem TDEAD196 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:09] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD197 is UNSAT
Problem TDEAD201 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:09] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD202 is UNSAT
Problem TDEAD207 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:10] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 20/72 constraints. Problems are: Problem set: 127 solved, 447 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:10] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD213 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:11] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD223 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:11] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD228 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:11] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD237 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:11] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD242 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:11] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD251 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:11] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD256 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:11] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD265 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:11] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD270 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:11] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD277 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:11] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD282 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:11] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD288 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:11] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD297 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:11] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD302 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:11] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD308 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:11] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD313 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:11] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD320 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:12] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD325 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:12] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD331 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD336 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 20/92 constraints. Problems are: Problem set: 147 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD342 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD347 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD353 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:15] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD359 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:15] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD365 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:15] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD371 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:15] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD380 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:16] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD389 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:16] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD398 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:16] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD403 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:16] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD408 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:54:16] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 12/104 constraints. Problems are: Problem set: 160 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/104 constraints. Problems are: Problem set: 160 solved, 414 unsolved
At refinement iteration 6 (OVERLAPS) 557/871 variables, 314/418 constraints. Problems are: Problem set: 160 solved, 414 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/871 variables, 66/484 constraints. Problems are: Problem set: 160 solved, 414 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/871 variables, 0/484 constraints. Problems are: Problem set: 160 solved, 414 unsolved
At refinement iteration 9 (OVERLAPS) 1/872 variables, 1/485 constraints. Problems are: Problem set: 160 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 872/872 variables, and 485 constraints, problems are : Problem set: 160 solved, 414 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 314/314 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 160 solved, 414 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 160 solved, 414 unsolved
At refinement iteration 1 (OVERLAPS) 130/314 variables, 52/52 constraints. Problems are: Problem set: 160 solved, 414 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 52/104 constraints. Problems are: Problem set: 160 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/104 constraints. Problems are: Problem set: 160 solved, 414 unsolved
At refinement iteration 4 (OVERLAPS) 557/871 variables, 314/418 constraints. Problems are: Problem set: 160 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/871 variables, 66/484 constraints. Problems are: Problem set: 160 solved, 414 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/871 variables, 414/898 constraints. Problems are: Problem set: 160 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/872 variables, and 898 constraints, problems are : Problem set: 160 solved, 414 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 314/314 constraints, ReadFeed: 66/67 constraints, PredecessorRefiner: 414/574 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60230ms problems are : Problem set: 160 solved, 414 unsolved
Search for dead transitions found 160 dead transitions in 60231ms
Found 160 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 160 transitions
Dead transitions reduction (with SMT) removed 160 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 314/826 places, 415/1294 transitions.
Graph (complete) has 751 edges and 314 vertex of which 185 are kept as prefixes of interest. Removing 129 places using SCC suffix rule.1 ms
Discarding 129 places :
Also discarding 0 output transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 185 transition count 453
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 4 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 30 place count 185 transition count 428
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 185 transition count 465
Deduced a syphon composed of 8 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 59 place count 185 transition count 440
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 185 transition count 486
Deduced a syphon composed of 12 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 77 place count 185 transition count 472
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 185 transition count 487
Deduced a syphon composed of 13 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 79 place count 185 transition count 486
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 79 rules in 50 ms. Remains 185 /314 variables (removed 129) and now considering 486/415 (removed -71) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 185/826 places, 486/1294 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60463 ms. Remains : 185/826 places, 486/1294 transitions.
Built C files in :
/tmp/ltsmin15601924171867944526
[2025-05-31 03:55:00] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15601924171867944526
Running compilation step : cd /tmp/ltsmin15601924171867944526;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2223 ms.
Running link step : cd /tmp/ltsmin15601924171867944526;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin15601924171867944526;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8085605925435650116.hoa' '--buchi-type=spotba'
LTSmin run took 4628 ms.
FORMULA DLCround-PT-03b-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DLCround-PT-03b-LTLFireability-06 finished in 213207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(X(G((p1||G(p2)))))))))'
Support contains 4 out of 860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 860/860 places, 1328/1328 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 848 transition count 1316
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 848 transition count 1316
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 838 transition count 1306
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 838 transition count 1306
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 831 transition count 1299
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 831 transition count 1299
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 827 transition count 1295
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 827 transition count 1295
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 824 transition count 1292
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 824 transition count 1292
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 821 transition count 1289
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 821 transition count 1289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 819 transition count 1287
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 819 transition count 1287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 817 transition count 1285
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 817 transition count 1285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 816 transition count 1284
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 816 transition count 1284
Applied a total of 88 rules in 153 ms. Remains 816 /860 variables (removed 44) and now considering 1284/1328 (removed 44) transitions.
// Phase 1: matrix 1284 rows 816 cols
[2025-05-31 03:55:07] [INFO ] Computed 52 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:55:07] [INFO ] Implicit Places using invariants in 274 ms returned []
[2025-05-31 03:55:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:55:08] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
Running 1283 sub problems to find dead transitions.
[2025-05-31 03:55:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 timeout
1.0)
(s149 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/815 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1283 unsolved
SMT process timed out in 30204ms, After SMT, problems are : Problem set: 0 solved, 1283 unsolved
Search for dead transitions found 0 dead transitions in 30207ms
Starting structural reductions in LTL mode, iteration 1 : 816/860 places, 1284/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31190 ms. Remains : 816/860 places, 1284/1328 transitions.
Stuttering acceptance computed with spot in 241 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-09
Product exploration explored 100000 steps with 1 reset in 264 ms.
Product exploration explored 100000 steps with 0 reset in 409 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 251 ms. (158 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
[2025-05-31 03:55:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 185/189 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 627/816 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/816 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1284/2100 variables, 816/868 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2100 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2100 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2100/2100 variables, and 868 constraints, problems are : Problem set: 0 solved, 2 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 816/816 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 185/189 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 627/816 variables, 49/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/816 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1284/2100 variables, 816/868 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2100 variables, 1/869 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2100 variables, 0/869 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2100 variables, 0/869 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2100/2100 variables, and 869 constraints, problems are : Problem set: 1 solved, 1 unsolved in 541 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 816/816 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1013ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 21566 steps, including 69 resets, run visited all 1 properties in 47 ms. (steps per millisecond=458 )
Parikh walk visited 1 properties in 48 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 816/816 places, 1284/1284 transitions.
Applied a total of 0 rules in 16 ms. Remains 816 /816 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
[2025-05-31 03:55:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:55:41] [INFO ] Implicit Places using invariants in 242 ms returned []
[2025-05-31 03:55:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:55:42] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
Running 1283 sub problems to find dead transitions.
[2025-05-31 03:55:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/815 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1283 unsolved
SMT process timed out in 30219ms, After SMT, problems are : Problem set: 0 solved, 1283 unsolved
Search for dead transitions found 0 dead transitions in 30222ms
Finished structural reductions in LTL mode , in 1 iterations and 31044 ms. Remains : 816/816 places, 1284/1284 transitions.
Computed a total of 99 stabilizing places and 99 stable transitions
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND p2 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
[2025-05-31 03:56:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 186/189 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 627/816 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/816 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1284/2100 variables, 816/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2100 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2100 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2100/2100 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 816/816 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
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 186/189 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 627/816 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/816 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1284/2100 variables, 816/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2100 variables, 1/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2100 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2100 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2100/2100 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 522 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 816/816 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 902ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 308 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=102 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p2 p1)]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 240 ms.
Product exploration explored 100000 steps with 5 reset in 271 ms.
Applying partial POR strategy [true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 816/816 places, 1284/1284 transitions.
Graph (trivial) has 762 edges and 816 vertex of which 242 / 816 are part of one of the 19 SCC in 1 ms
Free SCC test removed 223 places
Ensure Unique test removed 243 transitions
Reduce isomorphic transitions removed 243 transitions.
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 141 rules applied. Total rules applied 142 place count 593 transition count 1041
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 16 rules applied. Total rules applied 158 place count 593 transition count 1033
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 158 place count 593 transition count 1037
Deduced a syphon composed of 157 places in 1 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 166 place count 593 transition count 1037
Discarding 86 places :
Symmetric choice reduction at 2 with 86 rule applications. Total rules 252 place count 507 transition count 855
Deduced a syphon composed of 101 places in 1 ms
Iterating global reduction 2 with 86 rules applied. Total rules applied 338 place count 507 transition count 855
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 342 place count 507 transition count 851
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 277 places in 0 ms
Iterating global reduction 3 with 176 rules applied. Total rules applied 518 place count 507 transition count 855
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 522 place count 507 transition count 851
Discarding 143 places :
Symmetric choice reduction at 4 with 143 rule applications. Total rules 665 place count 364 transition count 642
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 4 with 143 rules applied. Total rules applied 808 place count 364 transition count 642
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 819 place count 364 transition count 631
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 823 place count 360 transition count 627
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 5 with 4 rules applied. Total rules applied 827 place count 360 transition count 627
Performed 24 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 167 places in 1 ms
Iterating global reduction 5 with 24 rules applied. Total rules applied 851 place count 360 transition count 793
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 863 place count 360 transition count 781
Discarding 32 places :
Symmetric choice reduction at 6 with 32 rule applications. Total rules 895 place count 328 transition count 685
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 6 with 32 rules applied. Total rules applied 927 place count 328 transition count 685
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 947 place count 328 transition count 665
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 955 place count 320 transition count 649
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 963 place count 320 transition count 649
Deduced a syphon composed of 131 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 7 with 24 rules applied. Total rules applied 987 place count 320 transition count 625
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 993 place count 314 transition count 613
Deduced a syphon composed of 131 places in 1 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 999 place count 314 transition count 613
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1005 place count 308 transition count 565
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 1011 place count 308 transition count 565
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1020 place count 308 transition count 556
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1025 place count 303 transition count 548
Deduced a syphon composed of 126 places in 0 ms
Iterating global reduction 8 with 5 rules applied. Total rules applied 1030 place count 303 transition count 548
Deduced a syphon composed of 126 places in 0 ms
Applied a total of 1030 rules in 110 ms. Remains 303 /816 variables (removed 513) and now considering 548/1284 (removed 736) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 03:56:15] [INFO ] Redundant transitions in 11 ms returned []
Running 547 sub problems to find dead transitions.
[2025-05-31 03:56:15] [INFO ] Flow matrix only has 534 transitions (discarded 14 similar events)
// Phase 1: matrix 534 rows 303 cols
[2025-05-31 03:56:15] [INFO ] Computed 52 invariants in 12 ms
[2025-05-31 03:56:15] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 1 (OVERLAPS) 1/303 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 547 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:23] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:23] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:23] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:23] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:23] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:23] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:23] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 2 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:24] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Problem TDEAD113 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:24] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Problem TDEAD116 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:24] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
Problem TDEAD119 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:24] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 2 ms to minimize.
Problem TDEAD122 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:24] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:24] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD166 is UNSAT
Problem TDEAD171 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:24] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD172 is UNSAT
Problem TDEAD176 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD177 is UNSAT
Problem TDEAD182 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:24] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD183 is UNSAT
Problem TDEAD187 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:24] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD188 is UNSAT
Problem TDEAD193 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:24] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:24] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 20/72 constraints. Problems are: Problem set: 124 solved, 423 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:25] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD205 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:25] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD210 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:25] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD216 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:25] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD221 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:25] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD227 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:25] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD232 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:25] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD238 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:25] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD243 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:26] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD251 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD256 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:26] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD264 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:26] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD269 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD277 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD282 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:26] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD290 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:26] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD295 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem TDEAD301 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:26] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD306 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:26] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD312 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:26] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD205 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD317 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 20/92 constraints. Problems are: Problem set: 144 solved, 403 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:29] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD323 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:29] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD328 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:29] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD334 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:29] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD340 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:29] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD346 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:30] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
Problem TDEAD352 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:30] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD358 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:30] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD364 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:30] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD371 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:30] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD378 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:30] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD385 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:56:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 12/104 constraints. Problems are: Problem set: 157 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/104 constraints. Problems are: Problem set: 157 solved, 390 unsolved
At refinement iteration 6 (OVERLAPS) 533/836 variables, 303/407 constraints. Problems are: Problem set: 157 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/836 variables, 67/474 constraints. Problems are: Problem set: 157 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 836/837 variables, and 474 constraints, problems are : Problem set: 157 solved, 390 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 303/303 constraints, ReadFeed: 67/68 constraints, PredecessorRefiner: 547/547 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 157 solved, 390 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 157 solved, 390 unsolved
At refinement iteration 1 (OVERLAPS) 127/303 variables, 52/52 constraints. Problems are: Problem set: 157 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 52/104 constraints. Problems are: Problem set: 157 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 0/104 constraints. Problems are: Problem set: 157 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 533/836 variables, 303/407 constraints. Problems are: Problem set: 157 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/836 variables, 67/474 constraints. Problems are: Problem set: 157 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/836 variables, 390/864 constraints. Problems are: Problem set: 157 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 836/837 variables, and 864 constraints, problems are : Problem set: 157 solved, 390 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 303/303 constraints, ReadFeed: 67/68 constraints, PredecessorRefiner: 390/547 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60183ms problems are : Problem set: 157 solved, 390 unsolved
Search for dead transitions found 157 dead transitions in 60183ms
Found 157 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 157 transitions
Dead transitions reduction (with SMT) removed 157 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 303/816 places, 391/1284 transitions.
Graph (complete) has 699 edges and 303 vertex of which 177 are kept as prefixes of interest. Removing 126 places using SCC suffix rule.0 ms
Discarding 126 places :
Also discarding 0 output transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 177 transition count 429
Deduced a syphon composed of 4 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 29 place count 177 transition count 405
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 33 place count 177 transition count 446
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 8 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 58 place count 177 transition count 421
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 177 transition count 461
Deduced a syphon composed of 12 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 88 place count 177 transition count 435
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 177 transition count 472
Deduced a syphon composed of 16 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 117 place count 177 transition count 447
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 121 place count 177 transition count 485
Deduced a syphon composed of 20 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 145 place count 177 transition count 461
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 149 place count 177 transition count 502
Deduced a syphon composed of 24 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 174 place count 177 transition count 477
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 178 place count 177 transition count 514
Deduced a syphon composed of 28 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 203 place count 177 transition count 489
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 207 place count 177 transition count 527
Deduced a syphon composed of 32 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 232 place count 177 transition count 502
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 236 place count 177 transition count 537
Deduced a syphon composed of 36 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 259 place count 177 transition count 514
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 263 place count 177 transition count 551
Deduced a syphon composed of 40 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 286 place count 177 transition count 528
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 286 rules in 91 ms. Remains 177 /303 variables (removed 126) and now considering 528/391 (removed -137) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 177/816 places, 528/1284 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60416 ms. Remains : 177/816 places, 528/1284 transitions.
Built C files in :
/tmp/ltsmin12312506733020826538
[2025-05-31 03:57:16] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12312506733020826538
Running compilation step : cd /tmp/ltsmin12312506733020826538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2119 ms.
Running link step : cd /tmp/ltsmin12312506733020826538;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12312506733020826538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4018132987338418943.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 816/816 places, 1284/1284 transitions.
Applied a total of 0 rules in 23 ms. Remains 816 /816 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
// Phase 1: matrix 1284 rows 816 cols
[2025-05-31 03:57:31] [INFO ] Computed 52 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:57:31] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-05-31 03:57:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:57:32] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
Running 1283 sub problems to find dead transitions.
[2025-05-31 03:57:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/815 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1283 unsolved
SMT process timed out in 30196ms, After SMT, problems are : Problem set: 0 solved, 1283 unsolved
Search for dead transitions found 0 dead transitions in 30202ms
Finished structural reductions in LTL mode , in 1 iterations and 31014 ms. Remains : 816/816 places, 1284/1284 transitions.
Built C files in :
/tmp/ltsmin14825590289124530552
[2025-05-31 03:58:02] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14825590289124530552
Running compilation step : cd /tmp/ltsmin14825590289124530552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2047 ms.
Running link step : cd /tmp/ltsmin14825590289124530552;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14825590289124530552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2424962133907399755.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 03:58:17] [INFO ] Flatten gal took : 47 ms
[2025-05-31 03:58:17] [INFO ] Flatten gal took : 39 ms
[2025-05-31 03:58:17] [INFO ] Time to serialize gal into /tmp/LTL9083339708622303317.gal : 10 ms
[2025-05-31 03:58:17] [INFO ] Time to serialize properties into /tmp/LTL1584548070789539162.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9083339708622303317.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9474047774389691833.hoa' '-atoms' '/tmp/LTL1584548070789539162.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1584548070789539162.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9474047774389691833.hoa
Detected timeout of ITS tools.
[2025-05-31 03:58:32] [INFO ] Flatten gal took : 35 ms
[2025-05-31 03:58:32] [INFO ] Flatten gal took : 41 ms
[2025-05-31 03:58:32] [INFO ] Time to serialize gal into /tmp/LTL13085516020096601961.gal : 8 ms
[2025-05-31 03:58:32] [INFO ] Time to serialize properties into /tmp/LTL982760571093702275.ltl : 4 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13085516020096601961.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL982760571093702275.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(("(p488==1)")||(X(X(X(G(("(p705==0)")||(G("(((p663==0)||(p1179==0))||(p488==0))"))))))))))
Formula 0 simplified : X(!"(p488==1)" & XXXF(!"(p705==0)" & F!"(((p663==0)||(p1179==0))||(p488==0))"))
Detected timeout of ITS tools.
[2025-05-31 03:58:47] [INFO ] Flatten gal took : 30 ms
[2025-05-31 03:58:47] [INFO ] Applying decomposition
[2025-05-31 03:58:47] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11206813640137458832.txt' '-o' '/tmp/graph11206813640137458832.bin' '-w' '/tmp/graph11206813640137458832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11206813640137458832.bin' '-l' '-1' '-v' '-w' '/tmp/graph11206813640137458832.weights' '-q' '0' '-e' '0.001'
[2025-05-31 03:58:48] [INFO ] Decomposing Gal with order
[2025-05-31 03:58:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 03:58:48] [INFO ] Removed a total of 1020 redundant transitions.
[2025-05-31 03:58:48] [INFO ] Flatten gal took : 100 ms
[2025-05-31 03:58:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 32 ms.
[2025-05-31 03:58:48] [INFO ] Time to serialize gal into /tmp/LTL9903978843868590126.gal : 13 ms
[2025-05-31 03:58:48] [INFO ] Time to serialize properties into /tmp/LTL15557494885255631119.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9903978843868590126.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15557494885255631119.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(("(i6.i2.i0.u97.p488==1)")||(X(X(X(G(("(i11.i0.i1.u157.p705==0)")||(G("(((i11.i2.i1.u146.p663==0)||(i4.u271.p1179==0))||(i6.i2.i0...180
Formula 0 simplified : X(!"(i6.i2.i0.u97.p488==1)" & XXXF(!"(i11.i0.i1.u157.p705==0)" & F!"(((i11.i2.i1.u146.p663==0)||(i4.u271.p1179==0))||(i6.i2.i0.u97.p...166
Detected timeout of ITS tools.
Treatment of property DLCround-PT-03b-LTLFireability-09 finished in 235978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 6 out of 860 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 860/860 places, 1328/1328 transitions.
Graph (trivial) has 806 edges and 860 vertex of which 248 / 860 are part of one of the 20 SCC in 1 ms
Free SCC test removed 228 places
Ensure Unique test removed 247 transitions
Reduce isomorphic transitions removed 247 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 173 rules applied. Total rules applied 174 place count 631 transition count 907
Reduce places removed 173 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 197 rules applied. Total rules applied 371 place count 458 transition count 883
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 387 place count 442 transition count 883
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 387 place count 442 transition count 829
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 495 place count 388 transition count 829
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 531 place count 352 transition count 694
Iterating global reduction 3 with 36 rules applied. Total rules applied 567 place count 352 transition count 694
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 570 place count 352 transition count 691
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 570 place count 352 transition count 688
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 576 place count 349 transition count 688
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 577 place count 348 transition count 684
Iterating global reduction 4 with 1 rules applied. Total rules applied 578 place count 348 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 579 place count 348 transition count 683
Performed 125 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 125 places in 0 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 5 with 250 rules applied. Total rules applied 829 place count 223 transition count 554
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 833 place count 223 transition count 550
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 844 place count 212 transition count 485
Iterating global reduction 6 with 11 rules applied. Total rules applied 855 place count 212 transition count 485
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 866 place count 212 transition count 474
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 7 with 2 rules applied. Total rules applied 868 place count 211 transition count 473
Performed 16 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 900 place count 195 transition count 555
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 903 place count 192 transition count 527
Iterating global reduction 7 with 3 rules applied. Total rules applied 906 place count 192 transition count 527
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 918 place count 192 transition count 515
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 8 with 21 rules applied. Total rules applied 939 place count 192 transition count 494
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 947 place count 184 transition count 478
Iterating global reduction 8 with 8 rules applied. Total rules applied 955 place count 184 transition count 478
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 963 place count 176 transition count 420
Iterating global reduction 8 with 8 rules applied. Total rules applied 971 place count 176 transition count 420
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 979 place count 176 transition count 412
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 980 place count 175 transition count 411
Applied a total of 980 rules in 63 ms. Remains 175 /860 variables (removed 685) and now considering 411/1328 (removed 917) transitions.
[2025-05-31 03:59:03] [INFO ] Flow matrix only has 390 transitions (discarded 21 similar events)
// Phase 1: matrix 390 rows 175 cols
[2025-05-31 03:59:03] [INFO ] Computed 52 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:59:03] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-05-31 03:59:03] [INFO ] Flow matrix only has 390 transitions (discarded 21 similar events)
[2025-05-31 03:59:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:59:03] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-31 03:59:03] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 03:59:03] [INFO ] Redundant transitions in 2 ms returned []
Running 361 sub problems to find dead transitions.
[2025-05-31 03:59:03] [INFO ] Flow matrix only has 390 transitions (discarded 21 similar events)
[2025-05-31 03:59:03] [INFO ] Invariant cache hit.
[2025-05-31 03:59:03] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/175 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 389/564 variables, 175/227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 31/258 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/564 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/565 variables, and 258 constraints, problems are : Problem set: 0 solved, 361 unsolved in 19824 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 175/175 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/175 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 389/564 variables, 175/227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 31/258 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 361/619 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/564 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/565 variables, and 619 constraints, problems are : Problem set: 0 solved, 361 unsolved in 24602 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 175/175 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44516ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 44516ms
Starting structural reductions in SI_LTL mode, iteration 1 : 175/860 places, 411/1328 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44901 ms. Remains : 175/860 places, 411/1328 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-10
Stuttering criterion allowed to conclude after 526 steps with 0 reset in 8 ms.
FORMULA DLCround-PT-03b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-10 finished in 45051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p0&&F(p1)))))))'
Support contains 1 out of 860 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 860/860 places, 1328/1328 transitions.
Graph (trivial) has 809 edges and 860 vertex of which 248 / 860 are part of one of the 20 SCC in 1 ms
Free SCC test removed 228 places
Ensure Unique test removed 247 transitions
Reduce isomorphic transitions removed 247 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 171 rules applied. Total rules applied 172 place count 631 transition count 909
Reduce places removed 171 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 195 rules applied. Total rules applied 367 place count 460 transition count 885
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 384 place count 444 transition count 884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 385 place count 443 transition count 884
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 55 Pre rules applied. Total rules applied 385 place count 443 transition count 829
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 495 place count 388 transition count 829
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 531 place count 352 transition count 688
Iterating global reduction 4 with 36 rules applied. Total rules applied 567 place count 352 transition count 688
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 570 place count 352 transition count 685
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 570 place count 352 transition count 682
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 576 place count 349 transition count 682
Performed 125 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 125 places in 0 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 5 with 250 rules applied. Total rules applied 826 place count 224 transition count 553
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 831 place count 224 transition count 548
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 843 place count 212 transition count 476
Iterating global reduction 6 with 12 rules applied. Total rules applied 855 place count 212 transition count 476
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 867 place count 212 transition count 464
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 7 with 2 rules applied. Total rules applied 869 place count 211 transition count 463
Performed 16 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 901 place count 195 transition count 541
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 905 place count 191 transition count 503
Iterating global reduction 7 with 4 rules applied. Total rules applied 909 place count 191 transition count 503
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 926 place count 191 transition count 486
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 8 with 21 rules applied. Total rules applied 947 place count 191 transition count 465
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 955 place count 183 transition count 449
Iterating global reduction 8 with 8 rules applied. Total rules applied 963 place count 183 transition count 449
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 971 place count 175 transition count 391
Iterating global reduction 8 with 8 rules applied. Total rules applied 979 place count 175 transition count 391
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 987 place count 175 transition count 383
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 988 place count 174 transition count 382
Applied a total of 988 rules in 58 ms. Remains 174 /860 variables (removed 686) and now considering 382/1328 (removed 946) transitions.
[2025-05-31 03:59:48] [INFO ] Flow matrix only has 366 transitions (discarded 16 similar events)
// Phase 1: matrix 366 rows 174 cols
[2025-05-31 03:59:48] [INFO ] Computed 52 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:59:48] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-05-31 03:59:48] [INFO ] Flow matrix only has 366 transitions (discarded 16 similar events)
[2025-05-31 03:59:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:59:48] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-05-31 03:59:48] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 03:59:48] [INFO ] Redundant transitions in 2 ms returned []
Running 333 sub problems to find dead transitions.
[2025-05-31 03:59:48] [INFO ] Flow matrix only has 366 transitions (discarded 16 similar events)
[2025-05-31 03:59:48] [INFO ] Invariant cache hit.
[2025-05-31 03:59:48] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 365/539 variables, 174/226 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 29/255 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (OVERLAPS) 0/539 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 333 unsolved
No progress, stopping.
After SMT solving in domain Real declared 539/540 variables, and 255 constraints, problems are : Problem set: 0 solved, 333 unsolved in 17806 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 174/174 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 365/539 variables, 174/226 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 29/255 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 333/588 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 8 (OVERLAPS) 0/539 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 333 unsolved
No progress, stopping.
After SMT solving in domain Int declared 539/540 variables, and 588 constraints, problems are : Problem set: 0 solved, 333 unsolved in 22375 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 174/174 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40276ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 40277ms
Starting structural reductions in SI_LTL mode, iteration 1 : 174/860 places, 382/1328 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40588 ms. Remains : 174/860 places, 382/1328 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-03b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-11 finished in 40636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F((p1&&X(p1)))))))'
Support contains 3 out of 860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 860/860 places, 1328/1328 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 848 transition count 1316
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 848 transition count 1316
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 839 transition count 1307
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 839 transition count 1307
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 833 transition count 1301
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 833 transition count 1301
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 830 transition count 1298
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 830 transition count 1298
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 828 transition count 1296
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 828 transition count 1296
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 826 transition count 1294
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 826 transition count 1294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 825 transition count 1293
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 825 transition count 1293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 824 transition count 1292
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 824 transition count 1292
Applied a total of 72 rules in 123 ms. Remains 824 /860 variables (removed 36) and now considering 1292/1328 (removed 36) transitions.
// Phase 1: matrix 1292 rows 824 cols
[2025-05-31 04:00:29] [INFO ] Computed 52 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:00:29] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-05-31 04:00:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:00:30] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
Running 1291 sub problems to find dead transitions.
[2025-05-31 04:00:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/823 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1291 unsolved
SMT process timed out in 30194ms, After SMT, problems are : Problem set: 0 solved, 1291 unsolved
Search for dead transitions found 0 dead transitions in 30197ms
Starting structural reductions in LTL mode, iteration 1 : 824/860 places, 1292/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31129 ms. Remains : 824/860 places, 1292/1328 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-13
Product exploration explored 100000 steps with 33294 reset in 223 ms.
Product exploration explored 100000 steps with 33387 reset in 235 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 65 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 6974 steps (0 resets) in 28 ms. (240 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 824 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 824/824 places, 1292/1292 transitions.
Applied a total of 0 rules in 27 ms. Remains 824 /824 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
[2025-05-31 04:01:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:01:01] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-05-31 04:01:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:01:02] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
Running 1291 sub problems to find dead transitions.
[2025-05-31 04:01:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/823 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1291 unsolved
SMT process timed out in 30199ms, After SMT, problems are : Problem set: 0 solved, 1291 unsolved
Search for dead transitions found 0 dead transitions in 30202ms
Finished structural reductions in LTL mode , in 1 iterations and 31031 ms. Remains : 824/824 places, 1292/1292 transitions.
Computed a total of 99 stabilizing places and 99 stable transitions
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 3152 steps (0 resets) in 17 ms. (175 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33377 reset in 203 ms.
Product exploration explored 100000 steps with 33450 reset in 199 ms.
Built C files in :
/tmp/ltsmin5892565820509406670
[2025-05-31 04:01:33] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5892565820509406670
Running compilation step : cd /tmp/ltsmin5892565820509406670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2087 ms.
Running link step : cd /tmp/ltsmin5892565820509406670;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5892565820509406670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11877441867342338252.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 824 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 824/824 places, 1292/1292 transitions.
Applied a total of 0 rules in 12 ms. Remains 824 /824 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
[2025-05-31 04:01:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:01:49] [INFO ] Implicit Places using invariants in 276 ms returned []
[2025-05-31 04:01:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:01:49] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
Running 1291 sub problems to find dead transitions.
[2025-05-31 04:01:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/823 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1291 unsolved
SMT process timed out in 30192ms, After SMT, problems are : Problem set: 0 solved, 1291 unsolved
Search for dead transitions found 0 dead transitions in 30195ms
Finished structural reductions in LTL mode , in 1 iterations and 31086 ms. Remains : 824/824 places, 1292/1292 transitions.
Built C files in :
/tmp/ltsmin501475063020598939
[2025-05-31 04:02:19] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin501475063020598939
Running compilation step : cd /tmp/ltsmin501475063020598939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2010 ms.
Running link step : cd /tmp/ltsmin501475063020598939;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin501475063020598939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16589207941188142827.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 04:02:35] [INFO ] Flatten gal took : 29 ms
[2025-05-31 04:02:35] [INFO ] Flatten gal took : 29 ms
[2025-05-31 04:02:35] [INFO ] Time to serialize gal into /tmp/LTL5285802223964306864.gal : 11 ms
[2025-05-31 04:02:35] [INFO ] Time to serialize properties into /tmp/LTL1569506777156671992.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5285802223964306864.gal' '-t' 'CGAL' '-hoa' '/tmp/aut325595992842852814.hoa' '-atoms' '/tmp/LTL1569506777156671992.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL1569506777156671992.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut325595992842852814.hoa
Detected timeout of ITS tools.
[2025-05-31 04:02:50] [INFO ] Flatten gal took : 23 ms
[2025-05-31 04:02:50] [INFO ] Flatten gal took : 23 ms
[2025-05-31 04:02:50] [INFO ] Time to serialize gal into /tmp/LTL6700708482338852312.gal : 5 ms
[2025-05-31 04:02:50] [INFO ] Time to serialize properties into /tmp/LTL13957172571733234004.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6700708482338852312.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13957172571733234004.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("(p24!=1)")&&(X("(p24!=1)")))))&&("((p564==0)||(p1336==0))"))))
Formula 0 simplified : FG(!"(p24!=1)" | X!"(p24!=1)") | G!"((p564==0)||(p1336==0))"
Detected timeout of ITS tools.
[2025-05-31 04:03:05] [INFO ] Flatten gal took : 23 ms
[2025-05-31 04:03:05] [INFO ] Applying decomposition
[2025-05-31 04:03:05] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10961278043677214070.txt' '-o' '/tmp/graph10961278043677214070.bin' '-w' '/tmp/graph10961278043677214070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10961278043677214070.bin' '-l' '-1' '-v' '-w' '/tmp/graph10961278043677214070.weights' '-q' '0' '-e' '0.001'
[2025-05-31 04:03:05] [INFO ] Decomposing Gal with order
[2025-05-31 04:03:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 04:03:05] [INFO ] Removed a total of 994 redundant transitions.
[2025-05-31 04:03:05] [INFO ] Flatten gal took : 60 ms
[2025-05-31 04:03:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 25 ms.
[2025-05-31 04:03:05] [INFO ] Time to serialize gal into /tmp/LTL18430687712231609429.gal : 17 ms
[2025-05-31 04:03:05] [INFO ] Time to serialize properties into /tmp/LTL3683998828931054011.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18430687712231609429.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3683998828931054011.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("(i1.i0.i0.u4.p24!=1)")&&(X("(i1.i0.i0.u4.p24!=1)")))))&&("((i7.u116.p564==0)||(i10.u303.p1336==0))"))))
Formula 0 simplified : FG(!"(i1.i0.i0.u4.p24!=1)" | X!"(i1.i0.i0.u4.p24!=1)") | G!"((i7.u116.p564==0)||(i10.u303.p1336==0))"
Detected timeout of ITS tools.
Treatment of property DLCround-PT-03b-LTLFireability-13 finished in 171532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(X(G(p1))))))))'
Support contains 3 out of 860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 860/860 places, 1328/1328 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 848 transition count 1316
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 848 transition count 1316
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 839 transition count 1307
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 839 transition count 1307
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 833 transition count 1301
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 833 transition count 1301
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 829 transition count 1297
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 829 transition count 1297
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 826 transition count 1294
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 826 transition count 1294
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 823 transition count 1291
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 823 transition count 1291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 821 transition count 1289
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 821 transition count 1289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 819 transition count 1287
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 819 transition count 1287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 818 transition count 1286
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 818 transition count 1286
Applied a total of 84 rules in 158 ms. Remains 818 /860 variables (removed 42) and now considering 1286/1328 (removed 42) transitions.
// Phase 1: matrix 1286 rows 818 cols
[2025-05-31 04:03:20] [INFO ] Computed 52 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:03:21] [INFO ] Implicit Places using invariants in 287 ms returned []
[2025-05-31 04:03:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:03:21] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
Running 1285 sub problems to find dead transitions.
[2025-05-31 04:03:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/817 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1285 unsolved
SMT process timed out in 30219ms, After SMT, problems are : Problem set: 0 solved, 1285 unsolved
Search for dead transitions found 0 dead transitions in 30223ms
Starting structural reductions in LTL mode, iteration 1 : 818/860 places, 1286/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31308 ms. Remains : 818/860 places, 1286/1328 transitions.
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 272 ms.
Stack based approach found an accepted trace after 1156 steps with 0 reset with depth 1157 and stack size 1157 in 3 ms.
FORMULA DLCround-PT-03b-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DLCround-PT-03b-LTLFireability-14 finished in 31903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(G(p1))&&p0))&&F(p2)))'
Support contains 4 out of 860 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 860/860 places, 1328/1328 transitions.
Graph (trivial) has 804 edges and 860 vertex of which 233 / 860 are part of one of the 19 SCC in 2 ms
Free SCC test removed 214 places
Ensure Unique test removed 231 transitions
Reduce isomorphic transitions removed 231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 179 transitions
Trivial Post-agglo rules discarded 179 transitions
Performed 179 trivial Post agglomeration. Transition count delta: 179
Iterating post reduction 0 with 179 rules applied. Total rules applied 180 place count 645 transition count 917
Reduce places removed 179 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 203 rules applied. Total rules applied 383 place count 466 transition count 893
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 400 place count 450 transition count 892
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 401 place count 449 transition count 892
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 401 place count 449 transition count 836
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 513 place count 393 transition count 836
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 547 place count 359 transition count 706
Iterating global reduction 4 with 34 rules applied. Total rules applied 581 place count 359 transition count 706
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 583 place count 359 transition count 704
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 583 place count 359 transition count 701
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 589 place count 356 transition count 701
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 590 place count 355 transition count 697
Iterating global reduction 5 with 1 rules applied. Total rules applied 591 place count 355 transition count 697
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 592 place count 355 transition count 696
Performed 129 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 6 with 258 rules applied. Total rules applied 850 place count 226 transition count 563
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 856 place count 226 transition count 557
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 868 place count 214 transition count 485
Iterating global reduction 7 with 12 rules applied. Total rules applied 880 place count 214 transition count 485
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 892 place count 214 transition count 473
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 896 place count 212 transition count 471
Performed 17 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 930 place count 195 transition count 551
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 931 place count 195 transition count 550
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 936 place count 190 transition count 504
Iterating global reduction 9 with 5 rules applied. Total rules applied 941 place count 190 transition count 504
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 958 place count 190 transition count 487
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 10 with 20 rules applied. Total rules applied 978 place count 190 transition count 467
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 985 place count 183 transition count 453
Iterating global reduction 10 with 7 rules applied. Total rules applied 992 place count 183 transition count 453
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 999 place count 176 transition count 402
Iterating global reduction 10 with 7 rules applied. Total rules applied 1006 place count 176 transition count 402
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 1013 place count 176 transition count 395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1014 place count 175 transition count 394
Applied a total of 1014 rules in 80 ms. Remains 175 /860 variables (removed 685) and now considering 394/1328 (removed 934) transitions.
[2025-05-31 04:03:52] [INFO ] Flow matrix only has 378 transitions (discarded 16 similar events)
// Phase 1: matrix 378 rows 175 cols
[2025-05-31 04:03:52] [INFO ] Computed 52 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:03:52] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-05-31 04:03:52] [INFO ] Flow matrix only has 378 transitions (discarded 16 similar events)
[2025-05-31 04:03:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:03:52] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-05-31 04:03:52] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 04:03:52] [INFO ] Redundant transitions in 2 ms returned []
Running 348 sub problems to find dead transitions.
[2025-05-31 04:03:52] [INFO ] Flow matrix only has 378 transitions (discarded 16 similar events)
[2025-05-31 04:03:52] [INFO ] Invariant cache hit.
[2025-05-31 04:03:52] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 2/175 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 377/552 variables, 175/227 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 28/255 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/552 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/553 variables, and 255 constraints, problems are : Problem set: 0 solved, 348 unsolved in 18806 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 175/175 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 2/175 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 377/552 variables, 175/227 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 28/255 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 348/603 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (OVERLAPS) 0/552 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/553 variables, and 603 constraints, problems are : Problem set: 0 solved, 348 unsolved in 23161 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 175/175 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42040ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 42042ms
Starting structural reductions in SI_LTL mode, iteration 1 : 175/860 places, 394/1328 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42376 ms. Remains : 175/860 places, 394/1328 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-03b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-15 finished in 42588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(X(G((p1||G(p2)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F((p1&&X(p1)))))))'
Found a Shortening insensitive property : DLCround-PT-03b-LTLFireability-13
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 3 out of 860 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 860/860 places, 1328/1328 transitions.
Graph (trivial) has 809 edges and 860 vertex of which 248 / 860 are part of one of the 20 SCC in 1 ms
Free SCC test removed 228 places
Ensure Unique test removed 247 transitions
Reduce isomorphic transitions removed 247 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 174 transitions
Trivial Post-agglo rules discarded 174 transitions
Performed 174 trivial Post agglomeration. Transition count delta: 174
Iterating post reduction 0 with 174 rules applied. Total rules applied 175 place count 631 transition count 906
Reduce places removed 174 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 198 rules applied. Total rules applied 373 place count 457 transition count 882
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 389 place count 441 transition count 882
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 389 place count 441 transition count 828
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 497 place count 387 transition count 828
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 534 place count 350 transition count 686
Iterating global reduction 3 with 37 rules applied. Total rules applied 571 place count 350 transition count 686
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 574 place count 350 transition count 683
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 574 place count 350 transition count 679
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 582 place count 346 transition count 679
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 583 place count 345 transition count 675
Iterating global reduction 4 with 1 rules applied. Total rules applied 584 place count 345 transition count 675
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 585 place count 345 transition count 674
Performed 124 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 124 places in 0 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 5 with 248 rules applied. Total rules applied 833 place count 221 transition count 546
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 838 place count 221 transition count 541
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 849 place count 210 transition count 476
Iterating global reduction 6 with 11 rules applied. Total rules applied 860 place count 210 transition count 476
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 871 place count 210 transition count 465
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 7 with 2 rules applied. Total rules applied 873 place count 209 transition count 464
Performed 16 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 905 place count 193 transition count 541
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 909 place count 189 transition count 503
Iterating global reduction 7 with 4 rules applied. Total rules applied 913 place count 189 transition count 503
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 930 place count 189 transition count 486
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 934 place count 189 transition count 482
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 935 place count 188 transition count 481
Applied a total of 935 rules in 68 ms. Remains 188 /860 variables (removed 672) and now considering 481/1328 (removed 847) transitions.
[2025-05-31 04:04:35] [INFO ] Flow matrix only has 457 transitions (discarded 24 similar events)
// Phase 1: matrix 457 rows 188 cols
[2025-05-31 04:04:35] [INFO ] Computed 52 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:04:35] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-05-31 04:04:35] [INFO ] Flow matrix only has 457 transitions (discarded 24 similar events)
[2025-05-31 04:04:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:04:35] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-05-31 04:04:35] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2025-05-31 04:04:35] [INFO ] Flow matrix only has 457 transitions (discarded 24 similar events)
[2025-05-31 04:04:35] [INFO ] Invariant cache hit.
[2025-05-31 04:04:35] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 456/644 variables, 188/240 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 30/270 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 7 (OVERLAPS) 0/644 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 424 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/645 variables, and 270 constraints, problems are : Problem set: 0 solved, 424 unsolved in 25673 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 188/188 constraints, ReadFeed: 30/30 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 456/644 variables, 188/240 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 30/270 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 424/694 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 8 (OVERLAPS) 0/644 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 424 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/645 variables, and 694 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 188/188 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55782ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 55783ms
Starting structural reductions in LI_LTL mode, iteration 1 : 188/860 places, 481/1328 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 56171 ms. Remains : 188/860 places, 481/1328 transitions.
Running random walk in product with property : DLCround-PT-03b-LTLFireability-13
Product exploration explored 100000 steps with 33362 reset in 421 ms.
Product exploration explored 100000 steps with 33260 reset in 415 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 69 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 575 steps (0 resets) in 22 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 188 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 481/481 transitions.
Applied a total of 0 rules in 3 ms. Remains 188 /188 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2025-05-31 04:05:33] [INFO ] Flow matrix only has 457 transitions (discarded 24 similar events)
[2025-05-31 04:05:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:05:33] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-05-31 04:05:33] [INFO ] Flow matrix only has 457 transitions (discarded 24 similar events)
[2025-05-31 04:05:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:05:33] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-05-31 04:05:33] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2025-05-31 04:05:33] [INFO ] Flow matrix only has 457 transitions (discarded 24 similar events)
[2025-05-31 04:05:33] [INFO ] Invariant cache hit.
[2025-05-31 04:05:33] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 456/644 variables, 188/240 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 30/270 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 7 (OVERLAPS) 0/644 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 424 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/645 variables, and 270 constraints, problems are : Problem set: 0 solved, 424 unsolved in 25147 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 188/188 constraints, ReadFeed: 30/30 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 456/644 variables, 188/240 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 30/270 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 424/694 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 8 (OVERLAPS) 0/644 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 424 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/645 variables, and 694 constraints, problems are : Problem set: 0 solved, 424 unsolved in 29565 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 188/188 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54802ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 54803ms
Finished structural reductions in LTL mode , in 1 iterations and 55082 ms. Remains : 188/188 places, 481/481 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 659 steps (0 resets) in 12 ms. (50 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33408 reset in 355 ms.
Product exploration explored 100000 steps with 33338 reset in 369 ms.
Built C files in :
/tmp/ltsmin17949822258112148522
[2025-05-31 04:06:29] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17949822258112148522
Running compilation step : cd /tmp/ltsmin17949822258112148522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 689 ms.
Running link step : cd /tmp/ltsmin17949822258112148522;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17949822258112148522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2901400491656518120.hoa' '--buchi-type=spotba'
LTSmin run took 2093 ms.
Treatment of property DLCround-PT-03b-LTLFireability-13 finished in 117137 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2025-05-31 04:06:32] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17297530540195222301
[2025-05-31 04:06:32] [INFO ] Applying decomposition
[2025-05-31 04:06:32] [INFO ] Computing symmetric may disable matrix : 1328 transitions.
[2025-05-31 04:06:32] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 04:06:32] [INFO ] Computing symmetric may enable matrix : 1328 transitions.
[2025-05-31 04:06:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 04:06:32] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17596954530978557716.txt' '-o' '/tmp/graph17596954530978557716.bin' '-w' '/tmp/graph17596954530978557716.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17596954530978557716.bin' '-l' '-1' '-v' '-w' '/tmp/graph17596954530978557716.weights' '-q' '0' '-e' '0.001'
[2025-05-31 04:06:32] [INFO ] Decomposing Gal with order
[2025-05-31 04:06:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 04:06:32] [INFO ] Removed a total of 986 redundant transitions.
[2025-05-31 04:06:32] [INFO ] Flatten gal took : 47 ms
[2025-05-31 04:06:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 22 ms.
[2025-05-31 04:06:32] [INFO ] Time to serialize gal into /tmp/LTLFireability5022690819611373118.gal : 8 ms
[2025-05-31 04:06:32] [INFO ] Time to serialize properties into /tmp/LTLFireability12888777646797174727.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5022690819611373118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12888777646797174727.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
[2025-05-31 04:06:32] [INFO ] Computing Do-Not-Accords matrix : 1328 transitions.
[2025-05-31 04:06:32] [INFO ] Computation of Completed DNA matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Checking formula 0 : !((X(("(i7.u112.p488==1)")||(X(X(X(G(("(i11.i1.i0.u175.p705==0)")||(G("(((i11.i3.i1.u162.p663==0)||(i5.i0.i3.u284.p1179==0))||(i7.u112...176
[2025-05-31 04:06:32] [INFO ] Built C files in 504ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17297530540195222301
Running compilation step : cd /tmp/ltsmin17297530540195222301;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Formula 0 simplified : X(!"(i7.u112.p488==1)" & XXXF(!"(i11.i1.i0.u175.p705==0)" & F!"(((i11.i3.i1.u162.p663==0)||(i5.i0.i3.u284.p1179==0))||(i7.u112.p488=...162
Compilation finished in 4434 ms.
Running link step : cd /tmp/ltsmin17297530540195222301;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin17297530540195222301;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)||X(X(X([](((LTLAPp1==true)||[]((LTLAPp2==true)))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin17297530540195222301;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)||X(X(X([](((LTLAPp1==true)||[]((LTLAPp2==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17297530540195222301;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp3==true)&&[](<>(((LTLAPp4==true)&&X((LTLAPp4==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-31 04:32:25] [INFO ] Applying decomposition
[2025-05-31 04:32:26] [INFO ] Flatten gal took : 416 ms
[2025-05-31 04:32:26] [INFO ] Decomposing Gal with order
[2025-05-31 04:32:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 04:32:27] [INFO ] Removed a total of 760 redundant transitions.
[2025-05-31 04:32:27] [INFO ] Flatten gal took : 224 ms
[2025-05-31 04:32:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 2197 labels/synchronizations in 1573 ms.
[2025-05-31 04:32:29] [INFO ] Time to serialize gal into /tmp/LTLFireability6641096942638673504.gal : 65 ms
[2025-05-31 04:32:29] [INFO ] Time to serialize properties into /tmp/LTLFireability9400780346307181712.ltl : 10 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6641096942638673504.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9400780346307181712.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((X(("(i0.i0.i0.i0.u12.p488==1)")||(X(X(X(G(("(i0.i0.u14.p705==0)")||(G("(((i0.i0.u14.p663==0)||(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....235
Formula 0 simplified : X(!"(i0.i0.i0.i0.u12.p488==1)" & XXXF(!"(i0.i0.u14.p705==0)" & F!"(((i0.i0.u14.p663==0)||(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....221
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin17297530540195222301;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp3==true)&&[](<>(((LTLAPp4==true)&&X((LTLAPp4==true)))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin17297530540195222301;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)||X(X(X([](((LTLAPp1==true)||[]((LTLAPp2==true)))))))))' '--buchi-type=spotba'

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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="DLCround-PT-03b"
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-5832"
echo " Executing tool itstools"
echo " Input is DLCround-PT-03b, 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 r072-tall-174860066800124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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