fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r312-tall-165472282700754
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for RingSingleMessageInMbox-PT-d1m010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4678.636 903461.00 947785.00 4266.10 TFFFFTTFFFTTFFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472282700754.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RingSingleMessageInMbox-PT-d1m010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282700754
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 8.7K Jun 7 17:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 17:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 7 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 6 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.2K Jun 7 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 7 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 7 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 7 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Jun 6 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 5.8M Jun 6 12:11 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1654928230817

Running Version 202205111006
[2022-06-11 06:17:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 06:17:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 06:17:12] [INFO ] Load time of PNML (sax parser for PT used): 461 ms
[2022-06-11 06:17:12] [INFO ] Transformed 6690 places.
[2022-06-11 06:17:12] [INFO ] Transformed 11934 transitions.
[2022-06-11 06:17:12] [INFO ] Parsed PT model containing 6690 places and 11934 transitions in 633 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Deduced a syphon composed of 4305 places in 47 ms
Reduce places removed 4305 places and 0 transitions.
Support contains 61 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1068 places :
Symmetric choice reduction at 1 with 1068 rule applications. Total rules 1187 place count 1300 transition count 10351
Iterating global reduction 1 with 1068 rules applied. Total rules applied 2255 place count 1300 transition count 10351
Ensure Unique test removed 422 transitions
Reduce isomorphic transitions removed 422 transitions.
Iterating post reduction 1 with 422 rules applied. Total rules applied 2677 place count 1300 transition count 9929
Discarding 895 places :
Symmetric choice reduction at 2 with 895 rule applications. Total rules 3572 place count 405 transition count 9034
Iterating global reduction 2 with 895 rules applied. Total rules applied 4467 place count 405 transition count 9034
Ensure Unique test removed 7188 transitions
Reduce isomorphic transitions removed 7188 transitions.
Iterating post reduction 2 with 7188 rules applied. Total rules applied 11655 place count 405 transition count 1846
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 11666 place count 394 transition count 1835
Iterating global reduction 3 with 11 rules applied. Total rules applied 11677 place count 394 transition count 1835
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 3 with 66 rules applied. Total rules applied 11743 place count 394 transition count 1769
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 11748 place count 389 transition count 1764
Iterating global reduction 4 with 5 rules applied. Total rules applied 11753 place count 389 transition count 1764
Applied a total of 11753 rules in 398 ms. Remains 389 /2385 variables (removed 1996) and now considering 1764/11934 (removed 10170) transitions.
// Phase 1: matrix 1764 rows 389 cols
[2022-06-11 06:17:13] [INFO ] Computed 3 place invariants in 32 ms
[2022-06-11 06:17:13] [INFO ] Implicit Places using invariants in 377 ms returned []
// Phase 1: matrix 1764 rows 389 cols
[2022-06-11 06:17:13] [INFO ] Computed 3 place invariants in 10 ms
[2022-06-11 06:17:14] [INFO ] State equation strengthened by 1420 read => feed constraints.
[2022-06-11 06:17:16] [INFO ] Implicit Places using invariants and state equation in 3362 ms returned []
Implicit Place search using SMT with State Equation took 3768 ms to find 0 implicit places.
// Phase 1: matrix 1764 rows 389 cols
[2022-06-11 06:17:16] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-11 06:17:17] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 389/2385 places, 1764/11934 transitions.
Finished structural reductions, in 1 iterations. Remains : 389/2385 places, 1764/11934 transitions.
Support contains 61 out of 389 places after structural reductions.
[2022-06-11 06:17:17] [INFO ] Flatten gal took : 135 ms
[2022-06-11 06:17:17] [INFO ] Flatten gal took : 95 ms
[2022-06-11 06:17:18] [INFO ] Input system was already deterministic with 1764 transitions.
Incomplete random walk after 10000 steps, including 1701 resets, run finished after 674 ms. (steps per millisecond=14 ) properties (out of 61) seen :47
Incomplete Best-First random walk after 10001 steps, including 185 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 264 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 190 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 173 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 203 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 253 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 1666 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 177 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 275 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 224 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 214 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 201 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 1764 rows 389 cols
[2022-06-11 06:17:19] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-11 06:17:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 06:17:19] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 06:17:20] [INFO ] After 575ms SMT Verify possible using state equation in real domain returned unsat :6 sat :1 real:6
[2022-06-11 06:17:20] [INFO ] State equation strengthened by 1420 read => feed constraints.
[2022-06-11 06:17:20] [INFO ] After 307ms SMT Verify possible using 1420 Read/Feed constraints in real domain returned unsat :6 sat :0 real:7
[2022-06-11 06:17:20] [INFO ] After 1238ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:7
[2022-06-11 06:17:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 06:17:21] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 06:17:21] [INFO ] After 710ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :4
[2022-06-11 06:17:22] [INFO ] After 822ms SMT Verify possible using 1420 Read/Feed constraints in natural domain returned unsat :9 sat :4
[2022-06-11 06:17:22] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 5 ms to minimize.
[2022-06-11 06:17:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 118 ms
[2022-06-11 06:17:23] [INFO ] Deduced a trap composed of 105 places in 71 ms of which 1 ms to minimize.
[2022-06-11 06:17:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2022-06-11 06:17:23] [INFO ] After 1832ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :3
Attempting to minimize the solution found.
Minimization took 717 ms.
[2022-06-11 06:17:24] [INFO ] After 3433ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :3
Fused 13 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 6 out of 389 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 389/389 places, 1764/1764 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 342 transition count 545
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 342 transition count 545
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 103 place count 342 transition count 536
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 141 place count 304 transition count 498
Iterating global reduction 1 with 38 rules applied. Total rules applied 179 place count 304 transition count 498
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 187 place count 304 transition count 490
Discarding 117 places :
Symmetric choice reduction at 2 with 117 rule applications. Total rules 304 place count 187 transition count 373
Iterating global reduction 2 with 117 rules applied. Total rules applied 421 place count 187 transition count 373
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 513 place count 187 transition count 281
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 516 place count 184 transition count 242
Iterating global reduction 3 with 3 rules applied. Total rules applied 519 place count 184 transition count 242
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 521 place count 182 transition count 240
Iterating global reduction 3 with 2 rules applied. Total rules applied 523 place count 182 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 524 place count 182 transition count 239
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 528 place count 178 transition count 235
Iterating global reduction 4 with 4 rules applied. Total rules applied 532 place count 178 transition count 235
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 536 place count 178 transition count 231
Applied a total of 536 rules in 78 ms. Remains 178 /389 variables (removed 211) and now considering 231/1764 (removed 1533) transitions.
Finished structural reductions, in 1 iterations. Remains : 178/389 places, 231/1764 transitions.
Incomplete random walk after 10000 steps, including 2122 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 715 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 378 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1015399 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1015399 steps, saw 450075 distinct states, run finished after 3002 ms. (steps per millisecond=338 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 178 cols
[2022-06-11 06:17:27] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-11 06:17:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 06:17:27] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 06:17:28] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 06:17:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 06:17:28] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 06:17:28] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 06:17:28] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-06-11 06:17:28] [INFO ] After 37ms SMT Verify possible using 64 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 06:17:28] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-11 06:17:28] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 178/178 places, 231/231 transitions.
Graph (complete) has 565 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 177 transition count 222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 176 transition count 221
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 176 transition count 221
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 175 transition count 220
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 175 transition count 220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 174 transition count 219
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 174 transition count 219
Applied a total of 16 rules in 29 ms. Remains 174 /178 variables (removed 4) and now considering 219/231 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 174/178 places, 219/231 transitions.
Incomplete random walk after 10000 steps, including 2046 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 386 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1968108 steps, run timeout after 3001 ms. (steps per millisecond=655 ) properties seen :{}
Probabilistic random walk after 1968108 steps, saw 858954 distinct states, run finished after 3001 ms. (steps per millisecond=655 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 174 cols
[2022-06-11 06:17:31] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-11 06:17:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 5 ms returned sat
[2022-06-11 06:17:31] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 06:17:31] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-11 06:17:31] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 06:17:31] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-06-11 06:17:31] [INFO ] After 42ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 06:17:31] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-06-11 06:17:31] [INFO ] After 255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 174/174 places, 219/219 transitions.
Applied a total of 0 rules in 11 ms. Remains 174 /174 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 219/219 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 174/174 places, 219/219 transitions.
Applied a total of 0 rules in 9 ms. Remains 174 /174 variables (removed 0) and now considering 219/219 (removed 0) transitions.
// Phase 1: matrix 219 rows 174 cols
[2022-06-11 06:17:31] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-11 06:17:31] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 219 rows 174 cols
[2022-06-11 06:17:31] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 06:17:32] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-06-11 06:17:32] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2022-06-11 06:17:32] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 219 rows 174 cols
[2022-06-11 06:17:32] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 06:17:32] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 219/219 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 174 transition count 214
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 170 transition count 214
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 9 place count 170 transition count 178
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 81 place count 134 transition count 178
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 2 with 8 rules applied. Total rules applied 89 place count 130 transition count 174
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 2 with 2 rules applied. Total rules applied 91 place count 129 transition count 180
Applied a total of 91 rules in 24 ms. Remains 129 /174 variables (removed 45) and now considering 180/219 (removed 39) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 180 rows 129 cols
[2022-06-11 06:17:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 06:17:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 06:17:32] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 06:17:32] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 06:17:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 06:17:32] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 06:17:32] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 06:17:32] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 1 ms to minimize.
[2022-06-11 06:17:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 59 ms
[2022-06-11 06:17:32] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-06-11 06:17:32] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
[2022-06-11 06:17:32] [INFO ] Flatten gal took : 11 ms
[2022-06-11 06:17:32] [INFO ] Flatten gal took : 10 ms
[2022-06-11 06:17:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11273956880735542628.gal : 3 ms
[2022-06-11 06:17:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1997519317152825129.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms2825084410675031431;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11273956880735542628.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1997519317152825129.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality1997519317152825129.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,39,0.047318,4872,2,468,5,1162,6,0,697,370,0
Total reachable state count : 39

Successfully simplified 11 atomic propositions for a total of 16 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-11 06:17:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2022-06-11 06:17:32] [INFO ] Flatten gal took : 58 ms
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-11 06:17:32] [INFO ] Flatten gal took : 60 ms
[2022-06-11 06:17:33] [INFO ] Input system was already deterministic with 1764 transitions.
Support contains 41 out of 389 places (down from 45) after GAL structural reductions.
Computed a total of 107 stabilizing places and 831 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 389/389 places, 1764/1764 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 341 transition count 582
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 341 transition count 582
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 109 place count 341 transition count 569
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 148 place count 302 transition count 530
Iterating global reduction 1 with 39 rules applied. Total rules applied 187 place count 302 transition count 530
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 197 place count 302 transition count 520
Discarding 115 places :
Symmetric choice reduction at 2 with 115 rule applications. Total rules 312 place count 187 transition count 405
Iterating global reduction 2 with 115 rules applied. Total rules applied 427 place count 187 transition count 405
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 2 with 108 rules applied. Total rules applied 535 place count 187 transition count 297
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 538 place count 184 transition count 270
Iterating global reduction 3 with 3 rules applied. Total rules applied 541 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 542 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 543 place count 183 transition count 269
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 547 place count 179 transition count 265
Iterating global reduction 3 with 4 rules applied. Total rules applied 551 place count 179 transition count 265
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 563 place count 179 transition count 253
Applied a total of 563 rules in 58 ms. Remains 179 /389 variables (removed 210) and now considering 253/1764 (removed 1511) transitions.
// Phase 1: matrix 253 rows 179 cols
[2022-06-11 06:17:33] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 06:17:33] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 253 rows 179 cols
[2022-06-11 06:17:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:17:33] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-06-11 06:17:33] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2022-06-11 06:17:33] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 253 rows 179 cols
[2022-06-11 06:17:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:17:33] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 179/389 places, 253/1764 transitions.
Finished structural reductions, in 1 iterations. Remains : 179/389 places, 253/1764 transitions.
[2022-06-11 06:17:33] [INFO ] Flatten gal took : 10 ms
[2022-06-11 06:17:33] [INFO ] Flatten gal took : 10 ms
[2022-06-11 06:17:33] [INFO ] Input system was already deterministic with 253 transitions.
[2022-06-11 06:17:33] [INFO ] Flatten gal took : 9 ms
[2022-06-11 06:17:33] [INFO ] Flatten gal took : 9 ms
[2022-06-11 06:17:33] [INFO ] Time to serialize gal into /tmp/CTLFireability17034703875636313850.gal : 2 ms
[2022-06-11 06:17:33] [INFO ] Time to serialize properties into /tmp/CTLFireability12152204671457007800.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17034703875636313850.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12152204671457007800.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
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.38611e+08,5.8806,170872,2,23198,5,296081,6,0,969,264804,0


Converting to forward existential form...Done !
original formula: EG(((s1<1)||(l3911<1)))
=> equivalent forward existential formula: [FwdG(Init,((s1<1)||(l3911<1)))] != FALSE
Hit Full ! (commute/partial/dont) 9/0/244
Detected timeout of ITS tools.
[2022-06-11 06:18:03] [INFO ] Flatten gal took : 9 ms
[2022-06-11 06:18:03] [INFO ] Applying decomposition
[2022-06-11 06:18:03] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10437691090278614801.txt' '-o' '/tmp/graph10437691090278614801.bin' '-w' '/tmp/graph10437691090278614801.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10437691090278614801.bin' '-l' '-1' '-v' '-w' '/tmp/graph10437691090278614801.weights' '-q' '0' '-e' '0.001'
[2022-06-11 06:18:03] [INFO ] Decomposing Gal with order
[2022-06-11 06:18:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 06:18:04] [INFO ] Removed a total of 251 redundant transitions.
[2022-06-11 06:18:04] [INFO ] Flatten gal took : 57 ms
[2022-06-11 06:18:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 161 labels/synchronizations in 11 ms.
[2022-06-11 06:18:04] [INFO ] Time to serialize gal into /tmp/CTLFireability5468257922617120916.gal : 3 ms
[2022-06-11 06:18:04] [INFO ] Time to serialize properties into /tmp/CTLFireability4049506199242585722.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5468257922617120916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4049506199242585722.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
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.38611e+08,11.9563,342620,4057,5248,260827,191671,618,1.52012e+06,243,2.17035e+06,0


Converting to forward existential form...Done !
original formula: EG(((i10.u2.s1<1)||(u0.l3911<1)))
=> equivalent forward existential formula: [FwdG(Init,((i10.u2.s1<1)||(u0.l3911<1)))] != FALSE
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 389/389 places, 1764/1764 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 343 transition count 670
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 343 transition count 670
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 109 place count 343 transition count 653
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 146 place count 306 transition count 616
Iterating global reduction 1 with 37 rules applied. Total rules applied 183 place count 306 transition count 616
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 203 place count 306 transition count 596
Discarding 107 places :
Symmetric choice reduction at 2 with 107 rule applications. Total rules 310 place count 199 transition count 489
Iterating global reduction 2 with 107 rules applied. Total rules applied 417 place count 199 transition count 489
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 2 with 140 rules applied. Total rules applied 557 place count 199 transition count 349
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 558 place count 198 transition count 348
Iterating global reduction 3 with 1 rules applied. Total rules applied 559 place count 198 transition count 348
Applied a total of 559 rules in 65 ms. Remains 198 /389 variables (removed 191) and now considering 348/1764 (removed 1416) transitions.
// Phase 1: matrix 348 rows 198 cols
[2022-06-11 06:18:34] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:18:34] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 348 rows 198 cols
[2022-06-11 06:18:34] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:18:34] [INFO ] State equation strengthened by 164 read => feed constraints.
[2022-06-11 06:18:34] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
[2022-06-11 06:18:34] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 348 rows 198 cols
[2022-06-11 06:18:34] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:18:35] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 198/389 places, 348/1764 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/389 places, 348/1764 transitions.
[2022-06-11 06:18:35] [INFO ] Flatten gal took : 10 ms
[2022-06-11 06:18:35] [INFO ] Flatten gal took : 12 ms
[2022-06-11 06:18:35] [INFO ] Input system was already deterministic with 348 transitions.
[2022-06-11 06:18:35] [INFO ] Flatten gal took : 11 ms
[2022-06-11 06:18:35] [INFO ] Flatten gal took : 11 ms
[2022-06-11 06:18:35] [INFO ] Time to serialize gal into /tmp/CTLFireability11783091910741200587.gal : 2 ms
[2022-06-11 06:18:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4540584358667170172.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11783091910741200587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4540584358667170172.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.70759e+08,7.95418,246132,2,18176,5,581384,6,0,1140,585823,0


Converting to forward existential form...Done !
original formula: AG(E(((s1>=1)&&(l3908>=1)) U E(AF(((s1>=1)&&(l3924>=1))) U !(((s1>=1)&&(l3939>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((s1>=1)&&(l3908>=1)) U E(!(EG(!(((s1>=1)&&(l3924>=1))))) U !(((s1>=1)&&(l3939>=1)))))))...164
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30,...1044
Detected timeout of ITS tools.
[2022-06-11 06:19:05] [INFO ] Flatten gal took : 13 ms
[2022-06-11 06:19:05] [INFO ] Applying decomposition
[2022-06-11 06:19:05] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10788093263364630447.txt' '-o' '/tmp/graph10788093263364630447.bin' '-w' '/tmp/graph10788093263364630447.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10788093263364630447.bin' '-l' '-1' '-v' '-w' '/tmp/graph10788093263364630447.weights' '-q' '0' '-e' '0.001'
[2022-06-11 06:19:05] [INFO ] Decomposing Gal with order
[2022-06-11 06:19:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 06:19:05] [INFO ] Removed a total of 357 redundant transitions.
[2022-06-11 06:19:05] [INFO ] Flatten gal took : 34 ms
[2022-06-11 06:19:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 226 labels/synchronizations in 10 ms.
[2022-06-11 06:19:05] [INFO ] Time to serialize gal into /tmp/CTLFireability6560828514965289727.gal : 3 ms
[2022-06-11 06:19:05] [INFO ] Time to serialize properties into /tmp/CTLFireability386106147064150607.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6560828514965289727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability386106147064150607.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...252
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.70759e+08,3.16242,87212,2789,1563,92809,20509,694,466896,336,235649,0


Converting to forward existential form...Done !
original formula: AG(E(((i0.u0.s1>=1)&&(i0.u0.l3908>=1)) U E(AF(((i0.u0.s1>=1)&&(i0.u0.l3924>=1))) U !(((i0.u0.s1>=1)&&(i0.u0.l3939>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((i0.u0.s1>=1)&&(i0.u0.l3908>=1)) U E(!(EG(!(((i0.u0.s1>=1)&&(i0.u0.l3924>=1))))) U !(((...200
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t67, t70, t73, t76, t264, t265, t266, t267, t268, t269, t270, t271, t272, t273, t275,...1611
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
(forward)formula 0,0,12.6673,261188,1,0,303786,72602,3583,1.1368e+06,2033,509959,902021
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 1764/1764 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 343 transition count 670
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 343 transition count 670
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 109 place count 343 transition count 653
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 146 place count 306 transition count 616
Iterating global reduction 1 with 37 rules applied. Total rules applied 183 place count 306 transition count 616
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 203 place count 306 transition count 596
Discarding 107 places :
Symmetric choice reduction at 2 with 107 rule applications. Total rules 310 place count 199 transition count 489
Iterating global reduction 2 with 107 rules applied. Total rules applied 417 place count 199 transition count 489
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Iterating post reduction 2 with 148 rules applied. Total rules applied 565 place count 199 transition count 341
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 567 place count 197 transition count 327
Iterating global reduction 3 with 2 rules applied. Total rules applied 569 place count 197 transition count 327
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 570 place count 196 transition count 326
Iterating global reduction 3 with 1 rules applied. Total rules applied 571 place count 196 transition count 326
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 575 place count 192 transition count 322
Iterating global reduction 3 with 4 rules applied. Total rules applied 579 place count 192 transition count 322
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 603 place count 192 transition count 298
Applied a total of 603 rules in 38 ms. Remains 192 /389 variables (removed 197) and now considering 298/1764 (removed 1466) transitions.
// Phase 1: matrix 298 rows 192 cols
[2022-06-11 06:19:18] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:19:18] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 298 rows 192 cols
[2022-06-11 06:19:18] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:19:18] [INFO ] State equation strengthened by 119 read => feed constraints.
[2022-06-11 06:19:18] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
// Phase 1: matrix 298 rows 192 cols
[2022-06-11 06:19:18] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:19:18] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/389 places, 298/1764 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/389 places, 298/1764 transitions.
[2022-06-11 06:19:18] [INFO ] Flatten gal took : 11 ms
[2022-06-11 06:19:18] [INFO ] Flatten gal took : 10 ms
[2022-06-11 06:19:18] [INFO ] Input system was already deterministic with 298 transitions.
[2022-06-11 06:19:18] [INFO ] Flatten gal took : 9 ms
[2022-06-11 06:19:18] [INFO ] Flatten gal took : 9 ms
[2022-06-11 06:19:18] [INFO ] Time to serialize gal into /tmp/CTLFireability7911123360112902986.gal : 1 ms
[2022-06-11 06:19:18] [INFO ] Time to serialize properties into /tmp/CTLFireability4187239651266755122.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7911123360112902986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4187239651266755122.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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.38612e+08,8.09474,235924,2,25799,5,467745,6,0,1066,518753,0


Converting to forward existential form...Done !
original formula: A(!(((s1>=1)&&(l3925>=1))) U EX(EX(AF((((s1>=1)&&(l3921>=1))||((s1>=1)&&(l3915>=1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EX(EX(!(EG(!((((s1>=1)&&(l3921>=1))||((s1>=1)&&(l3915>=1)))))))))))) * !(E(!(EX(EX(!(EG(!((((s1...317
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t18, t19, t20, t21, t22, t23, t24, t25, t30, t31, t32, t33, t34, t35, t36, t37, t38,...776
Detected timeout of ITS tools.
[2022-06-11 06:19:49] [INFO ] Flatten gal took : 8 ms
[2022-06-11 06:19:49] [INFO ] Applying decomposition
[2022-06-11 06:19:49] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15291950543576427133.txt' '-o' '/tmp/graph15291950543576427133.bin' '-w' '/tmp/graph15291950543576427133.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15291950543576427133.bin' '-l' '-1' '-v' '-w' '/tmp/graph15291950543576427133.weights' '-q' '0' '-e' '0.001'
[2022-06-11 06:19:49] [INFO ] Decomposing Gal with order
[2022-06-11 06:19:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 06:19:49] [INFO ] Removed a total of 339 redundant transitions.
[2022-06-11 06:19:49] [INFO ] Flatten gal took : 28 ms
[2022-06-11 06:19:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 185 labels/synchronizations in 8 ms.
[2022-06-11 06:19:49] [INFO ] Time to serialize gal into /tmp/CTLFireability12566700136618948855.gal : 3 ms
[2022-06-11 06:19:49] [INFO ] Time to serialize properties into /tmp/CTLFireability2728225585991985820.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12566700136618948855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2728225585991985820.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
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.38612e+08,2.3277,75380,1959,1275,72775,14826,631,480695,299,91899,0


Converting to forward existential form...Done !
original formula: A(!(((u0.s1>=1)&&(u0.l3925>=1))) U EX(EX(AF((((u0.s1>=1)&&(u0.l3921>=1))||((u0.s1>=1)&&(u0.l3915>=1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EX(EX(!(EG(!((((u0.s1>=1)&&(u0.l3921>=1))||((u0.s1>=1)&&(u0.l3915>=1)))))))))))) * !(E(!(EX(EX(...359
Reverse transition relation is NOT exact ! Due to transitions t1, t21, t23, t24, t62, t215, t216, t217, t218, t219, t220, t221, t222, t223, t224, t225, t22...858
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 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
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,10.7056,195620,1,0,219593,54592,2913,878428,1600,262357,571571
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 1764/1764 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 344 transition count 676
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 344 transition count 676
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 104 place count 344 transition count 662
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 141 place count 307 transition count 625
Iterating global reduction 1 with 37 rules applied. Total rules applied 178 place count 307 transition count 625
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 201 place count 307 transition count 602
Discarding 107 places :
Symmetric choice reduction at 2 with 107 rule applications. Total rules 308 place count 200 transition count 495
Iterating global reduction 2 with 107 rules applied. Total rules applied 415 place count 200 transition count 495
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 2 with 140 rules applied. Total rules applied 555 place count 200 transition count 355
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 556 place count 199 transition count 354
Iterating global reduction 3 with 1 rules applied. Total rules applied 557 place count 199 transition count 354
Applied a total of 557 rules in 20 ms. Remains 199 /389 variables (removed 190) and now considering 354/1764 (removed 1410) transitions.
// Phase 1: matrix 354 rows 199 cols
[2022-06-11 06:19:59] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:19:59] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 354 rows 199 cols
[2022-06-11 06:19:59] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:20:00] [INFO ] State equation strengthened by 169 read => feed constraints.
[2022-06-11 06:20:00] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
// Phase 1: matrix 354 rows 199 cols
[2022-06-11 06:20:00] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:20:00] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 199/389 places, 354/1764 transitions.
Finished structural reductions, in 1 iterations. Remains : 199/389 places, 354/1764 transitions.
[2022-06-11 06:20:00] [INFO ] Flatten gal took : 8 ms
[2022-06-11 06:20:00] [INFO ] Flatten gal took : 9 ms
[2022-06-11 06:20:00] [INFO ] Input system was already deterministic with 354 transitions.
[2022-06-11 06:20:00] [INFO ] Flatten gal took : 9 ms
[2022-06-11 06:20:00] [INFO ] Flatten gal took : 9 ms
[2022-06-11 06:20:00] [INFO ] Time to serialize gal into /tmp/CTLFireability12004726619195018303.gal : 3 ms
[2022-06-11 06:20:00] [INFO ] Time to serialize properties into /tmp/CTLFireability16488131664201503268.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12004726619195018303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16488131664201503268.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
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.73821e+08,7.73421,235832,2,18798,5,483409,6,0,1150,397832,0


Converting to forward existential form...Done !
original formula: (EX(((s1<1)||(l2637<1))) * EF(AG(((EG(((s1>=1)&&(l3932>=1))) * (((s1>=1)&&(l3939>=1)) + EX(((s1>=1)&&(l192>=1))))) + AG(EF(((s1>=1)&&(l39...168
=> equivalent forward existential formula: [(FwdU((Init * EX(((s1<1)||(l2637<1)))),TRUE) * !(E(TRUE U !(((EG(((s1>=1)&&(l3932>=1))) * (((s1>=1)&&(l3939>=1)...250
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30,...1073
(forward)formula 0,0,26.5208,570348,1,0,623,1.6376e+06,692,232,8162,1.20082e+06,867
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 1764/1764 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 346 transition count 754
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 346 transition count 754
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 109 place count 346 transition count 731
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 143 place count 312 transition count 697
Iterating global reduction 1 with 34 rules applied. Total rules applied 177 place count 312 transition count 697
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 200 place count 312 transition count 674
Discarding 99 places :
Symmetric choice reduction at 2 with 99 rule applications. Total rules 299 place count 213 transition count 575
Iterating global reduction 2 with 99 rules applied. Total rules applied 398 place count 213 transition count 575
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Iterating post reduction 2 with 148 rules applied. Total rules applied 546 place count 213 transition count 427
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 547 place count 212 transition count 426
Iterating global reduction 3 with 1 rules applied. Total rules applied 548 place count 212 transition count 426
Applied a total of 548 rules in 24 ms. Remains 212 /389 variables (removed 177) and now considering 426/1764 (removed 1338) transitions.
// Phase 1: matrix 426 rows 212 cols
[2022-06-11 06:20:27] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:20:27] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 426 rows 212 cols
[2022-06-11 06:20:27] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:20:27] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-06-11 06:20:28] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
// Phase 1: matrix 426 rows 212 cols
[2022-06-11 06:20:28] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 06:20:28] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 212/389 places, 426/1764 transitions.
Finished structural reductions, in 1 iterations. Remains : 212/389 places, 426/1764 transitions.
[2022-06-11 06:20:28] [INFO ] Flatten gal took : 10 ms
[2022-06-11 06:20:28] [INFO ] Flatten gal took : 11 ms
[2022-06-11 06:20:28] [INFO ] Input system was already deterministic with 426 transitions.
[2022-06-11 06:20:28] [INFO ] Flatten gal took : 11 ms
[2022-06-11 06:20:28] [INFO ] Flatten gal took : 11 ms
[2022-06-11 06:20:28] [INFO ] Time to serialize gal into /tmp/CTLFireability17112700124094446620.gal : 2 ms
[2022-06-11 06:20:28] [INFO ] Time to serialize properties into /tmp/CTLFireability4586442542883145278.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17112700124094446620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4586442542883145278.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,2.22395e+08,21.2978,541792,2,21085,5,981858,6,0,1274,758084,0


Converting to forward existential form...Done !
original formula: EG(!(A(!(((s1>=1)&&(l3930>=1))) U (((A(((s1>=1)&&(l3926>=1)) U ((s1>=1)&&(l3922>=1))) + EX(((s1>=1)&&(l3925>=1)))) + AX(((s1>=1)&&(l3940>...196
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!((((!((E(!(((s1>=1)&&(l3922>=1))) U (!(((s1>=1)&&(l3926>=1))) * !(((s1>=1)&&(l3922>=1))))) + ...781
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30,...1404
Detected timeout of ITS tools.
[2022-06-11 06:20:58] [INFO ] Flatten gal took : 14 ms
[2022-06-11 06:20:58] [INFO ] Applying decomposition
[2022-06-11 06:20:58] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9190816361411523370.txt' '-o' '/tmp/graph9190816361411523370.bin' '-w' '/tmp/graph9190816361411523370.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9190816361411523370.bin' '-l' '-1' '-v' '-w' '/tmp/graph9190816361411523370.weights' '-q' '0' '-e' '0.001'
[2022-06-11 06:20:58] [INFO ] Decomposing Gal with order
[2022-06-11 06:20:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 06:20:58] [INFO ] Removed a total of 466 redundant transitions.
[2022-06-11 06:20:58] [INFO ] Flatten gal took : 26 ms
[2022-06-11 06:20:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 348 labels/synchronizations in 11 ms.
[2022-06-11 06:20:58] [INFO ] Time to serialize gal into /tmp/CTLFireability6449856112333754305.gal : 4 ms
[2022-06-11 06:20:58] [INFO ] Time to serialize properties into /tmp/CTLFireability17874638924660538392.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6449856112333754305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17874638924660538392.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
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,2.22395e+08,13.1538,288260,4506,4335,249292,55291,778,1.65794e+06,400,805207,0


Converting to forward existential form...Done !
original formula: EG(!(A(!(((i0.u0.s1>=1)&&(i0.u0.l3930>=1))) U (((A(((i0.u0.s1>=1)&&(u20.l3926>=1)) U ((i0.u0.s1>=1)&&(i0.u0.l3922>=1))) + EX(((i0.u0.s1>=...264
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!((((!((E(!(((i0.u0.s1>=1)&&(i0.u0.l3922>=1))) U (!(((i0.u0.s1>=1)&&(u20.l3926>=1))) * !(((i0....1033
Reverse transition relation is NOT exact ! Due to transitions t1, t72, t75, t78, t81, t219, t231, t239, t240, t241, t242, t243, t339, t340, t341, t342, t34...1589
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
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 1764/1764 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 345 transition count 662
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 345 transition count 662
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 108 place count 345 transition count 642
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 144 place count 309 transition count 606
Iterating global reduction 1 with 36 rules applied. Total rules applied 180 place count 309 transition count 606
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 194 place count 309 transition count 592
Discarding 106 places :
Symmetric choice reduction at 2 with 106 rule applications. Total rules 300 place count 203 transition count 486
Iterating global reduction 2 with 106 rules applied. Total rules applied 406 place count 203 transition count 486
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 534 place count 203 transition count 358
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 535 place count 202 transition count 357
Iterating global reduction 3 with 1 rules applied. Total rules applied 536 place count 202 transition count 357
Applied a total of 536 rules in 25 ms. Remains 202 /389 variables (removed 187) and now considering 357/1764 (removed 1407) transitions.
// Phase 1: matrix 357 rows 202 cols
[2022-06-11 06:21:28] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-11 06:21:29] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 357 rows 202 cols
[2022-06-11 06:21:29] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:21:29] [INFO ] State equation strengthened by 170 read => feed constraints.
[2022-06-11 06:21:29] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
// Phase 1: matrix 357 rows 202 cols
[2022-06-11 06:21:29] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:21:29] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/389 places, 357/1764 transitions.
Finished structural reductions, in 1 iterations. Remains : 202/389 places, 357/1764 transitions.
[2022-06-11 06:21:29] [INFO ] Flatten gal took : 8 ms
[2022-06-11 06:21:29] [INFO ] Flatten gal took : 9 ms
[2022-06-11 06:21:29] [INFO ] Input system was already deterministic with 357 transitions.
[2022-06-11 06:21:29] [INFO ] Flatten gal took : 9 ms
[2022-06-11 06:21:29] [INFO ] Flatten gal took : 9 ms
[2022-06-11 06:21:29] [INFO ] Time to serialize gal into /tmp/CTLFireability12106708592693720360.gal : 1 ms
[2022-06-11 06:21:29] [INFO ] Time to serialize properties into /tmp/CTLFireability6258563106054546201.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12106708592693720360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6258563106054546201.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.7718e+08,7.05383,216624,2,19269,5,438975,6,0,1165,377407,0


Converting to forward existential form...Done !
original formula: EX((!(A(!(((s1>=1)&&(l3925>=1))) U EG(((s1>=1)&&(l3919>=1))))) * ((EG((((s1<1)||(l2692<1))&&((s1<1)||(l3910<1)))) + (p1104<1)) + (l0<1)))...156
=> equivalent forward existential formula: (([FwdG((EY(Init) * !(!((E(!(EG(((s1>=1)&&(l3919>=1)))) U (!(!(((s1>=1)&&(l3925>=1)))) * !(EG(((s1>=1)&&(l3919>=...610
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t30, t31, t32, t33, t34,...1079
Detected timeout of ITS tools.
[2022-06-11 06:21:59] [INFO ] Flatten gal took : 13 ms
[2022-06-11 06:21:59] [INFO ] Applying decomposition
[2022-06-11 06:21:59] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3875690484865402662.txt' '-o' '/tmp/graph3875690484865402662.bin' '-w' '/tmp/graph3875690484865402662.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3875690484865402662.bin' '-l' '-1' '-v' '-w' '/tmp/graph3875690484865402662.weights' '-q' '0' '-e' '0.001'
[2022-06-11 06:21:59] [INFO ] Decomposing Gal with order
[2022-06-11 06:21:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 06:22:00] [INFO ] Removed a total of 380 redundant transitions.
[2022-06-11 06:22:00] [INFO ] Flatten gal took : 36 ms
[2022-06-11 06:22:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 392 labels/synchronizations in 8 ms.
[2022-06-11 06:22:00] [INFO ] Time to serialize gal into /tmp/CTLFireability9722779691768385454.gal : 3 ms
[2022-06-11 06:22:00] [INFO ] Time to serialize properties into /tmp/CTLFireability14246371468725609801.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9722779691768385454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14246371468725609801.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
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.7718e+08,23.4286,669792,4683,7836,565259,660663,685,2.63842e+06,343,3.12093e+06,0


Converting to forward existential form...Done !
original formula: EX((!(A(!(((i1.u0.s1>=1)&&(i2.u23.l3925>=1))) U EG(((i1.u0.s1>=1)&&(i2.u23.l3919>=1))))) * ((EG((((i1.u0.s1<1)||(i2.u23.l2692<1))&&((i1.u...221
=> equivalent forward existential formula: (([FwdG((EY(Init) * !(!((E(!(EG(((i1.u0.s1>=1)&&(i2.u23.l3919>=1)))) U (!(!(((i1.u0.s1>=1)&&(i2.u23.l3925>=1))))...805
Reverse transition relation is NOT exact ! Due to transitions t21, t22, t38, t39, t40, t64, t140, t141, t275, t276, t281, t289, t290, t291, t293, t294, t29...564
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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 1764/1764 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 343 transition count 627
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 343 transition count 627
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 106 place count 343 transition count 613
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 144 place count 305 transition count 575
Iterating global reduction 1 with 38 rules applied. Total rules applied 182 place count 305 transition count 575
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 197 place count 305 transition count 560
Discarding 111 places :
Symmetric choice reduction at 2 with 111 rule applications. Total rules 308 place count 194 transition count 449
Iterating global reduction 2 with 111 rules applied. Total rules applied 419 place count 194 transition count 449
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 543 place count 194 transition count 325
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 544 place count 193 transition count 324
Iterating global reduction 3 with 1 rules applied. Total rules applied 545 place count 193 transition count 324
Applied a total of 545 rules in 41 ms. Remains 193 /389 variables (removed 196) and now considering 324/1764 (removed 1440) transitions.
// Phase 1: matrix 324 rows 193 cols
[2022-06-11 06:22:30] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:22:30] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 324 rows 193 cols
[2022-06-11 06:22:30] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:22:30] [INFO ] State equation strengthened by 144 read => feed constraints.
[2022-06-11 06:22:30] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
// Phase 1: matrix 324 rows 193 cols
[2022-06-11 06:22:30] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 06:22:30] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 193/389 places, 324/1764 transitions.
Finished structural reductions, in 1 iterations. Remains : 193/389 places, 324/1764 transitions.
[2022-06-11 06:22:30] [INFO ] Flatten gal took : 8 ms
[2022-06-11 06:22:30] [INFO ] Flatten gal took : 8 ms
[2022-06-11 06:22:30] [INFO ] Input system was already deterministic with 324 transitions.
[2022-06-11 06:22:31] [INFO ] Flatten gal took : 8 ms
[2022-06-11 06:22:31] [INFO ] Flatten gal took : 8 ms
[2022-06-11 06:22:31] [INFO ] Time to serialize gal into /tmp/CTLFireability603619690318907321.gal : 2 ms
[2022-06-11 06:22:31] [INFO ] Time to serialize properties into /tmp/CTLFireability324543895649087376.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability603619690318907321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability324543895649087376.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...272
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.70759e+08,2.79459,88852,2,15765,5,185075,6,0,1096,189308,0


Converting to forward existential form...Done !
original formula: EG(AX(((AF(EX(((s1>=1)&&(l2678>=1)))) + ((s1>=1)&&(l3929>=1))) + ((s1>=1)&&(l3920>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(((!(EG(!(EX(((s1>=1)&&(l2678>=1)))))) + ((s1>=1)&&(l3929>=1))) + ((s1>=1)&&(l3920>=1)))))))] !...162
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t27, t28, t29, t30, t31,...941
Using saturation style SCC detection
(forward)formula 0,0,28.049,706540,1,0,647,2.82495e+06,632,266,7810,2.09449e+06,812
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 1764/1764 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 343 transition count 665
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 343 transition count 665
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 111 place count 343 transition count 646
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 148 place count 306 transition count 609
Iterating global reduction 1 with 37 rules applied. Total rules applied 185 place count 306 transition count 609
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 202 place count 306 transition count 592
Discarding 107 places :
Symmetric choice reduction at 2 with 107 rule applications. Total rules 309 place count 199 transition count 485
Iterating global reduction 2 with 107 rules applied. Total rules applied 416 place count 199 transition count 485
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 2 with 140 rules applied. Total rules applied 556 place count 199 transition count 345
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 558 place count 197 transition count 331
Iterating global reduction 3 with 2 rules applied. Total rules applied 560 place count 197 transition count 331
Applied a total of 560 rules in 18 ms. Remains 197 /389 variables (removed 192) and now considering 331/1764 (removed 1433) transitions.
// Phase 1: matrix 331 rows 197 cols
[2022-06-11 06:22:59] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:22:59] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 331 rows 197 cols
[2022-06-11 06:22:59] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:22:59] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 06:22:59] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
// Phase 1: matrix 331 rows 197 cols
[2022-06-11 06:23:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:23:00] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/389 places, 331/1764 transitions.
Finished structural reductions, in 1 iterations. Remains : 197/389 places, 331/1764 transitions.
[2022-06-11 06:23:00] [INFO ] Flatten gal took : 7 ms
[2022-06-11 06:23:00] [INFO ] Flatten gal took : 8 ms
[2022-06-11 06:23:00] [INFO ] Input system was already deterministic with 331 transitions.
[2022-06-11 06:23:00] [INFO ] Flatten gal took : 8 ms
[2022-06-11 06:23:00] [INFO ] Flatten gal took : 8 ms
[2022-06-11 06:23:00] [INFO ] Time to serialize gal into /tmp/CTLFireability12439602521425985276.gal : 6 ms
[2022-06-11 06:23:00] [INFO ] Time to serialize properties into /tmp/CTLFireability8569239640828064152.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12439602521425985276.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8569239640828064152.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.70759e+08,2.47351,77664,2,15353,5,153828,6,0,1119,175686,0


Converting to forward existential form...Done !
original formula: EF((AF(EG(((s1>=1)&&(l3908>=1)))) * E(AX(((s1>=1)&&(l3932>=1))) U ((s1>=1)&&(l3933>=1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(EG(!(EG(((s1>=1)&&(l3908>=1))))))),!(EX(!(((s1>=1)&&(l3932>=1)))))) * ((s1>=1)&&(l39...173
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t21, t22, t23, t24, t25, t26, t27, t28, t29, t38, t39, t40, t41, t42,...902
(forward)formula 0,0,24.8497,607456,1,0,630,2.15303e+06,651,236,8023,1.81824e+06,815
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 1764/1764 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 346 transition count 787
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 346 transition count 787
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 115 place count 346 transition count 758
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 149 place count 312 transition count 724
Iterating global reduction 1 with 34 rules applied. Total rules applied 183 place count 312 transition count 724
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 209 place count 312 transition count 698
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 304 place count 217 transition count 603
Iterating global reduction 2 with 95 rules applied. Total rules applied 399 place count 217 transition count 603
Ensure Unique test removed 164 transitions
Reduce isomorphic transitions removed 164 transitions.
Iterating post reduction 2 with 164 rules applied. Total rules applied 563 place count 217 transition count 439
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 564 place count 216 transition count 438
Iterating global reduction 3 with 1 rules applied. Total rules applied 565 place count 216 transition count 438
Applied a total of 565 rules in 17 ms. Remains 216 /389 variables (removed 173) and now considering 438/1764 (removed 1326) transitions.
// Phase 1: matrix 438 rows 216 cols
[2022-06-11 06:23:25] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:23:25] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 438 rows 216 cols
[2022-06-11 06:23:25] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:23:25] [INFO ] State equation strengthened by 239 read => feed constraints.
[2022-06-11 06:23:26] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 921 ms to find 0 implicit places.
// Phase 1: matrix 438 rows 216 cols
[2022-06-11 06:23:26] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:23:26] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 216/389 places, 438/1764 transitions.
Finished structural reductions, in 1 iterations. Remains : 216/389 places, 438/1764 transitions.
[2022-06-11 06:23:26] [INFO ] Flatten gal took : 9 ms
[2022-06-11 06:23:26] [INFO ] Flatten gal took : 10 ms
[2022-06-11 06:23:26] [INFO ] Input system was already deterministic with 438 transitions.
[2022-06-11 06:23:26] [INFO ] Flatten gal took : 11 ms
[2022-06-11 06:23:26] [INFO ] Flatten gal took : 19 ms
[2022-06-11 06:23:26] [INFO ] Time to serialize gal into /tmp/CTLFireability1355394196769040841.gal : 1 ms
[2022-06-11 06:23:26] [INFO ] Time to serialize properties into /tmp/CTLFireability17562636847099102499.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1355394196769040841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17562636847099102499.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-06-11 06:23:56] [INFO ] Flatten gal took : 15 ms
[2022-06-11 06:23:56] [INFO ] Applying decomposition
[2022-06-11 06:23:56] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15151403795971539903.txt' '-o' '/tmp/graph15151403795971539903.bin' '-w' '/tmp/graph15151403795971539903.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15151403795971539903.bin' '-l' '-1' '-v' '-w' '/tmp/graph15151403795971539903.weights' '-q' '0' '-e' '0.001'
[2022-06-11 06:23:56] [INFO ] Decomposing Gal with order
[2022-06-11 06:23:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 06:23:56] [INFO ] Removed a total of 470 redundant transitions.
[2022-06-11 06:23:56] [INFO ] Flatten gal took : 29 ms
[2022-06-11 06:23:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 311 labels/synchronizations in 10 ms.
[2022-06-11 06:23:56] [INFO ] Time to serialize gal into /tmp/CTLFireability6719245024095584796.gal : 3 ms
[2022-06-11 06:23:56] [INFO ] Time to serialize properties into /tmp/CTLFireability17639184794332930641.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6719245024095584796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17639184794332930641.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
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,2.1898e+08,13.4879,318560,2663,2774,178885,63968,842,2.26653e+06,353,1.43324e+06,0


Converting to forward existential form...Done !
original formula: E(!(((((i0.u0.s1>=1)&&(i0.u0.l3912>=1)) + EX(AX(((i0.u0.s1>=1)&&(i0.u0.l3927>=1))))) + (AG(!(AG(((i0.u0.s1>=1)&&(i0.u0.l3927>=1))))) + !(...359
=> equivalent forward existential formula: ([FwdG(FwdU(Init,!(((((i0.u0.s1>=1)&&(i0.u0.l3912>=1)) + EX(!(EX(!(((i0.u0.s1>=1)&&(i0.u0.l3927>=1))))))) + (!(E...738
Reverse transition relation is NOT exact ! Due to transitions t0, t79, t82, t85, t88, t182, t187, t190, t191, t192, t193, t194, t351, t352, t353, t354, t35...1507
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 389/389 places, 1764/1764 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 341 transition count 587
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 341 transition count 587
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 107 place count 341 transition count 576
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 146 place count 302 transition count 537
Iterating global reduction 1 with 39 rules applied. Total rules applied 185 place count 302 transition count 537
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 198 place count 302 transition count 524
Discarding 115 places :
Symmetric choice reduction at 2 with 115 rule applications. Total rules 313 place count 187 transition count 409
Iterating global reduction 2 with 115 rules applied. Total rules applied 428 place count 187 transition count 409
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 2 with 108 rules applied. Total rules applied 536 place count 187 transition count 301
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 539 place count 184 transition count 274
Iterating global reduction 3 with 3 rules applied. Total rules applied 542 place count 184 transition count 274
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 543 place count 183 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 544 place count 183 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 545 place count 183 transition count 272
Applied a total of 545 rules in 38 ms. Remains 183 /389 variables (removed 206) and now considering 272/1764 (removed 1492) transitions.
// Phase 1: matrix 272 rows 183 cols
[2022-06-11 06:24:26] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:24:26] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 272 rows 183 cols
[2022-06-11 06:24:26] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:24:26] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-06-11 06:24:27] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2022-06-11 06:24:27] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 272 rows 183 cols
[2022-06-11 06:24:27] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:24:27] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 183/389 places, 272/1764 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/389 places, 272/1764 transitions.
[2022-06-11 06:24:27] [INFO ] Flatten gal took : 6 ms
[2022-06-11 06:24:27] [INFO ] Flatten gal took : 7 ms
[2022-06-11 06:24:27] [INFO ] Input system was already deterministic with 272 transitions.
Finished random walk after 685 steps, including 132 resets, run visited all 1 properties in 3 ms. (steps per millisecond=228 )
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 1764/1764 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 347 transition count 669
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 347 transition count 669
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 102 place count 347 transition count 651
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 136 place count 313 transition count 617
Iterating global reduction 1 with 34 rules applied. Total rules applied 170 place count 313 transition count 617
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 180 place count 313 transition count 607
Discarding 107 places :
Symmetric choice reduction at 2 with 107 rule applications. Total rules 287 place count 206 transition count 500
Iterating global reduction 2 with 107 rules applied. Total rules applied 394 place count 206 transition count 500
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 526 place count 206 transition count 368
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 527 place count 205 transition count 367
Iterating global reduction 3 with 1 rules applied. Total rules applied 528 place count 205 transition count 367
Applied a total of 528 rules in 24 ms. Remains 205 /389 variables (removed 184) and now considering 367/1764 (removed 1397) transitions.
// Phase 1: matrix 367 rows 205 cols
[2022-06-11 06:24:27] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:24:27] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 367 rows 205 cols
[2022-06-11 06:24:27] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:24:27] [INFO ] State equation strengthened by 177 read => feed constraints.
[2022-06-11 06:24:28] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
// Phase 1: matrix 367 rows 205 cols
[2022-06-11 06:24:28] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-11 06:24:28] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/389 places, 367/1764 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/389 places, 367/1764 transitions.
[2022-06-11 06:24:28] [INFO ] Flatten gal took : 8 ms
[2022-06-11 06:24:28] [INFO ] Flatten gal took : 11 ms
[2022-06-11 06:24:28] [INFO ] Input system was already deterministic with 367 transitions.
[2022-06-11 06:24:28] [INFO ] Flatten gal took : 9 ms
[2022-06-11 06:24:28] [INFO ] Flatten gal took : 9 ms
[2022-06-11 06:24:28] [INFO ] Time to serialize gal into /tmp/CTLFireability5099014619017091886.gal : 1 ms
[2022-06-11 06:24:28] [INFO ] Time to serialize properties into /tmp/CTLFireability3777295498339956038.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5099014619017091886.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3777295498339956038.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,2.98164e+08,3.8534,119832,2,16914,5,216924,6,0,1187,253539,0


Converting to forward existential form...Done !
original formula: (AF(((AX(!(E(((p885>=1)&&(l0>=1)) U ((s1>=1)&&(l3916>=1))))) * AG((((s1<1)||(l3935<1))&&((s1<1)||(l5562<1))))) * ((p240>=1)&&(l0>=1)))) +...212
=> equivalent forward existential formula: ([(FwdU(EY(EY((Init * !(!(EG(!(((!(EX(!(!(E(((p885>=1)&&(l0>=1)) U ((s1>=1)&&(l3916>=1))))))) * !(E(TRUE U !((((...541
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t30, ...1109
Detected timeout of ITS tools.
[2022-06-11 06:24:58] [INFO ] Flatten gal took : 10 ms
[2022-06-11 06:24:58] [INFO ] Applying decomposition
[2022-06-11 06:24:58] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15785460512550371137.txt' '-o' '/tmp/graph15785460512550371137.bin' '-w' '/tmp/graph15785460512550371137.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15785460512550371137.bin' '-l' '-1' '-v' '-w' '/tmp/graph15785460512550371137.weights' '-q' '0' '-e' '0.001'
[2022-06-11 06:24:58] [INFO ] Decomposing Gal with order
[2022-06-11 06:24:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 06:24:58] [INFO ] Removed a total of 409 redundant transitions.
[2022-06-11 06:24:58] [INFO ] Flatten gal took : 20 ms
[2022-06-11 06:24:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 229 labels/synchronizations in 4 ms.
[2022-06-11 06:24:58] [INFO ] Time to serialize gal into /tmp/CTLFireability18215280119070908719.gal : 2 ms
[2022-06-11 06:24:58] [INFO ] Time to serialize properties into /tmp/CTLFireability15825519521602652620.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18215280119070908719.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15825519521602652620.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
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,2.98164e+08,4.22788,111000,3359,2560,117418,26072,705,455664,352,306917,0


Converting to forward existential form...Done !
original formula: (AF(((AX(!(E(((i0.u0.p885>=1)&&(i1.u1.l0>=1)) U ((i0.u0.s1>=1)&&(i0.u4.l3916>=1))))) * AG((((i0.u0.s1<1)||(i0.u0.l3935<1))&&((i0.u0.s1<1)...297
=> equivalent forward existential formula: ([(FwdU(EY(EY((Init * !(!(EG(!(((!(EX(!(!(E(((i0.u0.p885>=1)&&(i1.u1.l0>=1)) U ((i0.u0.s1>=1)&&(i0.u4.l3916>=1))...711
Reverse transition relation is NOT exact ! Due to transitions t1, t66, t69, t72, t75, t280, t281, t282, t283, t284, t285, t286, t287, t288, t289, t290, t29...1381
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 1764/1764 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 343 transition count 627
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 343 transition count 627
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 105 place count 343 transition count 614
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 143 place count 305 transition count 576
Iterating global reduction 1 with 38 rules applied. Total rules applied 181 place count 305 transition count 576
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 196 place count 305 transition count 561
Discarding 111 places :
Symmetric choice reduction at 2 with 111 rule applications. Total rules 307 place count 194 transition count 450
Iterating global reduction 2 with 111 rules applied. Total rules applied 418 place count 194 transition count 450
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 2 with 120 rules applied. Total rules applied 538 place count 194 transition count 330
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 540 place count 192 transition count 316
Iterating global reduction 3 with 2 rules applied. Total rules applied 542 place count 192 transition count 316
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 543 place count 191 transition count 315
Iterating global reduction 3 with 1 rules applied. Total rules applied 544 place count 191 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 545 place count 191 transition count 314
Applied a total of 545 rules in 20 ms. Remains 191 /389 variables (removed 198) and now considering 314/1764 (removed 1450) transitions.
// Phase 1: matrix 314 rows 191 cols
[2022-06-11 06:25:28] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:25:28] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 314 rows 191 cols
[2022-06-11 06:25:28] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:25:28] [INFO ] State equation strengthened by 135 read => feed constraints.
[2022-06-11 06:25:29] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
// Phase 1: matrix 314 rows 191 cols
[2022-06-11 06:25:29] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 06:25:29] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/389 places, 314/1764 transitions.
Finished structural reductions, in 1 iterations. Remains : 191/389 places, 314/1764 transitions.
[2022-06-11 06:25:29] [INFO ] Flatten gal took : 6 ms
[2022-06-11 06:25:29] [INFO ] Flatten gal took : 9 ms
[2022-06-11 06:25:29] [INFO ] Input system was already deterministic with 314 transitions.
[2022-06-11 06:25:29] [INFO ] Flatten gal took : 8 ms
[2022-06-11 06:25:29] [INFO ] Flatten gal took : 8 ms
[2022-06-11 06:25:29] [INFO ] Time to serialize gal into /tmp/CTLFireability4982990767896390945.gal : 1 ms
[2022-06-11 06:25:29] [INFO ] Time to serialize properties into /tmp/CTLFireability12880426733083683248.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4982990767896390945.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12880426733083683248.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.89894e+08,9.24685,231964,2,17296,5,608284,6,0,1078,717139,0


Converting to forward existential form...Done !
original formula: AG(AX(((AX(((s1<1)||(l2910<1))) + ((s1>=1)&&(l3934>=1))) + ((s1>=1)&&(l3924>=1)))))
=> equivalent forward existential formula: [(EY(((EY(FwdU(Init,TRUE)) * !(((s1>=1)&&(l3924>=1)))) * !(((s1>=1)&&(l3934>=1))))) * !(((s1<1)||(l2910<1))))] =...161
(forward)formula 0,0,9.83762,231964,1,0,16,608284,13,6,1948,717139,5
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 389/389 places, 1764/1764 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 340 transition count 543
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 340 transition count 543
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 107 place count 340 transition count 534
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 147 place count 300 transition count 494
Iterating global reduction 1 with 40 rules applied. Total rules applied 187 place count 300 transition count 494
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 195 place count 300 transition count 486
Discarding 119 places :
Symmetric choice reduction at 2 with 119 rule applications. Total rules 314 place count 181 transition count 367
Iterating global reduction 2 with 119 rules applied. Total rules applied 433 place count 181 transition count 367
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 525 place count 181 transition count 275
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 529 place count 177 transition count 235
Iterating global reduction 3 with 4 rules applied. Total rules applied 533 place count 177 transition count 235
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 535 place count 175 transition count 233
Iterating global reduction 3 with 2 rules applied. Total rules applied 537 place count 175 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 538 place count 175 transition count 232
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 542 place count 171 transition count 228
Iterating global reduction 4 with 4 rules applied. Total rules applied 546 place count 171 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 550 place count 171 transition count 224
Applied a total of 550 rules in 55 ms. Remains 171 /389 variables (removed 218) and now considering 224/1764 (removed 1540) transitions.
// Phase 1: matrix 224 rows 171 cols
[2022-06-11 06:25:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 06:25:39] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 224 rows 171 cols
[2022-06-11 06:25:39] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:25:39] [INFO ] State equation strengthened by 61 read => feed constraints.
[2022-06-11 06:25:39] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2022-06-11 06:25:39] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 224 rows 171 cols
[2022-06-11 06:25:39] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:25:40] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 171/389 places, 224/1764 transitions.
Finished structural reductions, in 1 iterations. Remains : 171/389 places, 224/1764 transitions.
[2022-06-11 06:25:40] [INFO ] Flatten gal took : 5 ms
[2022-06-11 06:25:40] [INFO ] Flatten gal took : 6 ms
[2022-06-11 06:25:40] [INFO ] Input system was already deterministic with 224 transitions.
[2022-06-11 06:25:40] [INFO ] Flatten gal took : 6 ms
[2022-06-11 06:25:40] [INFO ] Flatten gal took : 5 ms
[2022-06-11 06:25:40] [INFO ] Time to serialize gal into /tmp/CTLFireability6056365231980874673.gal : 1 ms
[2022-06-11 06:25:40] [INFO ] Time to serialize properties into /tmp/CTLFireability3214131442986222895.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6056365231980874673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3214131442986222895.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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.38611e+08,1.87646,65404,2,16617,5,147001,6,0,908,142829,0


Converting to forward existential form...Done !
original formula: AG(EF(((s1<1)||(l3798<1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((s1<1)||(l3798<1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t12, t13, t14, t15, t24, t27, t30, t33, t144, t145, t146, t147, t148, t149, t150, t1...476
(forward)formula 0,1,11.3491,303092,1,0,314,922926,423,129,6216,538967,412
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 1764/1764 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 343 transition count 627
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 343 transition count 627
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 105 place count 343 transition count 614
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 143 place count 305 transition count 576
Iterating global reduction 1 with 38 rules applied. Total rules applied 181 place count 305 transition count 576
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 196 place count 305 transition count 561
Discarding 111 places :
Symmetric choice reduction at 2 with 111 rule applications. Total rules 307 place count 194 transition count 450
Iterating global reduction 2 with 111 rules applied. Total rules applied 418 place count 194 transition count 450
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 546 place count 194 transition count 322
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 548 place count 192 transition count 308
Iterating global reduction 3 with 2 rules applied. Total rules applied 550 place count 192 transition count 308
Applied a total of 550 rules in 25 ms. Remains 192 /389 variables (removed 197) and now considering 308/1764 (removed 1456) transitions.
// Phase 1: matrix 308 rows 192 cols
[2022-06-11 06:25:51] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 06:25:51] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 308 rows 192 cols
[2022-06-11 06:25:51] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 06:25:51] [INFO ] State equation strengthened by 128 read => feed constraints.
[2022-06-11 06:25:52] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
// Phase 1: matrix 308 rows 192 cols
[2022-06-11 06:25:52] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-11 06:25:52] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/389 places, 308/1764 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/389 places, 308/1764 transitions.
[2022-06-11 06:25:52] [INFO ] Flatten gal took : 6 ms
[2022-06-11 06:25:52] [INFO ] Flatten gal took : 8 ms
[2022-06-11 06:25:52] [INFO ] Input system was already deterministic with 308 transitions.
[2022-06-11 06:25:52] [INFO ] Flatten gal took : 7 ms
[2022-06-11 06:25:52] [INFO ] Flatten gal took : 7 ms
[2022-06-11 06:25:52] [INFO ] Time to serialize gal into /tmp/CTLFireability15874784769955989014.gal : 1 ms
[2022-06-11 06:25:52] [INFO ] Time to serialize properties into /tmp/CTLFireability9181715870889760911.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15874784769955989014.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9181715870889760911.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.57747e+08,2.94596,94288,2,18019,5,201017,6,0,1076,202888,0


Converting to forward existential form...Done !
original formula: AG(((AX(((s1<1)||(l3421<1))) + EG(((s1<1)||(l3929<1)))) + EF(((s1>=1)&&(l3908>=1)))))
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !(E(TRUE U ((s1>=1)&&(l3908>=1))))) * !(EG(((s1<1)||(l3929<1)))))) * !(((s1<1)||(l3421<...169
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t38, t39, t40, t41, t42,...805
(forward)formula 0,1,29.7272,752044,1,0,627,2.97422e+06,600,236,7570,2.20695e+06,813
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2022-06-11 06:26:22] [INFO ] Flatten gal took : 39 ms
[2022-06-11 06:26:22] [INFO ] Flatten gal took : 39 ms
[2022-06-11 06:26:22] [INFO ] Applying decomposition
[2022-06-11 06:26:22] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14203759754103418367.txt' '-o' '/tmp/graph14203759754103418367.bin' '-w' '/tmp/graph14203759754103418367.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14203759754103418367.bin' '-l' '-1' '-v' '-w' '/tmp/graph14203759754103418367.weights' '-q' '0' '-e' '0.001'
[2022-06-11 06:26:22] [INFO ] Decomposing Gal with order
[2022-06-11 06:26:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 06:26:22] [INFO ] Removed a total of 1375 redundant transitions.
[2022-06-11 06:26:22] [INFO ] Flatten gal took : 296 ms
[2022-06-11 06:26:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 1304 labels/synchronizations in 26 ms.
[2022-06-11 06:26:22] [INFO ] Time to serialize gal into /tmp/CTLFireability17265958799867071510.gal : 4 ms
[2022-06-11 06:26:22] [INFO ] Time to serialize properties into /tmp/CTLFireability3377365014894249569.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17265958799867071510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3377365014894249569.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 5 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,6.23809e+08,119.379,3401228,14406,7290,6.54313e+06,696617,1103,1.50025e+07,1813,2.44434e+06,0


Converting to forward existential form...Done !
original formula: EG(((u0.s1<1)||(u6.l3911<1)))
=> equivalent forward existential formula: [FwdG(Init,((u0.s1<1)||(u6.l3911<1)))] != FALSE
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 an SCC at level 2
Fast SCC detection found an SCC at level 3
(forward)formula 0,1,187.108,3401228,1,0,6.54313e+06,728858,3349,1.5278e+07,7877,2.68159e+06,10444309
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(!(A(!(((u0.s1>=1)&&(u0.l3930>=1))) U (((A(((u0.s1>=1)&&(u6.l3926>=1)) U ((u0.s1>=1)&&(u0.l3922>=1))) + EX(((u0.s1>=1)&&(u6.l3925>=1)))...238
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!((((!((E(!(((u0.s1>=1)&&(u0.l3922>=1))) U (!(((u0.s1>=1)&&(u6.l3926>=1))) * !(((u0.s1>=1)&&(u...931
Reverse transition relation is NOT exact ! Due to transitions t81, t82, t83, t84, t85, t233, t236, t239, t254, t319, t408, t409, t410, t411, t412, t1615, t...6974
(forward)formula 1,1,305.55,3742036,1,0,7.10953e+06,922042,2873,1.74535e+07,4926,3.17806e+06,10302192
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX((!(A(!(((u0.s1>=1)&&(u6.l3925>=1))) U EG(((u0.s1>=1)&&(u6.l3919>=1))))) * ((EG((((u0.s1<1)||(u0.l2692<1))&&((u0.s1<1)||(u6.l3910<1))))...199
=> equivalent forward existential formula: (([FwdG((EY(Init) * !(!((E(!(EG(((u0.s1>=1)&&(u6.l3919>=1)))) U (!(!(((u0.s1>=1)&&(u6.l3925>=1)))) * !(EG(((u0.s...713
(forward)formula 2,1,334.193,3751804,1,0,7.10953e+06,922042,2941,1.82854e+07,4930,3.17806e+06,12087719
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(!(((((u0.s1>=1)&&(u6.l3912>=1)) + EX(AX(((u0.s1>=1)&&(u6.l3927>=1))))) + (AG(!(AG(((u0.s1>=1)&&(u6.l3927>=1))))) + !((AG(!(((u0.s1>=1)&...318
=> equivalent forward existential formula: ([FwdG(FwdU(Init,!(((((u0.s1>=1)&&(u6.l3912>=1)) + EX(!(EX(!(((u0.s1>=1)&&(u6.l3927>=1))))))) + (!(E(TRUE U !(!(...669
(forward)formula 3,1,342.636,3969340,1,0,7.46006e+06,922042,2977,1.93292e+07,4932,3.17806e+06,12399169
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AF(((AX(!(E(((u0.p885>=1)&&(i1.i0.u1.l0>=1)) U ((u0.s1>=1)&&(u0.l3916>=1))))) * AG((((u0.s1<1)||(u6.l3935<1))&&((u0.s1<1)||(i1.i1.u25.l5...279
=> equivalent forward existential formula: ([(FwdU(EY(EY((Init * !(!(EG(!(((!(EX(!(!(E(((u0.p885>=1)&&(i1.i0.u1.l0>=1)) U ((u0.s1>=1)&&(u0.l3916>=1))))))) ...681
(forward)formula 4,0,350.348,4108996,1,0,7.67752e+06,922042,3017,1.98361e+07,4936,3.17806e+06,12882764
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 902255 ms.

BK_STOP 1654929134278

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="RingSingleMessageInMbox-PT-d1m010"
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-4028"
echo " Executing tool itstools"
echo " Input is RingSingleMessageInMbox-PT-d1m010, 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 r312-tall-165472282700754"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m010.tgz
mv RingSingleMessageInMbox-PT-d1m010 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;