Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490500026.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 StigmergyCommit-PT-03b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490500026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 359K May 29 14:33 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 StigmergyCommit-PT-03b-CTLFireability-2023-12
FORMULA_NAME StigmergyCommit-PT-03b-CTLFireability-2023-13
FORMULA_NAME StigmergyCommit-PT-03b-CTLFireability-2023-14
FORMULA_NAME StigmergyCommit-PT-03b-CTLFireability-2023-15
FORMULA_NAME StigmergyCommit-PT-03b-CTLFireability-2025-00
FORMULA_NAME StigmergyCommit-PT-03b-CTLFireability-2025-01
FORMULA_NAME StigmergyCommit-PT-03b-CTLFireability-2025-02
FORMULA_NAME StigmergyCommit-PT-03b-CTLFireability-2025-03
FORMULA_NAME StigmergyCommit-PT-03b-CTLFireability-2025-04
FORMULA_NAME StigmergyCommit-PT-03b-CTLFireability-2025-05
FORMULA_NAME StigmergyCommit-PT-03b-CTLFireability-2025-06
FORMULA_NAME StigmergyCommit-PT-03b-CTLFireability-2025-07
FORMULA_NAME StigmergyCommit-PT-03b-CTLFireability-2025-08
FORMULA_NAME StigmergyCommit-PT-03b-CTLFireability-2025-09
FORMULA_NAME StigmergyCommit-PT-03b-CTLFireability-2025-10
FORMULA_NAME StigmergyCommit-PT-03b-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749052095942

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-04 15:48:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 15:48:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 15:48:19] [INFO ] Load time of PNML (sax parser for PT used): 323 ms
[2025-06-04 15:48:19] [INFO ] Transformed 1231 places.
[2025-06-04 15:48:19] [INFO ] Transformed 1476 transitions.
[2025-06-04 15:48:19] [INFO ] Found NUPN structural information;
[2025-06-04 15:48:19] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 570 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Support contains 149 out of 1231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 88 place count 1143 transition count 1388
Iterating global reduction 0 with 88 rules applied. Total rules applied 176 place count 1143 transition count 1388
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 225 place count 1094 transition count 1339
Iterating global reduction 0 with 49 rules applied. Total rules applied 274 place count 1094 transition count 1339
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 300 place count 1068 transition count 1313
Iterating global reduction 0 with 26 rules applied. Total rules applied 326 place count 1068 transition count 1313
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 348 place count 1046 transition count 1291
Iterating global reduction 0 with 22 rules applied. Total rules applied 370 place count 1046 transition count 1291
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 387 place count 1029 transition count 1274
Iterating global reduction 0 with 17 rules applied. Total rules applied 404 place count 1029 transition count 1274
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 421 place count 1012 transition count 1257
Iterating global reduction 0 with 17 rules applied. Total rules applied 438 place count 1012 transition count 1257
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 455 place count 995 transition count 1240
Iterating global reduction 0 with 17 rules applied. Total rules applied 472 place count 995 transition count 1240
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 487 place count 980 transition count 1225
Iterating global reduction 0 with 15 rules applied. Total rules applied 502 place count 980 transition count 1225
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 512 place count 970 transition count 1215
Iterating global reduction 0 with 10 rules applied. Total rules applied 522 place count 970 transition count 1215
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 527 place count 965 transition count 1210
Iterating global reduction 0 with 5 rules applied. Total rules applied 532 place count 965 transition count 1210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 533 place count 965 transition count 1209
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 534 place count 964 transition count 1208
Iterating global reduction 1 with 1 rules applied. Total rules applied 535 place count 964 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 536 place count 963 transition count 1207
Iterating global reduction 1 with 1 rules applied. Total rules applied 537 place count 963 transition count 1207
Applied a total of 537 rules in 1411 ms. Remains 963 /1231 variables (removed 268) and now considering 1207/1476 (removed 269) transitions.
// Phase 1: matrix 1207 rows 963 cols
[2025-06-04 15:48:21] [INFO ] Computed 5 invariants in 52 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:48:22] [INFO ] Implicit Places using invariants in 1188 ms returned []
[2025-06-04 15:48:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:48:23] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 2809 ms to find 0 implicit places.
Running 1206 sub problems to find dead transitions.
[2025-06-04 15:48:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 962/2170 variables, and 0 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 30124 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/963 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 962/2170 variables, and 0 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/963 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60872ms problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 60907ms
Starting structural reductions in LTL mode, iteration 1 : 963/1231 places, 1207/1476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65170 ms. Remains : 963/1231 places, 1207/1476 transitions.
Support contains 149 out of 963 places after structural reductions.
[2025-06-04 15:49:25] [INFO ] Flatten gal took : 250 ms
[2025-06-04 15:49:25] [INFO ] Flatten gal took : 140 ms
[2025-06-04 15:49:25] [INFO ] Input system was already deterministic with 1207 transitions.
Support contains 147 out of 963 places (down from 149) after GAL structural reductions.
RANDOM walk for 40000 steps (512 resets) in 2955 ms. (13 steps per ms) remains 61/96 properties
BEST_FIRST walk for 4003 steps (9 resets) in 49 ms. (80 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (9 resets) in 66 ms. (59 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (10 resets) in 43 ms. (90 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (10 resets) in 44 ms. (88 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 59/61 properties
BEST_FIRST walk for 4004 steps (9 resets) in 35 ms. (111 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (10 resets) in 28 ms. (138 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (10 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (10 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (11 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (10 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (10 resets) in 38 ms. (102 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (9 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (11 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (10 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (10 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (10 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (12 resets) in 11 ms. (333 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (10 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (9 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (11 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
[2025-06-04 15:49:27] [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/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 1 (OVERLAPS) 862/963 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 56 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:29] [INFO ] Deduced a trap composed of 334 places in 637 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:31] [INFO ] Deduced a trap composed of 322 places in 1141 ms of which 458 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:31] [INFO ] Deduced a trap composed of 327 places in 814 ms of which 267 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:32] [INFO ] Deduced a trap composed of 324 places in 681 ms of which 222 ms to minimize.
SMT process timed out in 5503ms, After SMT, problems are : Problem set: 3 solved, 56 unsolved
Fused 56 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 97 out of 963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 1207/1207 transitions.
Graph (trivial) has 767 edges and 963 vertex of which 45 / 963 are part of one of the 8 SCC in 9 ms
Free SCC test removed 37 places
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 1415 edges and 926 vertex of which 922 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 529 transitions
Trivial Post-agglo rules discarded 529 transitions
Performed 529 trivial Post agglomeration. Transition count delta: 529
Iterating post reduction 0 with 532 rules applied. Total rules applied 534 place count 922 transition count 627
Reduce places removed 529 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 534 rules applied. Total rules applied 1068 place count 393 transition count 622
Reduce places removed 2 places and 0 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 2 with 66 rules applied. Total rules applied 1134 place count 391 transition count 558
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 70 rules applied. Total rules applied 1204 place count 327 transition count 552
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1207 place count 324 transition count 552
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 47 Pre rules applied. Total rules applied 1207 place count 324 transition count 505
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 1301 place count 277 transition count 505
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1302 place count 276 transition count 504
Iterating global reduction 5 with 1 rules applied. Total rules applied 1303 place count 276 transition count 504
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1304 place count 275 transition count 503
Iterating global reduction 5 with 1 rules applied. Total rules applied 1305 place count 275 transition count 503
Performed 32 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 1369 place count 243 transition count 470
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1371 place count 243 transition count 468
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1378 place count 236 transition count 461
Iterating global reduction 6 with 7 rules applied. Total rules applied 1385 place count 236 transition count 461
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1387 place count 236 transition count 459
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1391 place count 232 transition count 455
Iterating global reduction 7 with 4 rules applied. Total rules applied 1395 place count 232 transition count 455
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1397 place count 230 transition count 453
Iterating global reduction 7 with 2 rules applied. Total rules applied 1399 place count 230 transition count 453
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1401 place count 229 transition count 452
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1411 place count 224 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 1418 place count 224 transition count 463
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1426 place count 224 transition count 455
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1434 place count 216 transition count 455
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1435 place count 216 transition count 454
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1441 place count 216 transition count 454
Applied a total of 1441 rules in 397 ms. Remains 216 /963 variables (removed 747) and now considering 454/1207 (removed 753) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 216/963 places, 454/1207 transitions.
RANDOM walk for 40000 steps (2993 resets) in 805 ms. (49 steps per ms) remains 42/56 properties
BEST_FIRST walk for 4003 steps (44 resets) in 35 ms. (111 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (42 resets) in 40 ms. (97 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (44 resets) in 36 ms. (108 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (43 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (39 resets) in 41 ms. (95 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (44 resets) in 31 ms. (125 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (45 resets) in 30 ms. (129 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (43 resets) in 45 ms. (87 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (41 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (43 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (43 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (42 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (42 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (41 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (42 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (43 resets) in 21 ms. (182 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (42 resets) in 24 ms. (160 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4004 steps (44 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (43 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (45 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (44 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (42 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (46 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (43 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (41 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (41 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (42 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (45 resets) in 47 ms. (83 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (44 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (34 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (42 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (43 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (42 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (44 resets) in 21 ms. (182 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (39 resets) in 13 ms. (286 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4003 steps (42 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (41 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (44 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (44 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (37 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
// Phase 1: matrix 454 rows 216 cols
[2025-06-04 15:49:33] [INFO ] Computed 4 invariants in 10 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 107/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 449/630 variables, 181/185 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/630 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 36/666 variables, 32/217 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 4/670 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:36] [INFO ] Deduced a trap composed of 75 places in 221 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:36] [INFO ] Deduced a trap composed of 72 places in 234 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:37] [INFO ] Deduced a trap composed of 66 places in 338 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:37] [INFO ] Deduced a trap composed of 67 places in 288 ms of which 26 ms to minimize.
Problem AtomicPropp90 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/670 variables, 4/224 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/670 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/670 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 670/670 variables, and 224 constraints, problems are : Problem set: 1 solved, 39 unsolved in 7110 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 39 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 39 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 1 (OVERLAPS) 110/180 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 448/628 variables, 180/186 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/628 variables, 18/204 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 0/204 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 38/666 variables, 33/237 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/666 variables, 20/257 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 1/258 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/666 variables, 0/258 constraints. Problems are: Problem set: 2 solved, 38 unsolved
Problem AtomicPropp70 is UNSAT
At refinement iteration 11 (OVERLAPS) 4/670 variables, 3/261 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/670 variables, 1/262 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/670 variables, 0/262 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 14 (OVERLAPS) 0/670 variables, 0/262 constraints. Problems are: Problem set: 3 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 670/670 variables, and 262 constraints, problems are : Problem set: 3 solved, 37 unsolved in 12558 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 38/40 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19719ms problems are : Problem set: 3 solved, 37 unsolved
Parikh walk visited 7 properties in 3576 ms.
Support contains 53 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 454/454 transitions.
Graph (trivial) has 81 edges and 216 vertex of which 6 / 216 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 213 transition count 420
Reduce places removed 28 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 36 rules applied. Total rules applied 65 place count 185 transition count 412
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 73 place count 177 transition count 412
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 73 place count 177 transition count 408
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 81 place count 173 transition count 408
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 92 place count 162 transition count 320
Iterating global reduction 3 with 11 rules applied. Total rules applied 103 place count 162 transition count 320
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 108 place count 162 transition count 315
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 160 transition count 313
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 160 transition count 313
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 130 place count 151 transition count 304
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 131 place count 151 transition count 303
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 135 place count 147 transition count 299
Iterating global reduction 5 with 4 rules applied. Total rules applied 139 place count 147 transition count 299
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 143 place count 143 transition count 295
Iterating global reduction 5 with 4 rules applied. Total rules applied 147 place count 143 transition count 295
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 151 place count 139 transition count 291
Iterating global reduction 5 with 4 rules applied. Total rules applied 155 place count 139 transition count 291
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 174 place count 139 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 176 place count 138 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 177 place count 138 transition count 277
Free-agglomeration rule applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 192 place count 138 transition count 262
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 207 place count 123 transition count 262
Applied a total of 207 rules in 80 ms. Remains 123 /216 variables (removed 93) and now considering 262/454 (removed 192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 123/216 places, 262/454 transitions.
RANDOM walk for 40000 steps (3537 resets) in 333 ms. (119 steps per ms) remains 17/30 properties
BEST_FIRST walk for 4004 steps (53 resets) in 11 ms. (333 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (65 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (69 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (59 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (64 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (63 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (63 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (65 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (57 resets) in 10 ms. (363 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4004 steps (65 resets) in 10 ms. (364 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (64 resets) in 17 ms. (222 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (60 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (58 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (65 resets) in 13 ms. (286 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (62 resets) in 12 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (59 resets) in 12 ms. (307 steps per ms) remains 14/14 properties
// Phase 1: matrix 262 rows 123 cols
[2025-06-04 15:49:57] [INFO ] Computed 4 invariants in 2 ms
[2025-06-04 15:49:57] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 64/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 240/330 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 67/161 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 40/370 variables, 25/186 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 10/380 variables, 5/195 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 4/384 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/384 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 1/385 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/385 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 0/385 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 198 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1109 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 123/123 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 64/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 240/330 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 67/161 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 9/170 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 40/370 variables, 25/195 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:59] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 10/380 variables, 5/210 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 4/384 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 1/385 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/385 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 0/385 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 213 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3514 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 123/123 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4639ms problems are : Problem set: 0 solved, 14 unsolved
Parikh walk visited 12 properties in 1116 ms.
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 262/262 transitions.
Graph (trivial) has 101 edges and 123 vertex of which 6 / 123 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 348 edges and 119 vertex of which 118 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 118 transition count 212
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 91 place count 77 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 76 transition count 206
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 92 place count 76 transition count 203
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 98 place count 73 transition count 203
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 106 place count 65 transition count 149
Iterating global reduction 3 with 8 rules applied. Total rules applied 114 place count 65 transition count 149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 118 place count 65 transition count 145
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 120 place count 63 transition count 143
Iterating global reduction 4 with 2 rules applied. Total rules applied 122 place count 63 transition count 143
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 134 place count 57 transition count 137
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 135 place count 57 transition count 136
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 140 place count 52 transition count 131
Iterating global reduction 5 with 5 rules applied. Total rules applied 145 place count 52 transition count 131
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 147 place count 50 transition count 129
Iterating global reduction 5 with 2 rules applied. Total rules applied 149 place count 50 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 150 place count 50 transition count 128
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 151 place count 49 transition count 127
Iterating global reduction 6 with 1 rules applied. Total rules applied 152 place count 49 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 154 place count 48 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 157 place count 48 transition count 137
Free-agglomeration rule applied 17 times with reduction of 15 identical transitions.
Iterating global reduction 6 with 17 rules applied. Total rules applied 174 place count 48 transition count 105
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 35 rules applied. Total rules applied 209 place count 31 transition count 87
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 213 place count 27 transition count 83
Iterating global reduction 7 with 4 rules applied. Total rules applied 217 place count 27 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 218 place count 27 transition count 82
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 239 place count 27 transition count 61
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 243 place count 27 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 244 place count 27 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 246 place count 27 transition count 58
Applied a total of 246 rules in 58 ms. Remains 27 /123 variables (removed 96) and now considering 58/262 (removed 204) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 27/123 places, 58/262 transitions.
RANDOM walk for 1547 steps (0 resets) in 48 ms. (31 steps per ms) remains 0/2 properties
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA StigmergyCommit-PT-03b-CTLFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 15:50:03] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-04 15:50:03] [INFO ] Flatten gal took : 103 ms
FORMULA StigmergyCommit-PT-03b-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-CTLFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 15:50:03] [INFO ] Flatten gal took : 59 ms
[2025-06-04 15:50:03] [INFO ] Input system was already deterministic with 1207 transitions.
Support contains 116 out of 963 places (down from 119) after GAL structural reductions.
Computed a total of 173 stabilizing places and 181 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 963/963 places, 1207/1207 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 936 transition count 1180
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 936 transition count 1180
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 73 place count 917 transition count 1161
Iterating global reduction 0 with 19 rules applied. Total rules applied 92 place count 917 transition count 1161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 917 transition count 1160
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 105 place count 905 transition count 1148
Iterating global reduction 1 with 12 rules applied. Total rules applied 117 place count 905 transition count 1148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 118 place count 905 transition count 1147
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 128 place count 895 transition count 1137
Iterating global reduction 2 with 10 rules applied. Total rules applied 138 place count 895 transition count 1137
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 147 place count 886 transition count 1128
Iterating global reduction 2 with 9 rules applied. Total rules applied 156 place count 886 transition count 1128
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 165 place count 877 transition count 1119
Iterating global reduction 2 with 9 rules applied. Total rules applied 174 place count 877 transition count 1119
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 182 place count 869 transition count 1111
Iterating global reduction 2 with 8 rules applied. Total rules applied 190 place count 869 transition count 1111
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 196 place count 863 transition count 1105
Iterating global reduction 2 with 6 rules applied. Total rules applied 202 place count 863 transition count 1105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 203 place count 863 transition count 1104
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 207 place count 859 transition count 1100
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 859 transition count 1100
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 215 place count 855 transition count 1096
Iterating global reduction 3 with 4 rules applied. Total rules applied 219 place count 855 transition count 1096
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 223 place count 851 transition count 1092
Iterating global reduction 3 with 4 rules applied. Total rules applied 227 place count 851 transition count 1092
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 231 place count 847 transition count 1088
Iterating global reduction 3 with 4 rules applied. Total rules applied 235 place count 847 transition count 1088
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 238 place count 844 transition count 1085
Iterating global reduction 3 with 3 rules applied. Total rules applied 241 place count 844 transition count 1085
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 244 place count 841 transition count 1082
Iterating global reduction 3 with 3 rules applied. Total rules applied 247 place count 841 transition count 1082
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 250 place count 838 transition count 1079
Iterating global reduction 3 with 3 rules applied. Total rules applied 253 place count 838 transition count 1079
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 256 place count 835 transition count 1076
Iterating global reduction 3 with 3 rules applied. Total rules applied 259 place count 835 transition count 1076
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 262 place count 832 transition count 1073
Iterating global reduction 3 with 3 rules applied. Total rules applied 265 place count 832 transition count 1073
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 268 place count 829 transition count 1070
Iterating global reduction 3 with 3 rules applied. Total rules applied 271 place count 829 transition count 1070
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 273 place count 827 transition count 1068
Iterating global reduction 3 with 2 rules applied. Total rules applied 275 place count 827 transition count 1068
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 277 place count 825 transition count 1066
Iterating global reduction 3 with 2 rules applied. Total rules applied 279 place count 825 transition count 1066
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 280 place count 825 transition count 1065
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 281 place count 824 transition count 1064
Iterating global reduction 4 with 1 rules applied. Total rules applied 282 place count 824 transition count 1064
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 283 place count 823 transition count 1063
Iterating global reduction 4 with 1 rules applied. Total rules applied 284 place count 823 transition count 1063
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 285 place count 823 transition count 1062
Applied a total of 285 rules in 896 ms. Remains 823 /963 variables (removed 140) and now considering 1062/1207 (removed 145) transitions.
// Phase 1: matrix 1062 rows 823 cols
[2025-06-04 15:50:04] [INFO ] Computed 5 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:50:05] [INFO ] Implicit Places using invariants in 476 ms returned []
[2025-06-04 15:50:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:50:06] [INFO ] Implicit Places using invariants and state equation in 1576 ms returned []
Implicit Place search using SMT with State Equation took 2055 ms to find 0 implicit places.
Running 1061 sub problems to find dead transitions.
[2025-06-04 15:50:06] [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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 822/1885 variables, and 0 constraints, problems are : Problem set: 0 solved, 1061 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/823 constraints, PredecessorRefiner: 1061/1061 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1061 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 822/1885 variables, and 0 constraints, problems are : Problem set: 0 solved, 1061 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/823 constraints, PredecessorRefiner: 0/1061 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60541ms problems are : Problem set: 0 solved, 1061 unsolved
Search for dead transitions found 0 dead transitions in 60546ms
Starting structural reductions in LTL mode, iteration 1 : 823/963 places, 1062/1207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63501 ms. Remains : 823/963 places, 1062/1207 transitions.
[2025-06-04 15:51:07] [INFO ] Flatten gal took : 79 ms
[2025-06-04 15:51:07] [INFO ] Flatten gal took : 60 ms
[2025-06-04 15:51:07] [INFO ] Input system was already deterministic with 1062 transitions.
[2025-06-04 15:51:07] [INFO ] Flatten gal took : 54 ms
[2025-06-04 15:51:07] [INFO ] Flatten gal took : 55 ms
[2025-06-04 15:51:07] [INFO ] Time to serialize gal into /tmp/CTLFireability8861622331707006856.gal : 66 ms
[2025-06-04 15:51:07] [INFO ] Time to serialize properties into /tmp/CTLFireability14877886790150217704.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8861622331707006856.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14877886790150217704.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05253e+10,22.5707,467092,2,27565,5,1.42487e+06,6,0,4356,2.02078e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 15:51:37] [INFO ] Flatten gal took : 32 ms
[2025-06-04 15:51:37] [INFO ] Applying decomposition
[2025-06-04 15:51:37] [INFO ] Flatten gal took : 31 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/graph16664026884865945235.txt' '-o' '/tmp/graph16664026884865945235.bin' '-w' '/tmp/graph16664026884865945235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16664026884865945235.bin' '-l' '-1' '-v' '-w' '/tmp/graph16664026884865945235.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:51:38] [INFO ] Decomposing Gal with order
[2025-06-04 15:51:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:51:38] [INFO ] Removed a total of 867 redundant transitions.
[2025-06-04 15:51:38] [INFO ] Flatten gal took : 156 ms
[2025-06-04 15:51:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 24 ms.
[2025-06-04 15:51:38] [INFO ] Time to serialize gal into /tmp/CTLFireability11740633497510843863.gal : 21 ms
[2025-06-04 15:51:38] [INFO ] Time to serialize properties into /tmp/CTLFireability11779932427136275769.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11740633497510843863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11779932427136275769.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05253e+10,8.37509,244232,2087,15,430576,1085,1297,1.30572e+06,45,3451,0


Converting to forward existential form...Done !
original formula: (AX(((((AX((i26.u241.p869==0)) + EF((i6.i0.i2.u58.p167==0))) + ((((E((i22.u197.p680==1) U (((i1.u18.p49==1)&&(i1.u100.p351==1))&&((i1.u18...525
=> equivalent forward existential formula: (((([(EY(((((EY(Init) * !((((i1.u100.p351==0)||(i1.u177.p631==0))||(i1.u254.p955==0)))) * !((!(EX(!((i26.u241.p8...1026
Reverse transition relation is NOT exact ! Due to transitions t76, t159, t249, t283, t341, t342, t396, t398, t432, t462, t526, t582, t615, t702, t703, t759...636
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 963/963 places, 1207/1207 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 937 transition count 1181
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 937 transition count 1181
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 72 place count 917 transition count 1161
Iterating global reduction 0 with 20 rules applied. Total rules applied 92 place count 917 transition count 1161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 917 transition count 1160
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 106 place count 904 transition count 1147
Iterating global reduction 1 with 13 rules applied. Total rules applied 119 place count 904 transition count 1147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 120 place count 904 transition count 1146
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 130 place count 894 transition count 1136
Iterating global reduction 2 with 10 rules applied. Total rules applied 140 place count 894 transition count 1136
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 148 place count 886 transition count 1128
Iterating global reduction 2 with 8 rules applied. Total rules applied 156 place count 886 transition count 1128
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 163 place count 879 transition count 1121
Iterating global reduction 2 with 7 rules applied. Total rules applied 170 place count 879 transition count 1121
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 176 place count 873 transition count 1115
Iterating global reduction 2 with 6 rules applied. Total rules applied 182 place count 873 transition count 1115
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 186 place count 869 transition count 1111
Iterating global reduction 2 with 4 rules applied. Total rules applied 190 place count 869 transition count 1111
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 193 place count 866 transition count 1108
Iterating global reduction 2 with 3 rules applied. Total rules applied 196 place count 866 transition count 1108
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 199 place count 863 transition count 1105
Iterating global reduction 2 with 3 rules applied. Total rules applied 202 place count 863 transition count 1105
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 205 place count 860 transition count 1102
Iterating global reduction 2 with 3 rules applied. Total rules applied 208 place count 860 transition count 1102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 211 place count 857 transition count 1099
Iterating global reduction 2 with 3 rules applied. Total rules applied 214 place count 857 transition count 1099
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 216 place count 855 transition count 1097
Iterating global reduction 2 with 2 rules applied. Total rules applied 218 place count 855 transition count 1097
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 220 place count 853 transition count 1095
Iterating global reduction 2 with 2 rules applied. Total rules applied 222 place count 853 transition count 1095
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 224 place count 851 transition count 1093
Iterating global reduction 2 with 2 rules applied. Total rules applied 226 place count 851 transition count 1093
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 228 place count 849 transition count 1091
Iterating global reduction 2 with 2 rules applied. Total rules applied 230 place count 849 transition count 1091
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 232 place count 847 transition count 1089
Iterating global reduction 2 with 2 rules applied. Total rules applied 234 place count 847 transition count 1089
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 236 place count 845 transition count 1087
Iterating global reduction 2 with 2 rules applied. Total rules applied 238 place count 845 transition count 1087
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 240 place count 843 transition count 1085
Iterating global reduction 2 with 2 rules applied. Total rules applied 242 place count 843 transition count 1085
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 244 place count 841 transition count 1083
Iterating global reduction 2 with 2 rules applied. Total rules applied 246 place count 841 transition count 1083
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 248 place count 841 transition count 1081
Applied a total of 248 rules in 611 ms. Remains 841 /963 variables (removed 122) and now considering 1081/1207 (removed 126) transitions.
// Phase 1: matrix 1081 rows 841 cols
[2025-06-04 15:52:09] [INFO ] Computed 5 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:52:09] [INFO ] Implicit Places using invariants in 532 ms returned []
[2025-06-04 15:52:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:52:11] [INFO ] Implicit Places using invariants and state equation in 1284 ms returned []
Implicit Place search using SMT with State Equation took 1824 ms to find 0 implicit places.
Running 1080 sub problems to find dead transitions.
[2025-06-04 15:52:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/1922 variables, and 0 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 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 840/1922 variables, and 0 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60664ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 60670ms
Starting structural reductions in LTL mode, iteration 1 : 841/963 places, 1081/1207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63110 ms. Remains : 841/963 places, 1081/1207 transitions.
[2025-06-04 15:53:12] [INFO ] Flatten gal took : 107 ms
[2025-06-04 15:53:12] [INFO ] Flatten gal took : 57 ms
[2025-06-04 15:53:12] [INFO ] Input system was already deterministic with 1081 transitions.
[2025-06-04 15:53:12] [INFO ] Flatten gal took : 53 ms
[2025-06-04 15:53:12] [INFO ] Flatten gal took : 65 ms
[2025-06-04 15:53:12] [INFO ] Time to serialize gal into /tmp/CTLFireability292313009099062194.gal : 27 ms
[2025-06-04 15:53:12] [INFO ] Time to serialize properties into /tmp/CTLFireability14864156092541081194.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability292313009099062194.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14864156092541081194.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11257e+10,26.0769,534340,2,34471,5,1.72061e+06,6,0,4447,2.28549e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 15:53:42] [INFO ] Flatten gal took : 28 ms
[2025-06-04 15:53:42] [INFO ] Applying decomposition
[2025-06-04 15:53:42] [INFO ] Flatten gal took : 27 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/graph836571685055100762.txt' '-o' '/tmp/graph836571685055100762.bin' '-w' '/tmp/graph836571685055100762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph836571685055100762.bin' '-l' '-1' '-v' '-w' '/tmp/graph836571685055100762.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:53:42] [INFO ] Decomposing Gal with order
[2025-06-04 15:53:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:53:42] [INFO ] Removed a total of 861 redundant transitions.
[2025-06-04 15:53:42] [INFO ] Flatten gal took : 72 ms
[2025-06-04 15:53:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 22 ms.
[2025-06-04 15:53:43] [INFO ] Time to serialize gal into /tmp/CTLFireability14333469967318648050.gal : 12 ms
[2025-06-04 15:53:43] [INFO ] Time to serialize properties into /tmp/CTLFireability17784533038389866995.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14333469967318648050.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17784533038389866995.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11257e+10,8.70882,247072,2431,13,405567,1021,1354,1.44908e+06,55,3350,0


Converting to forward existential form...Done !
original formula: A(E((A(((EF((((i18.u3.p139==1)&&(i18.u106.p441==1))&&((i18.u173.p743==1)&&(i18.u255.p1045==1)))) * (i13.i1.i0.u142.p468==1)) * (i24.u228....864
=> equivalent forward existential formula: [((Init * !(EG(!((!((E(!(!(E(TRUE U !(!(EX(!((i14.u87.p322==1)))))))) U (!(((i37.u341.p1207!=1) * ((EX((i28.i0.i...2308
Reverse transition relation is NOT exact ! Due to transitions t77, t109, t238, t272, t299, t355, t411, t445, t545, t546, t600, t603, t636, t663, t719, t795...597
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 963/963 places, 1207/1207 transitions.
Graph (trivial) has 952 edges and 963 vertex of which 76 / 963 are part of one of the 12 SCC in 3 ms
Free SCC test removed 64 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 674 transitions
Trivial Post-agglo rules discarded 674 transitions
Performed 674 trivial Post agglomeration. Transition count delta: 674
Iterating post reduction 0 with 674 rules applied. Total rules applied 675 place count 898 transition count 460
Reduce places removed 674 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 684 rules applied. Total rules applied 1359 place count 224 transition count 450
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 1365 place count 220 transition count 448
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1367 place count 218 transition count 448
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1367 place count 218 transition count 402
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1459 place count 172 transition count 402
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1475 place count 156 transition count 385
Iterating global reduction 4 with 16 rules applied. Total rules applied 1491 place count 156 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1491 place count 156 transition count 384
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1493 place count 155 transition count 384
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1498 place count 150 transition count 378
Iterating global reduction 4 with 5 rules applied. Total rules applied 1503 place count 150 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1504 place count 150 transition count 377
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1505 place count 149 transition count 375
Iterating global reduction 5 with 1 rules applied. Total rules applied 1506 place count 149 transition count 375
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 1558 place count 123 transition count 349
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1563 place count 123 transition count 344
Discarding 25 places :
Symmetric choice reduction at 6 with 25 rule applications. Total rules 1588 place count 98 transition count 194
Iterating global reduction 6 with 25 rules applied. Total rules applied 1613 place count 98 transition count 194
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1623 place count 98 transition count 184
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1637 place count 84 transition count 167
Iterating global reduction 7 with 14 rules applied. Total rules applied 1651 place count 84 transition count 167
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1665 place count 70 transition count 150
Iterating global reduction 7 with 14 rules applied. Total rules applied 1679 place count 70 transition count 150
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1686 place count 70 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1688 place count 69 transition count 142
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1689 place count 68 transition count 138
Iterating global reduction 8 with 1 rules applied. Total rules applied 1690 place count 68 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1691 place count 68 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1695 place count 68 transition count 133
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 1703 place count 64 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1704 place count 63 transition count 128
Applied a total of 1704 rules in 92 ms. Remains 63 /963 variables (removed 900) and now considering 128/1207 (removed 1079) transitions.
[2025-06-04 15:54:13] [INFO ] Flow matrix only has 123 transitions (discarded 5 similar events)
// Phase 1: matrix 123 rows 63 cols
[2025-06-04 15:54:13] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:54:13] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-04 15:54:13] [INFO ] Flow matrix only has 123 transitions (discarded 5 similar events)
[2025-06-04 15:54:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:54:13] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 15:54:13] [INFO ] Implicit Places using invariants and state equation in 161 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-06-04 15:54:13] [INFO ] Redundant transitions in 4 ms returned []
Running 119 sub problems to find dead transitions.
[2025-06-04 15:54:13] [INFO ] Flow matrix only has 123 transitions (discarded 5 similar events)
[2025-06-04 15:54:13] [INFO ] Invariant cache hit.
[2025-06-04 15:54:13] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 4/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:14] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:14] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:14] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:15] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:15] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:15] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:15] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:15] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:15] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:15] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:15] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:15] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 122/185 variables, 63/77 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 14/91 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:17] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:18] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:18] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 1/186 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/186 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 95 constraints, problems are : Problem set: 0 solved, 119 unsolved in 12443 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 4/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 122/185 variables, 63/80 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 14/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 119/213 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 1/186 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:32] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:33] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:38] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 6 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/186 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/186 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (OVERLAPS) 0/186 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 217 constraints, problems are : Problem set: 0 solved, 119 unsolved in 22282 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34757ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 34758ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/963 places, 128/1207 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35108 ms. Remains : 63/963 places, 128/1207 transitions.
[2025-06-04 15:54:48] [INFO ] Flatten gal took : 9 ms
[2025-06-04 15:54:48] [INFO ] Flatten gal took : 6 ms
[2025-06-04 15:54:48] [INFO ] Input system was already deterministic with 128 transitions.
[2025-06-04 15:54:48] [INFO ] Flatten gal took : 6 ms
[2025-06-04 15:54:48] [INFO ] Flatten gal took : 12 ms
[2025-06-04 15:54:48] [INFO ] Time to serialize gal into /tmp/CTLFireability17646018056034294113.gal : 3 ms
[2025-06-04 15:54:48] [INFO ] Time to serialize properties into /tmp/CTLFireability1027779690489304172.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17646018056034294113.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1027779690489304172.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,71194,0.314708,10700,2,2616,5,23896,6,0,372,24188,0


Converting to forward existential form...Done !
original formula: EF(EG((EG((p53==1)) + (p534==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(EG((p53==1)) + (p534==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t6, t7, t8, t16, t17, t18, t23, t25, t26, t27, t44, t52, t53, t54, t55, t64, t65,...330
(forward)formula 0,1,2.48609,58732,1,0,357,258427,277,152,3335,245509,394
FORMULA StigmergyCommit-PT-03b-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 963/963 places, 1207/1207 transitions.
Graph (trivial) has 947 edges and 963 vertex of which 76 / 963 are part of one of the 12 SCC in 2 ms
Free SCC test removed 64 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 672 transitions
Trivial Post-agglo rules discarded 672 transitions
Performed 672 trivial Post agglomeration. Transition count delta: 672
Iterating post reduction 0 with 672 rules applied. Total rules applied 673 place count 898 transition count 462
Reduce places removed 672 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 682 rules applied. Total rules applied 1355 place count 226 transition count 452
Reduce places removed 4 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 10 rules applied. Total rules applied 1365 place count 222 transition count 446
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1371 place count 216 transition count 446
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1371 place count 216 transition count 400
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1463 place count 170 transition count 400
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1479 place count 154 transition count 383
Iterating global reduction 4 with 16 rules applied. Total rules applied 1495 place count 154 transition count 383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1495 place count 154 transition count 382
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1497 place count 153 transition count 382
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1502 place count 148 transition count 376
Iterating global reduction 4 with 5 rules applied. Total rules applied 1507 place count 148 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1508 place count 148 transition count 375
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1510 place count 146 transition count 372
Iterating global reduction 5 with 2 rules applied. Total rules applied 1512 place count 146 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1513 place count 146 transition count 371
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 1565 place count 120 transition count 345
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1570 place count 120 transition count 340
Discarding 25 places :
Symmetric choice reduction at 7 with 25 rule applications. Total rules 1595 place count 95 transition count 190
Iterating global reduction 7 with 25 rules applied. Total rules applied 1620 place count 95 transition count 190
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1631 place count 95 transition count 179
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1645 place count 81 transition count 162
Iterating global reduction 8 with 14 rules applied. Total rules applied 1659 place count 81 transition count 162
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1673 place count 67 transition count 145
Iterating global reduction 8 with 14 rules applied. Total rules applied 1687 place count 67 transition count 145
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1694 place count 67 transition count 138
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 9 with 2 rules applied. Total rules applied 1696 place count 66 transition count 137
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1697 place count 65 transition count 133
Iterating global reduction 9 with 1 rules applied. Total rules applied 1698 place count 65 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1699 place count 65 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1703 place count 65 transition count 128
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 1711 place count 61 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1712 place count 60 transition count 123
Applied a total of 1712 rules in 77 ms. Remains 60 /963 variables (removed 903) and now considering 123/1207 (removed 1084) transitions.
[2025-06-04 15:54:50] [INFO ] Flow matrix only has 119 transitions (discarded 4 similar events)
// Phase 1: matrix 119 rows 60 cols
[2025-06-04 15:54:50] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:54:50] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-04 15:54:50] [INFO ] Flow matrix only has 119 transitions (discarded 4 similar events)
[2025-06-04 15:54:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:54:51] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 15:54:51] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:54:51] [INFO ] Redundant transitions in 3 ms returned []
Running 114 sub problems to find dead transitions.
[2025-06-04 15:54:51] [INFO ] Flow matrix only has 119 transitions (discarded 4 similar events)
[2025-06-04 15:54:51] [INFO ] Invariant cache hit.
[2025-06-04 15:54:51] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 4/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:51] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:52] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:52] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:52] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:52] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:52] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:52] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:52] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:52] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:52] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:53] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:53] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:53] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:53] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:54:54] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 118/178 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 14/91 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 1/179 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (OVERLAPS) 0/179 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 92 constraints, problems are : Problem set: 0 solved, 114 unsolved in 8440 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 4/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 118/178 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 14/91 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 114/205 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 1/179 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (OVERLAPS) 0/179 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 206 constraints, problems are : Problem set: 0 solved, 114 unsolved in 11346 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19825ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 19825ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/963 places, 123/1207 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20142 ms. Remains : 60/963 places, 123/1207 transitions.
[2025-06-04 15:55:10] [INFO ] Flatten gal took : 7 ms
[2025-06-04 15:55:10] [INFO ] Flatten gal took : 6 ms
[2025-06-04 15:55:10] [INFO ] Input system was already deterministic with 123 transitions.
RANDOM walk for 49 steps (1 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-03b-CTLFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-04 15:55:11] [INFO ] Flatten gal took : 6 ms
[2025-06-04 15:55:11] [INFO ] Flatten gal took : 6 ms
[2025-06-04 15:55:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12524472353723906402.gal : 1 ms
[2025-06-04 15:55:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5515852742029634656.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12524472353723906402.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5515852742029634656.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 963/963 places, 1207/1207 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 933 transition count 1177
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 933 transition count 1177
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 83 place count 910 transition count 1154
Iterating global reduction 0 with 23 rules applied. Total rules applied 106 place count 910 transition count 1154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 107 place count 910 transition count 1153
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 123 place count 894 transition count 1137
Iterating global reduction 1 with 16 rules applied. Total rules applied 139 place count 894 transition count 1137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 140 place count 894 transition count 1136
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 153 place count 881 transition count 1123
Iterating global reduction 2 with 13 rules applied. Total rules applied 166 place count 881 transition count 1123
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 176 place count 871 transition count 1113
Iterating global reduction 2 with 10 rules applied. Total rules applied 186 place count 871 transition count 1113
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 196 place count 861 transition count 1103
Iterating global reduction 2 with 10 rules applied. Total rules applied 206 place count 861 transition count 1103
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 214 place count 853 transition count 1095
Iterating global reduction 2 with 8 rules applied. Total rules applied 222 place count 853 transition count 1095
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 228 place count 847 transition count 1089
Iterating global reduction 2 with 6 rules applied. Total rules applied 234 place count 847 transition count 1089
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 235 place count 847 transition count 1088
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 238 place count 844 transition count 1085
Iterating global reduction 3 with 3 rules applied. Total rules applied 241 place count 844 transition count 1085
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 244 place count 841 transition count 1082
Iterating global reduction 3 with 3 rules applied. Total rules applied 247 place count 841 transition count 1082
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 249 place count 839 transition count 1080
Iterating global reduction 3 with 2 rules applied. Total rules applied 251 place count 839 transition count 1080
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 253 place count 837 transition count 1078
Iterating global reduction 3 with 2 rules applied. Total rules applied 255 place count 837 transition count 1078
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 256 place count 836 transition count 1077
Iterating global reduction 3 with 1 rules applied. Total rules applied 257 place count 836 transition count 1077
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 258 place count 836 transition count 1076
Applied a total of 258 rules in 610 ms. Remains 836 /963 variables (removed 127) and now considering 1076/1207 (removed 131) transitions.
// Phase 1: matrix 1076 rows 836 cols
[2025-06-04 15:55:11] [INFO ] Computed 5 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:55:12] [INFO ] Implicit Places using invariants in 734 ms returned []
[2025-06-04 15:55:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:55:13] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned []
Implicit Place search using SMT with State Equation took 2322 ms to find 0 implicit places.
Running 1075 sub problems to find dead transitions.
[2025-06-04 15:55:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/1912 variables, and 0 constraints, problems are : Problem set: 0 solved, 1075 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/836 constraints, PredecessorRefiner: 1075/1075 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1075 unsolved
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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/1912 variables, and 0 constraints, problems are : Problem set: 0 solved, 1075 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/836 constraints, PredecessorRefiner: 0/1075 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60620ms problems are : Problem set: 0 solved, 1075 unsolved
Search for dead transitions found 0 dead transitions in 60625ms
Starting structural reductions in LTL mode, iteration 1 : 836/963 places, 1076/1207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63561 ms. Remains : 836/963 places, 1076/1207 transitions.
[2025-06-04 15:56:14] [INFO ] Flatten gal took : 45 ms
[2025-06-04 15:56:14] [INFO ] Flatten gal took : 46 ms
[2025-06-04 15:56:14] [INFO ] Input system was already deterministic with 1076 transitions.
[2025-06-04 15:56:14] [INFO ] Flatten gal took : 46 ms
[2025-06-04 15:56:14] [INFO ] Flatten gal took : 46 ms
[2025-06-04 15:56:14] [INFO ] Time to serialize gal into /tmp/CTLFireability2214794552948312356.gal : 13 ms
[2025-06-04 15:56:14] [INFO ] Time to serialize properties into /tmp/CTLFireability16189384644793956827.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2214794552948312356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16189384644793956827.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11042e+10,28.8582,501032,2,26827,5,1.5184e+06,6,0,4422,2.19304e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 15:56:45] [INFO ] Flatten gal took : 43 ms
[2025-06-04 15:56:45] [INFO ] Applying decomposition
[2025-06-04 15:56:45] [INFO ] Flatten gal took : 27 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/graph3582662632145023696.txt' '-o' '/tmp/graph3582662632145023696.bin' '-w' '/tmp/graph3582662632145023696.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3582662632145023696.bin' '-l' '-1' '-v' '-w' '/tmp/graph3582662632145023696.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:56:45] [INFO ] Decomposing Gal with order
[2025-06-04 15:56:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:56:45] [INFO ] Removed a total of 871 redundant transitions.
[2025-06-04 15:56:45] [INFO ] Flatten gal took : 67 ms
[2025-06-04 15:56:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 12 ms.
[2025-06-04 15:56:45] [INFO ] Time to serialize gal into /tmp/CTLFireability9363642416624669903.gal : 12 ms
[2025-06-04 15:56:45] [INFO ] Time to serialize properties into /tmp/CTLFireability1471122391130350345.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9363642416624669903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1471122391130350345.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11042e+10,5.45096,143052,2267,15,266001,969,1206,673419,47,2726,0


Converting to forward existential form...Done !
original formula: (E(AX((AG(((i1.u119.p395==1)&&(i37.u345.p1214==1))) * ((EF((i28.i0.i1.u268.p943==1)) * (i6.u57.p250!=1)) + AF((i30.u309.p1098==1))))) U (...467
=> equivalent forward existential formula: ([(((FwdU(Init,!(EX(!((!(E(TRUE U !(((i1.u119.p395==1)&&(i37.u345.p1214==1))))) * ((E(TRUE U (i28.i0.i1.u268.p94...594
Reverse transition relation is NOT exact ! Due to transitions t76, t170, t226, t260, t356, t446, t529, t585, t618, t708, t709, t765, t785, t786, t792, t795...619
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 963/963 places, 1207/1207 transitions.
Graph (trivial) has 953 edges and 963 vertex of which 74 / 963 are part of one of the 12 SCC in 2 ms
Free SCC test removed 62 places
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 678 transitions
Trivial Post-agglo rules discarded 678 transitions
Performed 678 trivial Post agglomeration. Transition count delta: 678
Iterating post reduction 0 with 678 rules applied. Total rules applied 679 place count 900 transition count 459
Reduce places removed 678 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 688 rules applied. Total rules applied 1367 place count 222 transition count 449
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1371 place count 218 transition count 449
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1371 place count 218 transition count 402
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1465 place count 171 transition count 402
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1480 place count 156 transition count 387
Iterating global reduction 3 with 15 rules applied. Total rules applied 1495 place count 156 transition count 387
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1495 place count 156 transition count 386
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1497 place count 155 transition count 386
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1501 place count 151 transition count 382
Iterating global reduction 3 with 4 rules applied. Total rules applied 1505 place count 151 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1506 place count 151 transition count 381
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1507 place count 150 transition count 380
Iterating global reduction 4 with 1 rules applied. Total rules applied 1508 place count 150 transition count 380
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1509 place count 150 transition count 379
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 1561 place count 124 transition count 353
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1566 place count 124 transition count 348
Discarding 25 places :
Symmetric choice reduction at 6 with 25 rule applications. Total rules 1591 place count 99 transition count 198
Iterating global reduction 6 with 25 rules applied. Total rules applied 1616 place count 99 transition count 198
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1627 place count 99 transition count 187
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1641 place count 85 transition count 170
Iterating global reduction 7 with 14 rules applied. Total rules applied 1655 place count 85 transition count 170
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1669 place count 71 transition count 153
Iterating global reduction 7 with 14 rules applied. Total rules applied 1683 place count 71 transition count 153
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1690 place count 71 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1692 place count 70 transition count 145
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1693 place count 69 transition count 140
Iterating global reduction 8 with 1 rules applied. Total rules applied 1694 place count 69 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1695 place count 69 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1700 place count 69 transition count 134
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1710 place count 64 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1711 place count 63 transition count 128
Applied a total of 1711 rules in 95 ms. Remains 63 /963 variables (removed 900) and now considering 128/1207 (removed 1079) transitions.
[2025-06-04 15:57:15] [INFO ] Flow matrix only has 122 transitions (discarded 6 similar events)
// Phase 1: matrix 122 rows 63 cols
[2025-06-04 15:57:15] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:57:15] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-04 15:57:15] [INFO ] Flow matrix only has 122 transitions (discarded 6 similar events)
[2025-06-04 15:57:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:57:15] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 15:57:15] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:57:15] [INFO ] Redundant transitions in 3 ms returned []
Running 119 sub problems to find dead transitions.
[2025-06-04 15:57:15] [INFO ] Flow matrix only has 122 transitions (discarded 6 similar events)
[2025-06-04 15:57:15] [INFO ] Invariant cache hit.
[2025-06-04 15:57:15] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 4/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:16] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:17] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:17] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:17] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:17] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:17] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:17] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:17] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:17] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:17] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:17] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:18] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:18] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:18] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 121/184 variables, 63/79 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:20] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 1/185 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 95 constraints, problems are : Problem set: 0 solved, 119 unsolved in 11854 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 4/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 121/184 variables, 63/80 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 14/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 119/213 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 1/185 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 214 constraints, problems are : Problem set: 0 solved, 119 unsolved in 12080 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23960ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 23960ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/963 places, 128/1207 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24481 ms. Remains : 63/963 places, 128/1207 transitions.
[2025-06-04 15:57:39] [INFO ] Flatten gal took : 7 ms
[2025-06-04 15:57:39] [INFO ] Flatten gal took : 8 ms
[2025-06-04 15:57:39] [INFO ] Input system was already deterministic with 128 transitions.
[2025-06-04 15:57:39] [INFO ] Flatten gal took : 8 ms
[2025-06-04 15:57:39] [INFO ] Flatten gal took : 12 ms
[2025-06-04 15:57:39] [INFO ] Time to serialize gal into /tmp/CTLFireability8345134270199458160.gal : 1 ms
[2025-06-04 15:57:39] [INFO ] Time to serialize properties into /tmp/CTLFireability8065088952323592925.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8345134270199458160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8065088952323592925.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58046,0.282883,11988,2,2551,5,26322,6,0,371,28855,0


Converting to forward existential form...Done !
original formula: EG(AG(EF((p312==0))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U (p312==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t6, t7, t8, t15, t16, t17, t20, t25, t27, t28, t29, t52, t53, t54, t55, t64, t65,...330
(forward)formula 0,1,2.56878,59432,1,0,269,243881,274,114,3416,209291,281
FORMULA StigmergyCommit-PT-03b-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 963/963 places, 1207/1207 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 932 transition count 1176
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 932 transition count 1176
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 85 place count 909 transition count 1153
Iterating global reduction 0 with 23 rules applied. Total rules applied 108 place count 909 transition count 1153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 109 place count 909 transition count 1152
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 126 place count 892 transition count 1135
Iterating global reduction 1 with 17 rules applied. Total rules applied 143 place count 892 transition count 1135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 144 place count 892 transition count 1134
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 158 place count 878 transition count 1120
Iterating global reduction 2 with 14 rules applied. Total rules applied 172 place count 878 transition count 1120
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 183 place count 867 transition count 1109
Iterating global reduction 2 with 11 rules applied. Total rules applied 194 place count 867 transition count 1109
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 205 place count 856 transition count 1098
Iterating global reduction 2 with 11 rules applied. Total rules applied 216 place count 856 transition count 1098
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 226 place count 846 transition count 1088
Iterating global reduction 2 with 10 rules applied. Total rules applied 236 place count 846 transition count 1088
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 244 place count 838 transition count 1080
Iterating global reduction 2 with 8 rules applied. Total rules applied 252 place count 838 transition count 1080
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 253 place count 838 transition count 1079
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 258 place count 833 transition count 1074
Iterating global reduction 3 with 5 rules applied. Total rules applied 263 place count 833 transition count 1074
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 268 place count 828 transition count 1069
Iterating global reduction 3 with 5 rules applied. Total rules applied 273 place count 828 transition count 1069
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 278 place count 823 transition count 1064
Iterating global reduction 3 with 5 rules applied. Total rules applied 283 place count 823 transition count 1064
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 288 place count 818 transition count 1059
Iterating global reduction 3 with 5 rules applied. Total rules applied 293 place count 818 transition count 1059
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 297 place count 814 transition count 1055
Iterating global reduction 3 with 4 rules applied. Total rules applied 301 place count 814 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 302 place count 814 transition count 1054
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 305 place count 811 transition count 1051
Iterating global reduction 4 with 3 rules applied. Total rules applied 308 place count 811 transition count 1051
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 311 place count 808 transition count 1048
Iterating global reduction 4 with 3 rules applied. Total rules applied 314 place count 808 transition count 1048
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 317 place count 805 transition count 1045
Iterating global reduction 4 with 3 rules applied. Total rules applied 320 place count 805 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 323 place count 802 transition count 1042
Iterating global reduction 4 with 3 rules applied. Total rules applied 326 place count 802 transition count 1042
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 329 place count 799 transition count 1039
Iterating global reduction 4 with 3 rules applied. Total rules applied 332 place count 799 transition count 1039
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 335 place count 796 transition count 1036
Iterating global reduction 4 with 3 rules applied. Total rules applied 338 place count 796 transition count 1036
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 341 place count 793 transition count 1033
Iterating global reduction 4 with 3 rules applied. Total rules applied 344 place count 793 transition count 1033
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 346 place count 793 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 347 place count 792 transition count 1030
Iterating global reduction 5 with 1 rules applied. Total rules applied 348 place count 792 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 349 place count 791 transition count 1029
Iterating global reduction 5 with 1 rules applied. Total rules applied 350 place count 791 transition count 1029
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 351 place count 791 transition count 1028
Applied a total of 351 rules in 1003 ms. Remains 791 /963 variables (removed 172) and now considering 1028/1207 (removed 179) transitions.
// Phase 1: matrix 1028 rows 791 cols
[2025-06-04 15:57:43] [INFO ] Computed 5 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:57:44] [INFO ] Implicit Places using invariants in 556 ms returned []
[2025-06-04 15:57:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:57:45] [INFO ] Implicit Places using invariants and state equation in 1286 ms returned []
Implicit Place search using SMT with State Equation took 1847 ms to find 0 implicit places.
Running 1027 sub problems to find dead transitions.
[2025-06-04 15:57:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/1819 variables, and 0 constraints, problems are : Problem set: 0 solved, 1027 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/791 constraints, PredecessorRefiner: 1027/1027 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1027 unsolved
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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 790/1819 variables, and 0 constraints, problems are : Problem set: 0 solved, 1027 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/791 constraints, PredecessorRefiner: 0/1027 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60407ms problems are : Problem set: 0 solved, 1027 unsolved
Search for dead transitions found 0 dead transitions in 60410ms
Starting structural reductions in LTL mode, iteration 1 : 791/963 places, 1028/1207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63263 ms. Remains : 791/963 places, 1028/1207 transitions.
[2025-06-04 15:58:45] [INFO ] Flatten gal took : 40 ms
[2025-06-04 15:58:45] [INFO ] Flatten gal took : 41 ms
[2025-06-04 15:58:45] [INFO ] Input system was already deterministic with 1028 transitions.
[2025-06-04 15:58:46] [INFO ] Flatten gal took : 39 ms
[2025-06-04 15:58:46] [INFO ] Flatten gal took : 42 ms
[2025-06-04 15:58:46] [INFO ] Time to serialize gal into /tmp/CTLFireability10968444063605635566.gal : 9 ms
[2025-06-04 15:58:46] [INFO ] Time to serialize properties into /tmp/CTLFireability6903226360280122100.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10968444063605635566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6903226360280122100.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.53325e+09,24.8454,467476,2,27239,5,1.40884e+06,6,0,4194,2.0161e+06,0


Converting to forward existential form...Done !
original formula: (!(A(!(((!(AF((p668==1))) * (p895==1)) * ((p298==1)&&(p131!=1)))) U (p110==1))) + EF(EX(EX((p1188==1)))))
=> equivalent forward existential formula: (([FwdG((((FwdU(Init,!((p110==1))) * !((p110==1))) * ((p298==1)&&(p131!=1))) * (p895==1)),!((p668==1)))] != FALS...247
Hit Full ! (commute/partial/dont) 1026/0/2
Detected timeout of ITS tools.
[2025-06-04 15:59:16] [INFO ] Flatten gal took : 37 ms
[2025-06-04 15:59:16] [INFO ] Applying decomposition
[2025-06-04 15:59:16] [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/graph4703891400433096438.txt' '-o' '/tmp/graph4703891400433096438.bin' '-w' '/tmp/graph4703891400433096438.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4703891400433096438.bin' '-l' '-1' '-v' '-w' '/tmp/graph4703891400433096438.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:59:16] [INFO ] Decomposing Gal with order
[2025-06-04 15:59:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:59:16] [INFO ] Removed a total of 856 redundant transitions.
[2025-06-04 15:59:16] [INFO ] Flatten gal took : 87 ms
[2025-06-04 15:59:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 14 ms.
[2025-06-04 15:59:16] [INFO ] Time to serialize gal into /tmp/CTLFireability2803508329195224275.gal : 16 ms
[2025-06-04 15:59:16] [INFO ] Time to serialize properties into /tmp/CTLFireability7084417821946291130.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2803508329195224275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7084417821946291130.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.53325e+09,6.11347,161796,2136,18,298137,986,1274,772554,49,2849,0


Converting to forward existential form...Done !
original formula: (!(A(!(((!(AF((i21.i1.i0.u187.p668==1))) * (i26.u237.p895==1)) * ((i8.u82.p298==1)&&(i5.u50.p131!=1)))) U (i4.i1.i0.u41.p110==1))) + EF(E...183
=> equivalent forward existential formula: (([FwdG((((FwdU(Init,!((i4.i1.i0.u41.p110==1))) * !((i4.i1.i0.u41.p110==1))) * ((i8.u82.p298==1)&&(i5.u50.p131!=...333
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found a local SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 963/963 places, 1207/1207 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 933 transition count 1177
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 933 transition count 1177
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 83 place count 910 transition count 1154
Iterating global reduction 0 with 23 rules applied. Total rules applied 106 place count 910 transition count 1154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 107 place count 910 transition count 1153
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 123 place count 894 transition count 1137
Iterating global reduction 1 with 16 rules applied. Total rules applied 139 place count 894 transition count 1137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 140 place count 894 transition count 1136
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 153 place count 881 transition count 1123
Iterating global reduction 2 with 13 rules applied. Total rules applied 166 place count 881 transition count 1123
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 176 place count 871 transition count 1113
Iterating global reduction 2 with 10 rules applied. Total rules applied 186 place count 871 transition count 1113
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 196 place count 861 transition count 1103
Iterating global reduction 2 with 10 rules applied. Total rules applied 206 place count 861 transition count 1103
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 215 place count 852 transition count 1094
Iterating global reduction 2 with 9 rules applied. Total rules applied 224 place count 852 transition count 1094
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 232 place count 844 transition count 1086
Iterating global reduction 2 with 8 rules applied. Total rules applied 240 place count 844 transition count 1086
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 844 transition count 1085
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 246 place count 839 transition count 1080
Iterating global reduction 3 with 5 rules applied. Total rules applied 251 place count 839 transition count 1080
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 256 place count 834 transition count 1075
Iterating global reduction 3 with 5 rules applied. Total rules applied 261 place count 834 transition count 1075
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 266 place count 829 transition count 1070
Iterating global reduction 3 with 5 rules applied. Total rules applied 271 place count 829 transition count 1070
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 276 place count 824 transition count 1065
Iterating global reduction 3 with 5 rules applied. Total rules applied 281 place count 824 transition count 1065
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 285 place count 820 transition count 1061
Iterating global reduction 3 with 4 rules applied. Total rules applied 289 place count 820 transition count 1061
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 290 place count 820 transition count 1060
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 293 place count 817 transition count 1057
Iterating global reduction 4 with 3 rules applied. Total rules applied 296 place count 817 transition count 1057
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 299 place count 814 transition count 1054
Iterating global reduction 4 with 3 rules applied. Total rules applied 302 place count 814 transition count 1054
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 305 place count 811 transition count 1051
Iterating global reduction 4 with 3 rules applied. Total rules applied 308 place count 811 transition count 1051
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 310 place count 809 transition count 1049
Iterating global reduction 4 with 2 rules applied. Total rules applied 312 place count 809 transition count 1049
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 314 place count 807 transition count 1047
Iterating global reduction 4 with 2 rules applied. Total rules applied 316 place count 807 transition count 1047
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 318 place count 805 transition count 1045
Iterating global reduction 4 with 2 rules applied. Total rules applied 320 place count 805 transition count 1045
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 322 place count 803 transition count 1043
Iterating global reduction 4 with 2 rules applied. Total rules applied 324 place count 803 transition count 1043
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 325 place count 803 transition count 1042
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 326 place count 802 transition count 1041
Iterating global reduction 5 with 1 rules applied. Total rules applied 327 place count 802 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 328 place count 801 transition count 1040
Iterating global reduction 5 with 1 rules applied. Total rules applied 329 place count 801 transition count 1040
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 330 place count 801 transition count 1039
Applied a total of 330 rules in 621 ms. Remains 801 /963 variables (removed 162) and now considering 1039/1207 (removed 168) transitions.
// Phase 1: matrix 1039 rows 801 cols
[2025-06-04 15:59:47] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:59:47] [INFO ] Implicit Places using invariants in 470 ms returned []
[2025-06-04 15:59:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:59:48] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1400 ms to find 0 implicit places.
Running 1038 sub problems to find dead transitions.
[2025-06-04 15:59:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 800/1840 variables, and 0 constraints, problems are : Problem set: 0 solved, 1038 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/801 constraints, PredecessorRefiner: 1038/1038 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1038 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 800/1840 variables, and 0 constraints, problems are : Problem set: 0 solved, 1038 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/801 constraints, PredecessorRefiner: 0/1038 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60410ms problems are : Problem set: 0 solved, 1038 unsolved
Search for dead transitions found 0 dead transitions in 60415ms
Starting structural reductions in LTL mode, iteration 1 : 801/963 places, 1039/1207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62439 ms. Remains : 801/963 places, 1039/1207 transitions.
[2025-06-04 16:00:49] [INFO ] Flatten gal took : 21 ms
[2025-06-04 16:00:49] [INFO ] Flatten gal took : 22 ms
[2025-06-04 16:00:49] [INFO ] Input system was already deterministic with 1039 transitions.
[2025-06-04 16:00:49] [INFO ] Flatten gal took : 21 ms
[2025-06-04 16:00:49] [INFO ] Flatten gal took : 22 ms
[2025-06-04 16:00:49] [INFO ] Time to serialize gal into /tmp/CTLFireability7021922127862230794.gal : 6 ms
[2025-06-04 16:00:49] [INFO ] Time to serialize properties into /tmp/CTLFireability7769084121135225685.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7021922127862230794.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7769084121135225685.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.86336e+09,28.1522,476480,2,30011,5,1.52411e+06,6,0,4245,2.06683e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 16:01:19] [INFO ] Flatten gal took : 21 ms
[2025-06-04 16:01:19] [INFO ] Applying decomposition
[2025-06-04 16:01:19] [INFO ] Flatten gal took : 29 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/graph14806528892611462130.txt' '-o' '/tmp/graph14806528892611462130.bin' '-w' '/tmp/graph14806528892611462130.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14806528892611462130.bin' '-l' '-1' '-v' '-w' '/tmp/graph14806528892611462130.weights' '-q' '0' '-e' '0.001'
[2025-06-04 16:01:19] [INFO ] Decomposing Gal with order
[2025-06-04 16:01:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 16:01:19] [INFO ] Removed a total of 858 redundant transitions.
[2025-06-04 16:01:19] [INFO ] Flatten gal took : 76 ms
[2025-06-04 16:01:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 15 ms.
[2025-06-04 16:01:19] [INFO ] Time to serialize gal into /tmp/CTLFireability8241264220551570632.gal : 14 ms
[2025-06-04 16:01:19] [INFO ] Time to serialize properties into /tmp/CTLFireability4279142665339126321.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8241264220551570632.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4279142665339126321.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.86336e+09,10.9326,256632,2350,15,483522,892,1324,1.18079e+06,47,2769,0


Converting to forward existential form...Done !
original formula: EG((((E(((i27.i1.i0.u295.p1068==1) * A((((i8.u3.p139==1)&&(i8.u110.p396==1))&&((i8.u190.p698==1)&&(i8.u242.p1022==1))) U (i13.i0.i0.u121....544
=> equivalent forward existential formula: [FwdG(Init,(((E(((i27.i1.i0.u295.p1068==1) * !((E(!((i13.i0.i0.u121.p421==1)) U (!((((i8.u3.p139==1)&&(i8.u110.p...806
Reverse transition relation is NOT exact ! Due to transitions t76, t109, t221, t255, t287, t343, t433, t515, t516, t572, t605, t687, t688, t744, t764, t765...608
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 963/963 places, 1207/1207 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 934 transition count 1178
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 934 transition count 1178
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 81 place count 911 transition count 1155
Iterating global reduction 0 with 23 rules applied. Total rules applied 104 place count 911 transition count 1155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 105 place count 911 transition count 1154
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 121 place count 895 transition count 1138
Iterating global reduction 1 with 16 rules applied. Total rules applied 137 place count 895 transition count 1138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 138 place count 895 transition count 1137
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 151 place count 882 transition count 1124
Iterating global reduction 2 with 13 rules applied. Total rules applied 164 place count 882 transition count 1124
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 174 place count 872 transition count 1114
Iterating global reduction 2 with 10 rules applied. Total rules applied 184 place count 872 transition count 1114
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 194 place count 862 transition count 1104
Iterating global reduction 2 with 10 rules applied. Total rules applied 204 place count 862 transition count 1104
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 214 place count 852 transition count 1094
Iterating global reduction 2 with 10 rules applied. Total rules applied 224 place count 852 transition count 1094
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 232 place count 844 transition count 1086
Iterating global reduction 2 with 8 rules applied. Total rules applied 240 place count 844 transition count 1086
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 844 transition count 1085
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 246 place count 839 transition count 1080
Iterating global reduction 3 with 5 rules applied. Total rules applied 251 place count 839 transition count 1080
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 256 place count 834 transition count 1075
Iterating global reduction 3 with 5 rules applied. Total rules applied 261 place count 834 transition count 1075
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 266 place count 829 transition count 1070
Iterating global reduction 3 with 5 rules applied. Total rules applied 271 place count 829 transition count 1070
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 276 place count 824 transition count 1065
Iterating global reduction 3 with 5 rules applied. Total rules applied 281 place count 824 transition count 1065
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 285 place count 820 transition count 1061
Iterating global reduction 3 with 4 rules applied. Total rules applied 289 place count 820 transition count 1061
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 290 place count 820 transition count 1060
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 293 place count 817 transition count 1057
Iterating global reduction 4 with 3 rules applied. Total rules applied 296 place count 817 transition count 1057
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 299 place count 814 transition count 1054
Iterating global reduction 4 with 3 rules applied. Total rules applied 302 place count 814 transition count 1054
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 305 place count 811 transition count 1051
Iterating global reduction 4 with 3 rules applied. Total rules applied 308 place count 811 transition count 1051
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 311 place count 808 transition count 1048
Iterating global reduction 4 with 3 rules applied. Total rules applied 314 place count 808 transition count 1048
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 317 place count 805 transition count 1045
Iterating global reduction 4 with 3 rules applied. Total rules applied 320 place count 805 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 323 place count 802 transition count 1042
Iterating global reduction 4 with 3 rules applied. Total rules applied 326 place count 802 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 328 place count 800 transition count 1040
Iterating global reduction 4 with 2 rules applied. Total rules applied 330 place count 800 transition count 1040
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 331 place count 800 transition count 1039
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 332 place count 799 transition count 1038
Iterating global reduction 5 with 1 rules applied. Total rules applied 333 place count 799 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 334 place count 798 transition count 1037
Iterating global reduction 5 with 1 rules applied. Total rules applied 335 place count 798 transition count 1037
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 336 place count 798 transition count 1036
Applied a total of 336 rules in 687 ms. Remains 798 /963 variables (removed 165) and now considering 1036/1207 (removed 171) transitions.
// Phase 1: matrix 1036 rows 798 cols
[2025-06-04 16:01:50] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:01:50] [INFO ] Implicit Places using invariants in 503 ms returned []
[2025-06-04 16:01:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:01:52] [INFO ] Implicit Places using invariants and state equation in 1568 ms returned []
Implicit Place search using SMT with State Equation took 2113 ms to find 0 implicit places.
Running 1035 sub problems to find dead transitions.
[2025-06-04 16:01:52] [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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 797/1834 variables, and 0 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/798 constraints, PredecessorRefiner: 1035/1035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1035 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 797/1834 variables, and 0 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/798 constraints, PredecessorRefiner: 0/1035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60438ms problems are : Problem set: 0 solved, 1035 unsolved
Search for dead transitions found 0 dead transitions in 60440ms
Starting structural reductions in LTL mode, iteration 1 : 798/963 places, 1036/1207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63245 ms. Remains : 798/963 places, 1036/1207 transitions.
[2025-06-04 16:02:52] [INFO ] Flatten gal took : 36 ms
[2025-06-04 16:02:53] [INFO ] Flatten gal took : 37 ms
[2025-06-04 16:02:53] [INFO ] Input system was already deterministic with 1036 transitions.
[2025-06-04 16:02:53] [INFO ] Flatten gal took : 36 ms
[2025-06-04 16:02:53] [INFO ] Flatten gal took : 36 ms
[2025-06-04 16:02:53] [INFO ] Time to serialize gal into /tmp/CTLFireability9429360508129544828.gal : 8 ms
[2025-06-04 16:02:53] [INFO ] Time to serialize properties into /tmp/CTLFireability18270470250241750540.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9429360508129544828.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18270470250241750540.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.65593e+09,27.1661,461552,2,29426,5,1.46098e+06,6,0,4230,1.98383e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 16:03:23] [INFO ] Flatten gal took : 23 ms
[2025-06-04 16:03:23] [INFO ] Applying decomposition
[2025-06-04 16:03:23] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13766986254624117627.txt' '-o' '/tmp/graph13766986254624117627.bin' '-w' '/tmp/graph13766986254624117627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13766986254624117627.bin' '-l' '-1' '-v' '-w' '/tmp/graph13766986254624117627.weights' '-q' '0' '-e' '0.001'
[2025-06-04 16:03:23] [INFO ] Decomposing Gal with order
[2025-06-04 16:03:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 16:03:23] [INFO ] Removed a total of 861 redundant transitions.
[2025-06-04 16:03:23] [INFO ] Flatten gal took : 53 ms
[2025-06-04 16:03:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-04 16:03:23] [INFO ] Time to serialize gal into /tmp/CTLFireability17948257239148890493.gal : 9 ms
[2025-06-04 16:03:23] [INFO ] Time to serialize properties into /tmp/CTLFireability15282114980342270155.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17948257239148890493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15282114980342270155.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.65593e+09,6.08029,154896,2166,13,281367,930,1286,759525,50,2742,0


Converting to forward existential form...Done !
original formula: EX((EG(AF((i14.i1.i1.u154.p579==1))) + (!(E(((i23.u228.p811==1)||(i32.u303.p1156==1)) U ((i20.u187.p666==1)&&(i15.u137.p460==1)))) * AF(E...176
=> equivalent forward existential formula: ([FwdG(EY(Init),!(EG(!((i14.i1.i1.u154.p579==1)))))] != FALSE + [((EY(Init) * !(E(((i23.u228.p811==1)||(i32.u303...255
Reverse transition relation is NOT exact ! Due to transitions t76, t159, t215, t249, t334, t390, t429, t456, t512, t568, t601, t684, t737, t740, t760, t761...579
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found a local SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 963/963 places, 1207/1207 transitions.
Graph (trivial) has 933 edges and 963 vertex of which 67 / 963 are part of one of the 11 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 664 transitions
Trivial Post-agglo rules discarded 664 transitions
Performed 664 trivial Post agglomeration. Transition count delta: 664
Iterating post reduction 0 with 664 rules applied. Total rules applied 665 place count 906 transition count 479
Reduce places removed 664 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 675 rules applied. Total rules applied 1340 place count 242 transition count 468
Reduce places removed 5 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 14 rules applied. Total rules applied 1354 place count 237 transition count 459
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1363 place count 228 transition count 459
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1363 place count 228 transition count 411
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1459 place count 180 transition count 411
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1476 place count 163 transition count 394
Iterating global reduction 4 with 17 rules applied. Total rules applied 1493 place count 163 transition count 394
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1493 place count 163 transition count 393
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1495 place count 162 transition count 393
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1499 place count 158 transition count 389
Iterating global reduction 4 with 4 rules applied. Total rules applied 1503 place count 158 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1504 place count 158 transition count 388
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1505 place count 157 transition count 387
Iterating global reduction 5 with 1 rules applied. Total rules applied 1506 place count 157 transition count 387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1507 place count 157 transition count 386
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 1557 place count 132 transition count 361
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1562 place count 132 transition count 356
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 1584 place count 110 transition count 244
Iterating global reduction 7 with 22 rules applied. Total rules applied 1606 place count 110 transition count 244
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1614 place count 110 transition count 236
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1628 place count 96 transition count 219
Iterating global reduction 8 with 14 rules applied. Total rules applied 1642 place count 96 transition count 219
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1656 place count 82 transition count 202
Iterating global reduction 8 with 14 rules applied. Total rules applied 1670 place count 82 transition count 202
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1677 place count 82 transition count 195
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 9 with 2 rules applied. Total rules applied 1679 place count 81 transition count 194
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1680 place count 80 transition count 189
Iterating global reduction 9 with 1 rules applied. Total rules applied 1681 place count 80 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1682 place count 80 transition count 188
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1685 place count 80 transition count 185
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 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 1691 place count 77 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1692 place count 76 transition count 181
Applied a total of 1692 rules in 58 ms. Remains 76 /963 variables (removed 887) and now considering 181/1207 (removed 1026) transitions.
[2025-06-04 16:03:53] [INFO ] Flow matrix only has 177 transitions (discarded 4 similar events)
// Phase 1: matrix 177 rows 76 cols
[2025-06-04 16:03:53] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:03:53] [INFO ] Implicit Places using invariants in 309 ms returned []
[2025-06-04 16:03:53] [INFO ] Flow matrix only has 177 transitions (discarded 4 similar events)
[2025-06-04 16:03:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:03:54] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 16:03:54] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 16:03:54] [INFO ] Redundant transitions in 7 ms returned []
Running 172 sub problems to find dead transitions.
[2025-06-04 16:03:54] [INFO ] Flow matrix only has 177 transitions (discarded 4 similar events)
[2025-06-04 16:03:54] [INFO ] Invariant cache hit.
[2025-06-04 16:03:54] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:03:56] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:03:56] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:03:56] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:03:56] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:03:56] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:03:56] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:03:57] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:03:57] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:03:57] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:03:57] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 176/252 variables, 76/88 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 1/253 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:04:12] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 13 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/253 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/253 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (OVERLAPS) 0/253 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 104 constraints, problems are : Problem set: 0 solved, 172 unsolved in 29341 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:04:24] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:04:24] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:04:25] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:04:25] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 176/252 variables, 76/93 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 172/279 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (OVERLAPS) 1/253 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/253 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (OVERLAPS) 0/253 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 280 constraints, problems are : Problem set: 0 solved, 172 unsolved in 28693 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58093ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 58093ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/963 places, 181/1207 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58692 ms. Remains : 76/963 places, 181/1207 transitions.
[2025-06-04 16:04:52] [INFO ] Flatten gal took : 9 ms
[2025-06-04 16:04:52] [INFO ] Flatten gal took : 8 ms
[2025-06-04 16:04:52] [INFO ] Input system was already deterministic with 181 transitions.
[2025-06-04 16:04:52] [INFO ] Flatten gal took : 6 ms
[2025-06-04 16:04:52] [INFO ] Flatten gal took : 6 ms
[2025-06-04 16:04:52] [INFO ] Time to serialize gal into /tmp/CTLFireability9362768827968717618.gal : 1 ms
[2025-06-04 16:04:52] [INFO ] Time to serialize properties into /tmp/CTLFireability11363912903991388537.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9362768827968717618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11363912903991388537.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,124680,0.462937,13956,2,3211,5,29270,6,0,477,29393,0


Converting to forward existential form...Done !
original formula: (EF((p556==1)) + EG((AF((AG((((p27==0)||(p374==0))||((p676==0)||(p955==0)))) * (p320==0))) * (EG((p380==0)) + AG(EF((p215==0)))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p556==1))] != FALSE + [FwdG(Init,(!(EG(!((!(E(TRUE U !((((p27==0)||(p374==0))||((p676==0)|...255
(forward)formula 0,1,0.465868,14084,1,0,7,29270,8,1,480,29393,1
FORMULA StigmergyCommit-PT-03b-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 963/963 places, 1207/1207 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 935 transition count 1179
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 935 transition count 1179
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 77 place count 914 transition count 1158
Iterating global reduction 0 with 21 rules applied. Total rules applied 98 place count 914 transition count 1158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 99 place count 914 transition count 1157
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 114 place count 899 transition count 1142
Iterating global reduction 1 with 15 rules applied. Total rules applied 129 place count 899 transition count 1142
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 142 place count 886 transition count 1129
Iterating global reduction 1 with 13 rules applied. Total rules applied 155 place count 886 transition count 1129
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 165 place count 876 transition count 1119
Iterating global reduction 1 with 10 rules applied. Total rules applied 175 place count 876 transition count 1119
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 185 place count 866 transition count 1109
Iterating global reduction 1 with 10 rules applied. Total rules applied 195 place count 866 transition count 1109
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 204 place count 857 transition count 1100
Iterating global reduction 1 with 9 rules applied. Total rules applied 213 place count 857 transition count 1100
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 220 place count 850 transition count 1093
Iterating global reduction 1 with 7 rules applied. Total rules applied 227 place count 850 transition count 1093
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 228 place count 850 transition count 1092
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 232 place count 846 transition count 1088
Iterating global reduction 2 with 4 rules applied. Total rules applied 236 place count 846 transition count 1088
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 240 place count 842 transition count 1084
Iterating global reduction 2 with 4 rules applied. Total rules applied 244 place count 842 transition count 1084
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 248 place count 838 transition count 1080
Iterating global reduction 2 with 4 rules applied. Total rules applied 252 place count 838 transition count 1080
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 256 place count 834 transition count 1076
Iterating global reduction 2 with 4 rules applied. Total rules applied 260 place count 834 transition count 1076
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 264 place count 830 transition count 1072
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 830 transition count 1072
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 269 place count 830 transition count 1071
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 272 place count 827 transition count 1068
Iterating global reduction 3 with 3 rules applied. Total rules applied 275 place count 827 transition count 1068
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 278 place count 824 transition count 1065
Iterating global reduction 3 with 3 rules applied. Total rules applied 281 place count 824 transition count 1065
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 284 place count 821 transition count 1062
Iterating global reduction 3 with 3 rules applied. Total rules applied 287 place count 821 transition count 1062
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 290 place count 818 transition count 1059
Iterating global reduction 3 with 3 rules applied. Total rules applied 293 place count 818 transition count 1059
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 296 place count 815 transition count 1056
Iterating global reduction 3 with 3 rules applied. Total rules applied 299 place count 815 transition count 1056
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 302 place count 812 transition count 1053
Iterating global reduction 3 with 3 rules applied. Total rules applied 305 place count 812 transition count 1053
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 308 place count 809 transition count 1050
Iterating global reduction 3 with 3 rules applied. Total rules applied 311 place count 809 transition count 1050
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 313 place count 809 transition count 1048
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 314 place count 808 transition count 1047
Iterating global reduction 4 with 1 rules applied. Total rules applied 315 place count 808 transition count 1047
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 316 place count 807 transition count 1046
Iterating global reduction 4 with 1 rules applied. Total rules applied 317 place count 807 transition count 1046
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 318 place count 807 transition count 1045
Applied a total of 318 rules in 901 ms. Remains 807 /963 variables (removed 156) and now considering 1045/1207 (removed 162) transitions.
// Phase 1: matrix 1045 rows 807 cols
[2025-06-04 16:04:53] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:04:54] [INFO ] Implicit Places using invariants in 569 ms returned []
[2025-06-04 16:04:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:04:55] [INFO ] Implicit Places using invariants and state equation in 1409 ms returned []
Implicit Place search using SMT with State Equation took 1992 ms to find 0 implicit places.
Running 1044 sub problems to find dead transitions.
[2025-06-04 16:04:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/1852 variables, and 0 constraints, problems are : Problem set: 0 solved, 1044 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/807 constraints, PredecessorRefiner: 1044/1044 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1044 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 806/1852 variables, and 0 constraints, problems are : Problem set: 0 solved, 1044 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/807 constraints, PredecessorRefiner: 0/1044 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60330ms problems are : Problem set: 0 solved, 1044 unsolved
Search for dead transitions found 0 dead transitions in 60332ms
Starting structural reductions in LTL mode, iteration 1 : 807/963 places, 1045/1207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63230 ms. Remains : 807/963 places, 1045/1207 transitions.
[2025-06-04 16:05:56] [INFO ] Flatten gal took : 34 ms
[2025-06-04 16:05:56] [INFO ] Flatten gal took : 36 ms
[2025-06-04 16:05:56] [INFO ] Input system was already deterministic with 1045 transitions.
[2025-06-04 16:05:56] [INFO ] Flatten gal took : 35 ms
[2025-06-04 16:05:56] [INFO ] Flatten gal took : 36 ms
[2025-06-04 16:05:56] [INFO ] Time to serialize gal into /tmp/CTLFireability907402322552209898.gal : 8 ms
[2025-06-04 16:05:56] [INFO ] Time to serialize properties into /tmp/CTLFireability10540765366578271915.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability907402322552209898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10540765366578271915.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0002e+10,23.761,466104,2,26055,5,1.38936e+06,6,0,4275,2.0386e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 16:06:26] [INFO ] Flatten gal took : 21 ms
[2025-06-04 16:06:26] [INFO ] Applying decomposition
[2025-06-04 16:06:26] [INFO ] Flatten gal took : 24 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/graph9524582369268655113.txt' '-o' '/tmp/graph9524582369268655113.bin' '-w' '/tmp/graph9524582369268655113.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9524582369268655113.bin' '-l' '-1' '-v' '-w' '/tmp/graph9524582369268655113.weights' '-q' '0' '-e' '0.001'
[2025-06-04 16:06:26] [INFO ] Decomposing Gal with order
[2025-06-04 16:06:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 16:06:26] [INFO ] Removed a total of 860 redundant transitions.
[2025-06-04 16:06:26] [INFO ] Flatten gal took : 80 ms
[2025-06-04 16:06:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2025-06-04 16:06:26] [INFO ] Time to serialize gal into /tmp/CTLFireability13915254763766415854.gal : 12 ms
[2025-06-04 16:06:26] [INFO ] Time to serialize properties into /tmp/CTLFireability16789446690828833774.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13915254763766415854.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16789446690828833774.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0002e+10,9.70618,256364,2525,18,504311,893,1278,1.10068e+06,48,2962,0


Converting to forward existential form...Done !
original formula: E(((!(EX(E((i6.u66.p248==1) U (i3.u36.p98==1)))) * EF((i5.i0.i1.u9.p24==1))) * ((i17.u143.p474!=1)||((i11.u85.p309==1)&&((i14.u121.p407==...269
=> equivalent forward existential formula: [(FwdU(Init,((!(EX(E((i6.u66.p248==1) U (i3.u36.p98==1)))) * E(TRUE U (i5.i0.i1.u9.p24==1))) * ((i17.u143.p474!=...321
Reverse transition relation is NOT exact ! Due to transitions t77, t104, t216, t250, t332, t333, t389, t423, t445, t514, t515, t572, t573, t606, t748, t768...606
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 963/963 places, 1207/1207 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 933 transition count 1177
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 933 transition count 1177
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 84 place count 909 transition count 1153
Iterating global reduction 0 with 24 rules applied. Total rules applied 108 place count 909 transition count 1153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 109 place count 909 transition count 1152
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 126 place count 892 transition count 1135
Iterating global reduction 1 with 17 rules applied. Total rules applied 143 place count 892 transition count 1135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 144 place count 892 transition count 1134
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 158 place count 878 transition count 1120
Iterating global reduction 2 with 14 rules applied. Total rules applied 172 place count 878 transition count 1120
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 183 place count 867 transition count 1109
Iterating global reduction 2 with 11 rules applied. Total rules applied 194 place count 867 transition count 1109
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 205 place count 856 transition count 1098
Iterating global reduction 2 with 11 rules applied. Total rules applied 216 place count 856 transition count 1098
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 226 place count 846 transition count 1088
Iterating global reduction 2 with 10 rules applied. Total rules applied 236 place count 846 transition count 1088
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 244 place count 838 transition count 1080
Iterating global reduction 2 with 8 rules applied. Total rules applied 252 place count 838 transition count 1080
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 253 place count 838 transition count 1079
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 258 place count 833 transition count 1074
Iterating global reduction 3 with 5 rules applied. Total rules applied 263 place count 833 transition count 1074
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 268 place count 828 transition count 1069
Iterating global reduction 3 with 5 rules applied. Total rules applied 273 place count 828 transition count 1069
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 278 place count 823 transition count 1064
Iterating global reduction 3 with 5 rules applied. Total rules applied 283 place count 823 transition count 1064
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 288 place count 818 transition count 1059
Iterating global reduction 3 with 5 rules applied. Total rules applied 293 place count 818 transition count 1059
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 296 place count 815 transition count 1056
Iterating global reduction 3 with 3 rules applied. Total rules applied 299 place count 815 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 300 place count 815 transition count 1055
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 302 place count 813 transition count 1053
Iterating global reduction 4 with 2 rules applied. Total rules applied 304 place count 813 transition count 1053
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 306 place count 811 transition count 1051
Iterating global reduction 4 with 2 rules applied. Total rules applied 308 place count 811 transition count 1051
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 310 place count 809 transition count 1049
Iterating global reduction 4 with 2 rules applied. Total rules applied 312 place count 809 transition count 1049
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 314 place count 807 transition count 1047
Iterating global reduction 4 with 2 rules applied. Total rules applied 316 place count 807 transition count 1047
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 318 place count 805 transition count 1045
Iterating global reduction 4 with 2 rules applied. Total rules applied 320 place count 805 transition count 1045
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 322 place count 803 transition count 1043
Iterating global reduction 4 with 2 rules applied. Total rules applied 324 place count 803 transition count 1043
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 326 place count 801 transition count 1041
Iterating global reduction 4 with 2 rules applied. Total rules applied 328 place count 801 transition count 1041
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 329 place count 801 transition count 1040
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 330 place count 800 transition count 1039
Iterating global reduction 5 with 1 rules applied. Total rules applied 331 place count 800 transition count 1039
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 332 place count 799 transition count 1038
Iterating global reduction 5 with 1 rules applied. Total rules applied 333 place count 799 transition count 1038
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 334 place count 799 transition count 1037
Applied a total of 334 rules in 821 ms. Remains 799 /963 variables (removed 164) and now considering 1037/1207 (removed 170) transitions.
// Phase 1: matrix 1037 rows 799 cols
[2025-06-04 16:06:57] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:06:57] [INFO ] Implicit Places using invariants in 471 ms returned []
[2025-06-04 16:06:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:06:59] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned []
Implicit Place search using SMT with State Equation took 1579 ms to find 0 implicit places.
Running 1036 sub problems to find dead transitions.
[2025-06-04 16:06:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 798/1836 variables, and 0 constraints, problems are : Problem set: 0 solved, 1036 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/799 constraints, PredecessorRefiner: 1036/1036 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1036 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s693 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 798/1836 variables, and 0 constraints, problems are : Problem set: 0 solved, 1036 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/799 constraints, PredecessorRefiner: 0/1036 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60458ms problems are : Problem set: 0 solved, 1036 unsolved
Search for dead transitions found 0 dead transitions in 60460ms
Starting structural reductions in LTL mode, iteration 1 : 799/963 places, 1037/1207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62865 ms. Remains : 799/963 places, 1037/1207 transitions.
[2025-06-04 16:07:59] [INFO ] Flatten gal took : 21 ms
[2025-06-04 16:07:59] [INFO ] Flatten gal took : 21 ms
[2025-06-04 16:07:59] [INFO ] Input system was already deterministic with 1037 transitions.
[2025-06-04 16:07:59] [INFO ] Flatten gal took : 21 ms
[2025-06-04 16:07:59] [INFO ] Flatten gal took : 21 ms
[2025-06-04 16:07:59] [INFO ] Time to serialize gal into /tmp/CTLFireability11272126228740859663.gal : 4 ms
[2025-06-04 16:07:59] [INFO ] Time to serialize properties into /tmp/CTLFireability70817708937883175.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11272126228740859663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability70817708937883175.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.80455e+09,24.8992,456444,2,25298,5,1.38404e+06,6,0,4235,2.00173e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 16:08:29] [INFO ] Flatten gal took : 22 ms
[2025-06-04 16:08:29] [INFO ] Applying decomposition
[2025-06-04 16:08:29] [INFO ] Flatten gal took : 24 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/graph14814047380069255622.txt' '-o' '/tmp/graph14814047380069255622.bin' '-w' '/tmp/graph14814047380069255622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14814047380069255622.bin' '-l' '-1' '-v' '-w' '/tmp/graph14814047380069255622.weights' '-q' '0' '-e' '0.001'
[2025-06-04 16:08:29] [INFO ] Decomposing Gal with order
[2025-06-04 16:08:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 16:08:29] [INFO ] Removed a total of 858 redundant transitions.
[2025-06-04 16:08:29] [INFO ] Flatten gal took : 48 ms
[2025-06-04 16:08:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2025-06-04 16:08:29] [INFO ] Time to serialize gal into /tmp/CTLFireability18432468828665520266.gal : 8 ms
[2025-06-04 16:08:29] [INFO ] Time to serialize properties into /tmp/CTLFireability10758662941335044633.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18432468828665520266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10758662941335044633.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.80455e+09,7.47052,172440,2310,19,307656,1160,1288,863317,58,3947,0


Converting to forward existential form...Done !
original formula: (EX(AF(AG(((i2.u9.p26==0)||(i8.i1.i2.u330.p1214==0))))) + AX((((AF((i33.u248.p928==0)) * (i23.i0.i1.u204.p725==1)) * (i8.i1.i2.u222.p804=...182
=> equivalent forward existential formula: (([FwdG((EY((Init * !(EX(!(EG(!(!(E(TRUE U !(((i2.u9.p26==0)||(i8.i1.i2.u330.p1214==0)))))))))))) * !((i2.u163.p...513
Reverse transition relation is NOT exact ! Due to transitions t77, t160, t216, t250, t284, t396, t430, t513, t602, t685, t741, t761, t762, t765, t768, t771...593
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 963/963 places, 1207/1207 transitions.
Graph (trivial) has 923 edges and 963 vertex of which 70 / 963 are part of one of the 12 SCC in 0 ms
Free SCC test removed 58 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 653 transitions
Trivial Post-agglo rules discarded 653 transitions
Performed 653 trivial Post agglomeration. Transition count delta: 653
Iterating post reduction 0 with 653 rules applied. Total rules applied 654 place count 904 transition count 489
Reduce places removed 653 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 662 rules applied. Total rules applied 1316 place count 251 transition count 480
Reduce places removed 4 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 2 with 21 rules applied. Total rules applied 1337 place count 247 transition count 463
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 1355 place count 230 transition count 462
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1355 place count 230 transition count 417
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1445 place count 185 transition count 417
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1461 place count 169 transition count 400
Iterating global reduction 4 with 16 rules applied. Total rules applied 1477 place count 169 transition count 400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1477 place count 169 transition count 399
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1479 place count 168 transition count 399
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1484 place count 163 transition count 393
Iterating global reduction 4 with 5 rules applied. Total rules applied 1489 place count 163 transition count 393
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1490 place count 163 transition count 392
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1492 place count 161 transition count 389
Iterating global reduction 5 with 2 rules applied. Total rules applied 1494 place count 161 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1495 place count 161 transition count 388
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 1547 place count 135 transition count 362
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1552 place count 135 transition count 357
Discarding 23 places :
Symmetric choice reduction at 7 with 23 rule applications. Total rules 1575 place count 112 transition count 211
Iterating global reduction 7 with 23 rules applied. Total rules applied 1598 place count 112 transition count 211
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1608 place count 112 transition count 201
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1620 place count 100 transition count 188
Iterating global reduction 8 with 12 rules applied. Total rules applied 1632 place count 100 transition count 188
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1644 place count 88 transition count 175
Iterating global reduction 8 with 12 rules applied. Total rules applied 1656 place count 88 transition count 175
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1661 place count 88 transition count 170
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 9 with 2 rules applied. Total rules applied 1663 place count 87 transition count 169
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1664 place count 86 transition count 163
Iterating global reduction 9 with 1 rules applied. Total rules applied 1665 place count 86 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1666 place count 86 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 1672 place count 86 transition count 156
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 1684 place count 80 transition count 150
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1686 place count 80 transition count 150
Applied a total of 1686 rules in 65 ms. Remains 80 /963 variables (removed 883) and now considering 150/1207 (removed 1057) transitions.
[2025-06-04 16:09:00] [INFO ] Flow matrix only has 144 transitions (discarded 6 similar events)
// Phase 1: matrix 144 rows 80 cols
[2025-06-04 16:09:00] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:09:00] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-04 16:09:00] [INFO ] Flow matrix only has 144 transitions (discarded 6 similar events)
[2025-06-04 16:09:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:09:00] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 16:09:00] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 16:09:00] [INFO ] Redundant transitions in 1 ms returned []
Running 146 sub problems to find dead transitions.
[2025-06-04 16:09:00] [INFO ] Flow matrix only has 144 transitions (discarded 6 similar events)
[2025-06-04 16:09:00] [INFO ] Invariant cache hit.
[2025-06-04 16:09:00] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:01] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:01] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:02] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:02] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:02] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:02] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:02] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:02] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:02] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:02] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:02] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:02] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:03] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:03] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:03] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:03] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:03] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:03] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 143/223 variables, 80/100 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 14/114 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:06] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:07] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 1/224 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:12] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:18] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 10 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/224 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 15 (OVERLAPS) 0/224 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 119 constraints, problems are : Problem set: 0 solved, 146 unsolved in 29160 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:30] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:30] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:31] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:31] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 143/223 variables, 80/108 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 14/122 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 146/268 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 1/224 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:47] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:09:48] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 224/224 variables, and 271 constraints, problems are : Problem set: 0 solved, 146 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59203ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 59204ms
Starting structural reductions in SI_CTL mode, iteration 1 : 80/963 places, 150/1207 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59636 ms. Remains : 80/963 places, 150/1207 transitions.
[2025-06-04 16:09:59] [INFO ] Flatten gal took : 7 ms
[2025-06-04 16:09:59] [INFO ] Flatten gal took : 7 ms
[2025-06-04 16:09:59] [INFO ] Input system was already deterministic with 150 transitions.
[2025-06-04 16:09:59] [INFO ] Flatten gal took : 8 ms
[2025-06-04 16:09:59] [INFO ] Flatten gal took : 7 ms
[2025-06-04 16:09:59] [INFO ] Time to serialize gal into /tmp/CTLFireability1776951926132765693.gal : 1 ms
[2025-06-04 16:09:59] [INFO ] Time to serialize properties into /tmp/CTLFireability6101049330294253318.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1776951926132765693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6101049330294253318.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,121998,0.500798,16992,2,3547,5,44132,6,0,463,43171,0


Converting to forward existential form...Done !
original formula: AG(!(A((((E((p873==1) U (p120==1)) + (p254!=1)) + (((p607==1)&&(p618==1))||(p84==1))) + (p298==1)) U ((!((p950==1)||(p250==1)))&&(p135==1...160
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(((!((p950==1)||(p250==1)))&&(p135==1)))))) * !(E(!(((!((p950==1)||(p250==1)))&&(p135...316
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t8, t9, t10, t13, t19, t22, t23, t24, t29, t32, t41, t65, t66, t67, t71, t73, t83...337
Detected timeout of ITS tools.
[2025-06-04 16:10:29] [INFO ] Flatten gal took : 8 ms
[2025-06-04 16:10:29] [INFO ] Applying decomposition
[2025-06-04 16:10:29] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6404313746921193877.txt' '-o' '/tmp/graph6404313746921193877.bin' '-w' '/tmp/graph6404313746921193877.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6404313746921193877.bin' '-l' '-1' '-v' '-w' '/tmp/graph6404313746921193877.weights' '-q' '0' '-e' '0.001'
[2025-06-04 16:10:29] [INFO ] Decomposing Gal with order
[2025-06-04 16:10:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 16:10:29] [INFO ] Removed a total of 223 redundant transitions.
[2025-06-04 16:10:29] [INFO ] Flatten gal took : 13 ms
[2025-06-04 16:10:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 3 ms.
[2025-06-04 16:10:29] [INFO ] Time to serialize gal into /tmp/CTLFireability7760120351394055409.gal : 2 ms
[2025-06-04 16:10:29] [INFO ] Time to serialize properties into /tmp/CTLFireability14976065242891956836.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7760120351394055409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14976065242891956836.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,121998,0.054032,5400,203,101,2248,1005,330,3756,103,2590,0


Converting to forward existential form...Done !
original formula: AG(!(A((((E((i5.u13.p873==1) U (i1.u1.p120==1)) + (i1.u4.p254!=1)) + (((i3.u8.p607==1)&&(i4.u9.p618==1))||(u0.p84==1))) + (i2.u5.p298==1)...216
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(((!((u15.p950==1)||(i2.u3.p250==1)))&&(i1.u2.p135==1)))))) * !(E(!(((!((u15.p950==1)...404
Reverse transition relation is NOT exact ! Due to transitions t3, t24, t84, t85, t124, t137, t139, t140, t141, i1.u4.t83, i2.t66, i2.t32, i2.u3.t65, i2.u5....452
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,1.10483,37400,1,0,63405,3384,1857,106330,512,10170,109096
FORMULA StigmergyCommit-PT-03b-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

[2025-06-04 16:10:31] [INFO ] Flatten gal took : 41 ms
[2025-06-04 16:10:31] [INFO ] Flatten gal took : 42 ms
[2025-06-04 16:10:31] [INFO ] Applying decomposition
[2025-06-04 16:10:31] [INFO ] Flatten gal took : 42 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/graph18430918809851710562.txt' '-o' '/tmp/graph18430918809851710562.bin' '-w' '/tmp/graph18430918809851710562.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18430918809851710562.bin' '-l' '-1' '-v' '-w' '/tmp/graph18430918809851710562.weights' '-q' '0' '-e' '0.001'
[2025-06-04 16:10:31] [INFO ] Decomposing Gal with order
[2025-06-04 16:10:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 16:10:31] [INFO ] Removed a total of 883 redundant transitions.
[2025-06-04 16:10:31] [INFO ] Flatten gal took : 82 ms
[2025-06-04 16:10:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-04 16:10:31] [INFO ] Time to serialize gal into /tmp/CTLFireability3880318607414043147.gal : 13 ms
[2025-06-04 16:10:31] [INFO ] Time to serialize properties into /tmp/CTLFireability12200074500363132691.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3880318607414043147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12200074500363132691.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65665e+10,25.3513,561724,3229,19,1.05723e+06,1061,1437,2.66109e+06,54,3540,0


Converting to forward existential form...Done !
original formula: (AX(((((AX((i31.u282.p869==0)) + EF((i6.u63.p167==0))) + ((((E((i25.u229.p680==1) U (((i30.u4.p49==1)&&(i30.u99.p351==1))&&((i30.u201.p65...519
=> equivalent forward existential formula: (((([(EY(((((EY(Init) * !((((i30.u99.p351==0)||(i30.u208.p631==0))||(i30.u311.p955==0)))) * !((!(EX(!((i31.u282....1016
Reverse transition relation is NOT exact ! Due to transitions t8, t81, t115, t137, t193, t249, t283, t332, t390, t391, t446, t448, t487, t526, t604, t605, ...700
ITS-tools command line returned an error code 139
[2025-06-04 16:14:23] [INFO ] Applying decomposition
[2025-06-04 16:14:23] [INFO ] Flatten gal took : 26 ms
[2025-06-04 16:14:23] [INFO ] Decomposing Gal with order
[2025-06-04 16:14:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 16:14:23] [INFO ] Removed a total of 755 redundant transitions.
[2025-06-04 16:14:23] [INFO ] Flatten gal took : 53 ms
[2025-06-04 16:14:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 276 labels/synchronizations in 6 ms.
[2025-06-04 16:14:23] [INFO ] Time to serialize gal into /tmp/CTLFireability13569406420060673510.gal : 4 ms
[2025-06-04 16:14:23] [INFO ] Time to serialize properties into /tmp/CTLFireability8081660452660863345.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13569406420060673510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8081660452660863345.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65665e+10,3.81488,84988,120,6824,8758,184484,139,31751,1935,1.13784e+06,0


Converting to forward existential form...Done !
original formula: (AX(((((AX((i0.i0.u6.p869==0)) + EF((i0.i0.i0.u4.p167==0))) + ((((E((i0.i0.u6.p680==1) U (((i0.i0.i0.u4.p49==1)&&(i0.i0.i0.u5.p351==1))&&...527
=> equivalent forward existential formula: (((([(EY(((((EY(Init) * !((((i0.i0.i0.u5.p351==0)||(i0.i0.u6.p631==0))||(i0.u7.p955==0)))) * !((!(EX(!((i0.i0.u6...1044
Reverse transition relation is NOT exact ! Due to transitions t906, i0.u7.t69, i0.u7.t81, i0.u7.t86, i0.u7.t115, i0.u7.t129, i0.u7.t137, i0.u7.t191, i0.u7....974
Detected timeout of ITS tools.
[2025-06-04 16:41:51] [INFO ] Flatten gal took : 511 ms
[2025-06-04 16:41:55] [INFO ] Input system was already deterministic with 1207 transitions.
[2025-06-04 16:41:55] [INFO ] Transformed 963 places.
[2025-06-04 16:41:55] [INFO ] Transformed 1207 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-04 16:41:56] [INFO ] Time to serialize gal into /tmp/CTLFireability17412979364322126733.gal : 39 ms
[2025-06-04 16:41:56] [INFO ] Time to serialize properties into /tmp/CTLFireability2150990576819924134.ctl : 16 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17412979364322126733.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2150990576819924134.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65665e+10,37.7161,637512,2,45100,5,2.23384e+06,6,0,5061,1.04842e+06,0


Converting to forward existential form...Done !
original formula: (AX(((((AX((p869==0)) + EF((p167==0))) + ((((E((p680==1) U (((p49==1)&&(p351==1))&&((p653==1)&&(p955==1)))) + AX((p715==1))) * (p601==0))...326
=> equivalent forward existential formula: (((([(EY(((((EY(Init) * !((((p351==0)||(p631==0))||(p955==0)))) * !((!(EX(!((p869==0)))) + E(TRUE U (p167==0))))...723
Reverse transition relation is NOT exact ! Due to transitions t8, t26, t69, t81, t86, t115, t129, t137, t191, t192, t193, t246, t249, t283, t284, t295, t31...523

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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="StigmergyCommit-PT-03b"
export BK_EXAMINATION="CTLFireability"
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 StigmergyCommit-PT-03b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903490500026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-03b.tgz
mv StigmergyCommit-PT-03b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;