Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788800208.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldIIPt-PT-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788800208
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 20:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 20:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 860K May 18 16:43 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 ShieldIIPt-PT-050B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716957454385

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 04:37:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 04:37:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 04:37:36] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2024-05-29 04:37:36] [INFO ] Transformed 3503 places.
[2024-05-29 04:37:36] [INFO ] Transformed 3253 transitions.
[2024-05-29 04:37:36] [INFO ] Found NUPN structural information;
[2024-05-29 04:37:36] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 372 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPt-PT-050B-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 3503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Discarding 538 places :
Symmetric choice reduction at 0 with 538 rule applications. Total rules 538 place count 2965 transition count 2715
Iterating global reduction 0 with 538 rules applied. Total rules applied 1076 place count 2965 transition count 2715
Applied a total of 1076 rules in 620 ms. Remains 2965 /3503 variables (removed 538) and now considering 2715/3253 (removed 538) transitions.
// Phase 1: matrix 2715 rows 2965 cols
[2024-05-29 04:37:37] [INFO ] Computed 451 invariants in 43 ms
[2024-05-29 04:37:38] [INFO ] Implicit Places using invariants in 1169 ms returned []
[2024-05-29 04:37:38] [INFO ] Invariant cache hit.
[2024-05-29 04:37:41] [INFO ] Implicit Places using invariants and state equation in 2911 ms returned []
Implicit Place search using SMT with State Equation took 4110 ms to find 0 implicit places.
[2024-05-29 04:37:41] [INFO ] Invariant cache hit.
[2024-05-29 04:37:43] [INFO ] Dead Transitions using invariants and state equation in 1874 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2965/3503 places, 2715/3253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6606 ms. Remains : 2965/3503 places, 2715/3253 transitions.
Support contains 34 out of 2965 places after structural reductions.
[2024-05-29 04:37:43] [INFO ] Flatten gal took : 169 ms
[2024-05-29 04:37:43] [INFO ] Flatten gal took : 102 ms
[2024-05-29 04:37:44] [INFO ] Input system was already deterministic with 2715 transitions.
Support contains 33 out of 2965 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 27) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-29 04:37:44] [INFO ] Invariant cache hit.
[2024-05-29 04:37:45] [INFO ] [Real]Absence check using 451 positive place invariants in 183 ms returned sat
[2024-05-29 04:37:46] [INFO ] After 1558ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-29 04:37:47] [INFO ] [Nat]Absence check using 451 positive place invariants in 180 ms returned sat
[2024-05-29 04:37:50] [INFO ] After 2815ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-29 04:37:51] [INFO ] Deduced a trap composed of 17 places in 657 ms of which 6 ms to minimize.
[2024-05-29 04:37:52] [INFO ] Deduced a trap composed of 18 places in 643 ms of which 2 ms to minimize.
[2024-05-29 04:37:53] [INFO ] Deduced a trap composed of 31 places in 662 ms of which 3 ms to minimize.
[2024-05-29 04:37:53] [INFO ] Deduced a trap composed of 18 places in 629 ms of which 2 ms to minimize.
[2024-05-29 04:37:54] [INFO ] Deduced a trap composed of 22 places in 636 ms of which 4 ms to minimize.
[2024-05-29 04:37:55] [INFO ] Deduced a trap composed of 30 places in 644 ms of which 4 ms to minimize.
[2024-05-29 04:37:55] [INFO ] Deduced a trap composed of 28 places in 605 ms of which 5 ms to minimize.
[2024-05-29 04:37:56] [INFO ] Deduced a trap composed of 24 places in 593 ms of which 1 ms to minimize.
[2024-05-29 04:37:57] [INFO ] Deduced a trap composed of 20 places in 613 ms of which 1 ms to minimize.
[2024-05-29 04:37:57] [INFO ] Deduced a trap composed of 34 places in 589 ms of which 2 ms to minimize.
[2024-05-29 04:37:58] [INFO ] Deduced a trap composed of 19 places in 581 ms of which 4 ms to minimize.
[2024-05-29 04:37:59] [INFO ] Deduced a trap composed of 23 places in 560 ms of which 1 ms to minimize.
[2024-05-29 04:37:59] [INFO ] Deduced a trap composed of 30 places in 552 ms of which 2 ms to minimize.
[2024-05-29 04:38:00] [INFO ] Deduced a trap composed of 23 places in 546 ms of which 2 ms to minimize.
[2024-05-29 04:38:01] [INFO ] Deduced a trap composed of 29 places in 570 ms of which 1 ms to minimize.
[2024-05-29 04:38:01] [INFO ] Deduced a trap composed of 34 places in 552 ms of which 2 ms to minimize.
[2024-05-29 04:38:02] [INFO ] Deduced a trap composed of 33 places in 547 ms of which 1 ms to minimize.
[2024-05-29 04:38:03] [INFO ] Deduced a trap composed of 22 places in 540 ms of which 1 ms to minimize.
[2024-05-29 04:38:03] [INFO ] Deduced a trap composed of 36 places in 567 ms of which 1 ms to minimize.
[2024-05-29 04:38:04] [INFO ] Deduced a trap composed of 35 places in 519 ms of which 1 ms to minimize.
[2024-05-29 04:38:05] [INFO ] Deduced a trap composed of 39 places in 555 ms of which 2 ms to minimize.
[2024-05-29 04:38:05] [INFO ] Deduced a trap composed of 35 places in 512 ms of which 2 ms to minimize.
[2024-05-29 04:38:06] [INFO ] Deduced a trap composed of 37 places in 496 ms of which 1 ms to minimize.
[2024-05-29 04:38:06] [INFO ] Deduced a trap composed of 37 places in 497 ms of which 1 ms to minimize.
[2024-05-29 04:38:07] [INFO ] Deduced a trap composed of 28 places in 484 ms of which 1 ms to minimize.
[2024-05-29 04:38:07] [INFO ] Deduced a trap composed of 24 places in 456 ms of which 1 ms to minimize.
[2024-05-29 04:38:08] [INFO ] Deduced a trap composed of 42 places in 459 ms of which 2 ms to minimize.
[2024-05-29 04:38:09] [INFO ] Deduced a trap composed of 36 places in 447 ms of which 2 ms to minimize.
[2024-05-29 04:38:09] [INFO ] Deduced a trap composed of 39 places in 456 ms of which 1 ms to minimize.
[2024-05-29 04:38:10] [INFO ] Deduced a trap composed of 42 places in 428 ms of which 2 ms to minimize.
[2024-05-29 04:38:10] [INFO ] Deduced a trap composed of 45 places in 447 ms of which 2 ms to minimize.
[2024-05-29 04:38:11] [INFO ] Deduced a trap composed of 34 places in 412 ms of which 1 ms to minimize.
[2024-05-29 04:38:11] [INFO ] Deduced a trap composed of 37 places in 390 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 04:38:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 04:38:11] [INFO ] After 25354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 1487 ms.
Support contains 21 out of 2965 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2965/2965 places, 2715/2715 transitions.
Drop transitions removed 596 transitions
Trivial Post-agglo rules discarded 596 transitions
Performed 596 trivial Post agglomeration. Transition count delta: 596
Iterating post reduction 0 with 596 rules applied. Total rules applied 596 place count 2965 transition count 2119
Reduce places removed 596 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 597 rules applied. Total rules applied 1193 place count 2369 transition count 2118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1194 place count 2368 transition count 2118
Performed 389 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 389 Pre rules applied. Total rules applied 1194 place count 2368 transition count 1729
Deduced a syphon composed of 389 places in 4 ms
Reduce places removed 389 places and 0 transitions.
Iterating global reduction 3 with 778 rules applied. Total rules applied 1972 place count 1979 transition count 1729
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1976 place count 1975 transition count 1725
Iterating global reduction 3 with 4 rules applied. Total rules applied 1980 place count 1975 transition count 1725
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1980 place count 1975 transition count 1722
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1986 place count 1972 transition count 1722
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 3 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 3 with 1694 rules applied. Total rules applied 3680 place count 1125 transition count 875
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3681 place count 1125 transition count 874
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3683 place count 1124 transition count 873
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3885 place count 1023 transition count 938
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 44 places in 4 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 3973 place count 979 transition count 967
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3974 place count 979 transition count 966
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 3977 place count 979 transition count 963
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3980 place count 976 transition count 963
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 6 with 48 rules applied. Total rules applied 4028 place count 976 transition count 963
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4029 place count 975 transition count 962
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4031 place count 973 transition count 962
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4031 place count 973 transition count 961
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4033 place count 972 transition count 961
Applied a total of 4033 rules in 890 ms. Remains 972 /2965 variables (removed 1993) and now considering 961/2715 (removed 1754) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 891 ms. Remains : 972/2965 places, 961/2715 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 99489 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99489 steps, saw 64399 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 961 rows 972 cols
[2024-05-29 04:38:17] [INFO ] Computed 449 invariants in 7 ms
[2024-05-29 04:38:17] [INFO ] [Real]Absence check using 449 positive place invariants in 72 ms returned sat
[2024-05-29 04:38:17] [INFO ] After 499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-29 04:38:18] [INFO ] [Nat]Absence check using 449 positive place invariants in 67 ms returned sat
[2024-05-29 04:38:19] [INFO ] After 859ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-29 04:38:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 04:38:19] [INFO ] After 510ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-29 04:38:20] [INFO ] After 1387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 540 ms.
[2024-05-29 04:38:21] [INFO ] After 3395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 221 ms.
Support contains 21 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 961/961 transitions.
Applied a total of 0 rules in 48 ms. Remains 972 /972 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 972/972 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 961/961 transitions.
Applied a total of 0 rules in 38 ms. Remains 972 /972 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-29 04:38:21] [INFO ] Invariant cache hit.
[2024-05-29 04:38:22] [INFO ] Implicit Places using invariants in 552 ms returned [961]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 555 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 971/972 places, 961/961 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 970 transition count 960
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 970 transition count 960
Applied a total of 2 rules in 44 ms. Remains 970 /971 variables (removed 1) and now considering 960/961 (removed 1) transitions.
// Phase 1: matrix 960 rows 970 cols
[2024-05-29 04:38:22] [INFO ] Computed 448 invariants in 8 ms
[2024-05-29 04:38:22] [INFO ] Implicit Places using invariants in 546 ms returned []
[2024-05-29 04:38:22] [INFO ] Invariant cache hit.
[2024-05-29 04:38:23] [INFO ] Implicit Places using invariants and state equation in 1174 ms returned []
Implicit Place search using SMT with State Equation took 1721 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 970/972 places, 960/961 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2360 ms. Remains : 970/972 places, 960/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 104967 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104967 steps, saw 66998 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 14 properties.
[2024-05-29 04:38:28] [INFO ] Invariant cache hit.
[2024-05-29 04:38:28] [INFO ] [Real]Absence check using 448 positive place invariants in 68 ms returned sat
[2024-05-29 04:38:28] [INFO ] After 500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-29 04:38:29] [INFO ] [Nat]Absence check using 448 positive place invariants in 71 ms returned sat
[2024-05-29 04:38:30] [INFO ] After 877ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-29 04:38:31] [INFO ] After 1677ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 462 ms.
[2024-05-29 04:38:31] [INFO ] After 2705ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 246 ms.
Support contains 20 out of 970 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 970/970 places, 960/960 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 969 transition count 959
Applied a total of 2 rules in 34 ms. Remains 969 /970 variables (removed 1) and now considering 959/960 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 969/970 places, 959/960 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 103475 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103475 steps, saw 65949 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 959 rows 969 cols
[2024-05-29 04:38:36] [INFO ] Computed 448 invariants in 9 ms
[2024-05-29 04:38:36] [INFO ] [Real]Absence check using 448 positive place invariants in 69 ms returned sat
[2024-05-29 04:38:36] [INFO ] After 495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-29 04:38:36] [INFO ] [Nat]Absence check using 448 positive place invariants in 66 ms returned sat
[2024-05-29 04:38:38] [INFO ] After 847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-29 04:38:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-29 04:38:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2024-05-29 04:38:38] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-29 04:38:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-05-29 04:38:38] [INFO ] After 1803ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 492 ms.
[2024-05-29 04:38:39] [INFO ] After 2857ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 349 ms.
Support contains 20 out of 969 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 969/969 places, 959/959 transitions.
Applied a total of 0 rules in 20 ms. Remains 969 /969 variables (removed 0) and now considering 959/959 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 969/969 places, 959/959 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 969/969 places, 959/959 transitions.
Applied a total of 0 rules in 20 ms. Remains 969 /969 variables (removed 0) and now considering 959/959 (removed 0) transitions.
[2024-05-29 04:38:39] [INFO ] Invariant cache hit.
[2024-05-29 04:38:40] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-29 04:38:40] [INFO ] Invariant cache hit.
[2024-05-29 04:38:41] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1635 ms to find 0 implicit places.
[2024-05-29 04:38:41] [INFO ] Redundant transitions in 56 ms returned []
[2024-05-29 04:38:41] [INFO ] Invariant cache hit.
[2024-05-29 04:38:42] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2231 ms. Remains : 969/969 places, 959/959 transitions.
Partial Free-agglomeration rule applied 102 times.
Drop transitions removed 102 transitions
Iterating global reduction 0 with 102 rules applied. Total rules applied 102 place count 969 transition count 959
Applied a total of 102 rules in 41 ms. Remains 969 /969 variables (removed 0) and now considering 959/959 (removed 0) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 959 rows 969 cols
[2024-05-29 04:38:42] [INFO ] Computed 448 invariants in 4 ms
[2024-05-29 04:38:42] [INFO ] [Real]Absence check using 448 positive place invariants in 63 ms returned sat
[2024-05-29 04:38:42] [INFO ] After 486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-29 04:38:42] [INFO ] [Nat]Absence check using 448 positive place invariants in 68 ms returned sat
[2024-05-29 04:38:43] [INFO ] After 795ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-29 04:38:43] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-29 04:38:44] [INFO ] After 631ms SMT Verify possible using 94 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2024-05-29 04:38:44] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 0 ms to minimize.
[2024-05-29 04:38:44] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2024-05-29 04:38:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 301 ms
[2024-05-29 04:38:45] [INFO ] After 1859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 651 ms.
[2024-05-29 04:38:46] [INFO ] After 3864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
FORMULA ShieldIIPt-PT-050B-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 803 stabilizing places and 803 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 2 out of 2965 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2965/2965 places, 2715/2715 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2954 transition count 2704
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2954 transition count 2704
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2953 transition count 2703
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2953 transition count 2703
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2952 transition count 2702
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2952 transition count 2702
Applied a total of 26 rules in 818 ms. Remains 2952 /2965 variables (removed 13) and now considering 2702/2715 (removed 13) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2024-05-29 04:38:47] [INFO ] Computed 451 invariants in 17 ms
[2024-05-29 04:38:48] [INFO ] Implicit Places using invariants in 1025 ms returned []
[2024-05-29 04:38:48] [INFO ] Invariant cache hit.
[2024-05-29 04:38:51] [INFO ] Implicit Places using invariants and state equation in 3196 ms returned []
Implicit Place search using SMT with State Equation took 4227 ms to find 0 implicit places.
[2024-05-29 04:38:51] [INFO ] Invariant cache hit.
[2024-05-29 04:38:53] [INFO ] Dead Transitions using invariants and state equation in 1981 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2952/2965 places, 2702/2715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7032 ms. Remains : 2952/2965 places, 2702/2715 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 262 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s2890 1), p0:(EQ s1598 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-00 finished in 7380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2965 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2965/2965 places, 2715/2715 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2953 transition count 2703
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2953 transition count 2703
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2952 transition count 2702
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2952 transition count 2702
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2951 transition count 2701
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2951 transition count 2701
Applied a total of 28 rules in 818 ms. Remains 2951 /2965 variables (removed 14) and now considering 2701/2715 (removed 14) transitions.
// Phase 1: matrix 2701 rows 2951 cols
[2024-05-29 04:38:54] [INFO ] Computed 451 invariants in 15 ms
[2024-05-29 04:38:55] [INFO ] Implicit Places using invariants in 1008 ms returned []
[2024-05-29 04:38:55] [INFO ] Invariant cache hit.
[2024-05-29 04:38:58] [INFO ] Implicit Places using invariants and state equation in 3059 ms returned []
Implicit Place search using SMT with State Equation took 4068 ms to find 0 implicit places.
[2024-05-29 04:38:58] [INFO ] Invariant cache hit.
[2024-05-29 04:39:00] [INFO ] Dead Transitions using invariants and state equation in 2000 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2965 places, 2701/2715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6887 ms. Remains : 2951/2965 places, 2701/2715 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s2668 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 114 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-01 finished in 7015 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(G(p0)) U p1))'
Support contains 4 out of 2965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2965/2965 places, 2715/2715 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 607 transitions
Trivial Post-agglo rules discarded 607 transitions
Performed 607 trivial Post agglomeration. Transition count delta: 607
Iterating post reduction 0 with 607 rules applied. Total rules applied 607 place count 2964 transition count 2107
Reduce places removed 607 places and 0 transitions.
Iterating post reduction 1 with 607 rules applied. Total rules applied 1214 place count 2357 transition count 2107
Performed 391 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 391 Pre rules applied. Total rules applied 1214 place count 2357 transition count 1716
Deduced a syphon composed of 391 places in 3 ms
Reduce places removed 391 places and 0 transitions.
Iterating global reduction 2 with 782 rules applied. Total rules applied 1996 place count 1966 transition count 1716
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2002 place count 1960 transition count 1710
Iterating global reduction 2 with 6 rules applied. Total rules applied 2008 place count 1960 transition count 1710
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2008 place count 1960 transition count 1705
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 2018 place count 1955 transition count 1705
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 1 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 2 with 1694 rules applied. Total rules applied 3712 place count 1108 transition count 858
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3713 place count 1108 transition count 857
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3715 place count 1107 transition count 856
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3917 place count 1006 transition count 922
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4013 place count 958 transition count 955
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4015 place count 956 transition count 953
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4017 place count 954 transition count 953
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4017 place count 954 transition count 952
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4019 place count 953 transition count 952
Applied a total of 4019 rules in 529 ms. Remains 953 /2965 variables (removed 2012) and now considering 952/2715 (removed 1763) transitions.
// Phase 1: matrix 952 rows 953 cols
[2024-05-29 04:39:01] [INFO ] Computed 449 invariants in 6 ms
[2024-05-29 04:39:02] [INFO ] Implicit Places using invariants in 528 ms returned [942]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 530 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 952/2965 places, 952/2715 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 951 transition count 951
Applied a total of 2 rules in 48 ms. Remains 951 /952 variables (removed 1) and now considering 951/952 (removed 1) transitions.
// Phase 1: matrix 951 rows 951 cols
[2024-05-29 04:39:02] [INFO ] Computed 448 invariants in 4 ms
[2024-05-29 04:39:02] [INFO ] Implicit Places using invariants in 522 ms returned []
[2024-05-29 04:39:02] [INFO ] Invariant cache hit.
[2024-05-29 04:39:03] [INFO ] State equation strengthened by 314 read => feed constraints.
[2024-05-29 04:39:07] [INFO ] Implicit Places using invariants and state equation in 4400 ms returned []
Implicit Place search using SMT with State Equation took 4926 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 951/2965 places, 951/2715 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6035 ms. Remains : 951/2965 places, 951/2715 transitions.
Stuttering acceptance computed with spot in 135 ms :[p0, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1 1), p1:(OR (EQ s478 1) (AND (EQ s14 1) (EQ s41 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-02 finished in 6209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2965 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2965/2965 places, 2715/2715 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2953 transition count 2703
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2953 transition count 2703
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2952 transition count 2702
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2952 transition count 2702
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2951 transition count 2701
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2951 transition count 2701
Applied a total of 28 rules in 801 ms. Remains 2951 /2965 variables (removed 14) and now considering 2701/2715 (removed 14) transitions.
// Phase 1: matrix 2701 rows 2951 cols
[2024-05-29 04:39:08] [INFO ] Computed 451 invariants in 18 ms
[2024-05-29 04:39:09] [INFO ] Implicit Places using invariants in 1031 ms returned []
[2024-05-29 04:39:09] [INFO ] Invariant cache hit.
[2024-05-29 04:39:12] [INFO ] Implicit Places using invariants and state equation in 3048 ms returned []
Implicit Place search using SMT with State Equation took 4081 ms to find 0 implicit places.
[2024-05-29 04:39:12] [INFO ] Invariant cache hit.
[2024-05-29 04:39:14] [INFO ] Dead Transitions using invariants and state equation in 2023 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2965 places, 2701/2715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6908 ms. Remains : 2951/2965 places, 2701/2715 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s1582 1) (NEQ s1663 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1708 ms.
Product exploration explored 100000 steps with 50000 reset in 1633 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-050B-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-050B-LTLFireability-03 finished in 10419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2965/2965 places, 2715/2715 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 607 transitions
Trivial Post-agglo rules discarded 607 transitions
Performed 607 trivial Post agglomeration. Transition count delta: 607
Iterating post reduction 0 with 607 rules applied. Total rules applied 607 place count 2964 transition count 2107
Reduce places removed 607 places and 0 transitions.
Iterating post reduction 1 with 607 rules applied. Total rules applied 1214 place count 2357 transition count 2107
Performed 390 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 390 Pre rules applied. Total rules applied 1214 place count 2357 transition count 1717
Deduced a syphon composed of 390 places in 2 ms
Reduce places removed 390 places and 0 transitions.
Iterating global reduction 2 with 780 rules applied. Total rules applied 1994 place count 1967 transition count 1717
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2001 place count 1960 transition count 1710
Iterating global reduction 2 with 7 rules applied. Total rules applied 2008 place count 1960 transition count 1710
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2008 place count 1960 transition count 1704
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2020 place count 1954 transition count 1704
Performed 851 Post agglomeration using F-continuation condition.Transition count delta: 851
Deduced a syphon composed of 851 places in 1 ms
Reduce places removed 851 places and 0 transitions.
Iterating global reduction 2 with 1702 rules applied. Total rules applied 3722 place count 1103 transition count 853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3723 place count 1103 transition count 852
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3725 place count 1102 transition count 851
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3927 place count 1001 transition count 918
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4021 place count 954 transition count 949
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4023 place count 952 transition count 947
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4025 place count 950 transition count 947
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4025 place count 950 transition count 946
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4027 place count 949 transition count 946
Applied a total of 4027 rules in 509 ms. Remains 949 /2965 variables (removed 2016) and now considering 946/2715 (removed 1769) transitions.
// Phase 1: matrix 946 rows 949 cols
[2024-05-29 04:39:18] [INFO ] Computed 449 invariants in 5 ms
[2024-05-29 04:39:18] [INFO ] Implicit Places using invariants in 558 ms returned [938]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 560 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 948/2965 places, 946/2715 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 947 transition count 945
Applied a total of 2 rules in 32 ms. Remains 947 /948 variables (removed 1) and now considering 945/946 (removed 1) transitions.
// Phase 1: matrix 945 rows 947 cols
[2024-05-29 04:39:18] [INFO ] Computed 448 invariants in 4 ms
[2024-05-29 04:39:19] [INFO ] Implicit Places using invariants in 543 ms returned []
[2024-05-29 04:39:19] [INFO ] Invariant cache hit.
[2024-05-29 04:39:20] [INFO ] Implicit Places using invariants and state equation in 1112 ms returned []
Implicit Place search using SMT with State Equation took 1661 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/2965 places, 945/2715 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2764 ms. Remains : 947/2965 places, 945/2715 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s92 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 733 ms.
Product exploration explored 100000 steps with 0 reset in 984 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 231058 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 231058 steps, saw 143396 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:39:25] [INFO ] Invariant cache hit.
[2024-05-29 04:39:25] [INFO ] [Real]Absence check using 448 positive place invariants in 69 ms returned sat
[2024-05-29 04:39:26] [INFO ] After 584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:39:26] [INFO ] [Nat]Absence check using 448 positive place invariants in 63 ms returned sat
[2024-05-29 04:39:26] [INFO ] After 350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:39:26] [INFO ] After 404ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-29 04:39:26] [INFO ] After 623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 947 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 945/945 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 947 transition count 944
Applied a total of 1 rules in 26 ms. Remains 947 /947 variables (removed 0) and now considering 944/945 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 947/947 places, 944/945 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 227862 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 227862 steps, saw 140459 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 944 rows 947 cols
[2024-05-29 04:39:29] [INFO ] Computed 448 invariants in 4 ms
[2024-05-29 04:39:30] [INFO ] [Real]Absence check using 448 positive place invariants in 66 ms returned sat
[2024-05-29 04:39:30] [INFO ] After 355ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 04:39:30] [INFO ] After 417ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-29 04:39:30] [INFO ] After 652ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 947 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 944/944 transitions.
Applied a total of 0 rules in 18 ms. Remains 947 /947 variables (removed 0) and now considering 944/944 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 947/947 places, 944/944 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 944/944 transitions.
Applied a total of 0 rules in 18 ms. Remains 947 /947 variables (removed 0) and now considering 944/944 (removed 0) transitions.
[2024-05-29 04:39:30] [INFO ] Invariant cache hit.
[2024-05-29 04:39:31] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-05-29 04:39:31] [INFO ] Invariant cache hit.
[2024-05-29 04:39:32] [INFO ] Implicit Places using invariants and state equation in 1058 ms returned []
Implicit Place search using SMT with State Equation took 1605 ms to find 0 implicit places.
[2024-05-29 04:39:32] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-29 04:39:32] [INFO ] Invariant cache hit.
[2024-05-29 04:39:32] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2137 ms. Remains : 947/947 places, 944/944 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 947 transition count 944
Applied a total of 99 rules in 34 ms. Remains 947 /947 variables (removed 0) and now considering 944/944 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 944 rows 947 cols
[2024-05-29 04:39:32] [INFO ] Computed 448 invariants in 3 ms
[2024-05-29 04:39:32] [INFO ] [Real]Absence check using 448 positive place invariants in 65 ms returned sat
[2024-05-29 04:39:33] [INFO ] After 371ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 04:39:33] [INFO ] After 433ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-29 04:39:33] [INFO ] After 666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 1 out of 947 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 947/947 places, 945/945 transitions.
Applied a total of 0 rules in 22 ms. Remains 947 /947 variables (removed 0) and now considering 945/945 (removed 0) transitions.
// Phase 1: matrix 945 rows 947 cols
[2024-05-29 04:39:33] [INFO ] Computed 448 invariants in 6 ms
[2024-05-29 04:39:34] [INFO ] Implicit Places using invariants in 514 ms returned []
[2024-05-29 04:39:34] [INFO ] Invariant cache hit.
[2024-05-29 04:39:35] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned []
Implicit Place search using SMT with State Equation took 1607 ms to find 0 implicit places.
[2024-05-29 04:39:35] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-29 04:39:35] [INFO ] Invariant cache hit.
[2024-05-29 04:39:35] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2136 ms. Remains : 947/947 places, 945/945 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 230903 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 230903 steps, saw 143293 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:39:39] [INFO ] Invariant cache hit.
[2024-05-29 04:39:39] [INFO ] [Real]Absence check using 448 positive place invariants in 65 ms returned sat
[2024-05-29 04:39:39] [INFO ] After 570ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:39:39] [INFO ] [Nat]Absence check using 448 positive place invariants in 66 ms returned sat
[2024-05-29 04:39:40] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:39:40] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-29 04:39:40] [INFO ] After 661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 947 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 945/945 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 947 transition count 944
Applied a total of 1 rules in 20 ms. Remains 947 /947 variables (removed 0) and now considering 944/945 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 947/947 places, 944/945 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 232344 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 232344 steps, saw 143608 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 944 rows 947 cols
[2024-05-29 04:39:43] [INFO ] Computed 448 invariants in 5 ms
[2024-05-29 04:39:43] [INFO ] [Real]Absence check using 448 positive place invariants in 66 ms returned sat
[2024-05-29 04:39:43] [INFO ] After 359ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 04:39:44] [INFO ] After 411ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-29 04:39:44] [INFO ] After 645ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 947 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 944/944 transitions.
Applied a total of 0 rules in 17 ms. Remains 947 /947 variables (removed 0) and now considering 944/944 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 947/947 places, 944/944 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 944/944 transitions.
Applied a total of 0 rules in 16 ms. Remains 947 /947 variables (removed 0) and now considering 944/944 (removed 0) transitions.
[2024-05-29 04:39:44] [INFO ] Invariant cache hit.
[2024-05-29 04:39:44] [INFO ] Implicit Places using invariants in 549 ms returned []
[2024-05-29 04:39:44] [INFO ] Invariant cache hit.
[2024-05-29 04:39:45] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1596 ms to find 0 implicit places.
[2024-05-29 04:39:45] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-29 04:39:45] [INFO ] Invariant cache hit.
[2024-05-29 04:39:46] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2137 ms. Remains : 947/947 places, 944/944 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 947 transition count 944
Applied a total of 99 rules in 39 ms. Remains 947 /947 variables (removed 0) and now considering 944/944 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 944 rows 947 cols
[2024-05-29 04:39:46] [INFO ] Computed 448 invariants in 5 ms
[2024-05-29 04:39:46] [INFO ] [Real]Absence check using 448 positive place invariants in 67 ms returned sat
[2024-05-29 04:39:46] [INFO ] After 363ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 04:39:46] [INFO ] After 422ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-29 04:39:46] [INFO ] After 666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 724 ms.
Product exploration explored 100000 steps with 0 reset in 940 ms.
Built C files in :
/tmp/ltsmin13671203481926926254
[2024-05-29 04:39:48] [INFO ] Computing symmetric may disable matrix : 945 transitions.
[2024-05-29 04:39:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:39:48] [INFO ] Computing symmetric may enable matrix : 945 transitions.
[2024-05-29 04:39:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:39:48] [INFO ] Computing Do-Not-Accords matrix : 945 transitions.
[2024-05-29 04:39:49] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:39:49] [INFO ] Built C files in 203ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13671203481926926254
Running compilation step : cd /tmp/ltsmin13671203481926926254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2858 ms.
Running link step : cd /tmp/ltsmin13671203481926926254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin13671203481926926254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10780548782252828515.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 947 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 947/947 places, 945/945 transitions.
Applied a total of 0 rules in 23 ms. Remains 947 /947 variables (removed 0) and now considering 945/945 (removed 0) transitions.
// Phase 1: matrix 945 rows 947 cols
[2024-05-29 04:40:03] [INFO ] Computed 448 invariants in 3 ms
[2024-05-29 04:40:04] [INFO ] Implicit Places using invariants in 546 ms returned []
[2024-05-29 04:40:04] [INFO ] Invariant cache hit.
[2024-05-29 04:40:05] [INFO ] Implicit Places using invariants and state equation in 1124 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
[2024-05-29 04:40:05] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-29 04:40:05] [INFO ] Invariant cache hit.
[2024-05-29 04:40:06] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2226 ms. Remains : 947/947 places, 945/945 transitions.
Built C files in :
/tmp/ltsmin12804695949490052648
[2024-05-29 04:40:06] [INFO ] Computing symmetric may disable matrix : 945 transitions.
[2024-05-29 04:40:06] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:40:06] [INFO ] Computing symmetric may enable matrix : 945 transitions.
[2024-05-29 04:40:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:40:06] [INFO ] Computing Do-Not-Accords matrix : 945 transitions.
[2024-05-29 04:40:06] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:40:06] [INFO ] Built C files in 162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12804695949490052648
Running compilation step : cd /tmp/ltsmin12804695949490052648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2706 ms.
Running link step : cd /tmp/ltsmin12804695949490052648;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin12804695949490052648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11404286903094204539.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 04:40:21] [INFO ] Flatten gal took : 40 ms
[2024-05-29 04:40:21] [INFO ] Flatten gal took : 38 ms
[2024-05-29 04:40:21] [INFO ] Time to serialize gal into /tmp/LTL14134393834739601602.gal : 10 ms
[2024-05-29 04:40:21] [INFO ] Time to serialize properties into /tmp/LTL18181669108131802554.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14134393834739601602.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17112470041915181622.hoa' '-atoms' '/tmp/LTL18181669108131802554.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL18181669108131802554.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17112470041915181622.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 6.21554e+61 deadlock states
Detected timeout of ITS tools.
[2024-05-29 04:40:36] [INFO ] Flatten gal took : 30 ms
[2024-05-29 04:40:36] [INFO ] Flatten gal took : 29 ms
[2024-05-29 04:40:36] [INFO ] Time to serialize gal into /tmp/LTL14162850040110428462.gal : 6 ms
[2024-05-29 04:40:36] [INFO ] Time to serialize properties into /tmp/LTL16842014364529506780.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14162850040110428462.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16842014364529506780.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(p360!=1)"))))
Formula 0 simplified : GF!"(p360!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 6.21554e+61 deadlock states
Detected timeout of ITS tools.
[2024-05-29 04:40:51] [INFO ] Flatten gal took : 31 ms
[2024-05-29 04:40:51] [INFO ] Applying decomposition
[2024-05-29 04:40:51] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1593408659053352158.txt' '-o' '/tmp/graph1593408659053352158.bin' '-w' '/tmp/graph1593408659053352158.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1593408659053352158.bin' '-l' '-1' '-v' '-w' '/tmp/graph1593408659053352158.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:40:51] [INFO ] Decomposing Gal with order
[2024-05-29 04:40:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:40:51] [INFO ] Removed a total of 1070 redundant transitions.
[2024-05-29 04:40:51] [INFO ] Flatten gal took : 107 ms
[2024-05-29 04:40:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 456 labels/synchronizations in 26 ms.
[2024-05-29 04:40:51] [INFO ] Time to serialize gal into /tmp/LTL2008281455072539407.gal : 14 ms
[2024-05-29 04:40:52] [INFO ] Time to serialize properties into /tmp/LTL13666984913441958703.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2008281455072539407.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13666984913441958703.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(i2.u38.p360!=1)"))))
Formula 0 simplified : GF!"(i2.u38.p360!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 6.21554e+61 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
543 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.53024,261400,1,0,556192,425,2687,1.45044e+06,213,5100,306968
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050B-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPt-PT-050B-LTLFireability-04 finished in 101262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||(p1&&F(p2))) U X(p1)))'
Support contains 3 out of 2965 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2965/2965 places, 2715/2715 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2954 transition count 2704
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2954 transition count 2704
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2953 transition count 2703
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2953 transition count 2703
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2952 transition count 2702
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2952 transition count 2702
Applied a total of 26 rules in 806 ms. Remains 2952 /2965 variables (removed 13) and now considering 2702/2715 (removed 13) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2024-05-29 04:40:59] [INFO ] Computed 451 invariants in 15 ms
[2024-05-29 04:41:00] [INFO ] Implicit Places using invariants in 1077 ms returned []
[2024-05-29 04:41:00] [INFO ] Invariant cache hit.
[2024-05-29 04:41:03] [INFO ] Implicit Places using invariants and state equation in 3047 ms returned []
Implicit Place search using SMT with State Equation took 4132 ms to find 0 implicit places.
[2024-05-29 04:41:03] [INFO ] Invariant cache hit.
[2024-05-29 04:41:05] [INFO ] Dead Transitions using invariants and state equation in 2002 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2952/2965 places, 2702/2715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6942 ms. Remains : 2952/2965 places, 2702/2715 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s2746 1), p1:(EQ s908 1), p2:(EQ s2022 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17 reset in 705 ms.
Stack based approach found an accepted trace after 7308 steps with 39 reset with depth 2579 and stack size 2579 in 42 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-06 finished in 7999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2965/2965 places, 2715/2715 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 607 transitions
Trivial Post-agglo rules discarded 607 transitions
Performed 607 trivial Post agglomeration. Transition count delta: 607
Iterating post reduction 0 with 607 rules applied. Total rules applied 607 place count 2964 transition count 2107
Reduce places removed 607 places and 0 transitions.
Iterating post reduction 1 with 607 rules applied. Total rules applied 1214 place count 2357 transition count 2107
Performed 391 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 391 Pre rules applied. Total rules applied 1214 place count 2357 transition count 1716
Deduced a syphon composed of 391 places in 2 ms
Reduce places removed 391 places and 0 transitions.
Iterating global reduction 2 with 782 rules applied. Total rules applied 1996 place count 1966 transition count 1716
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2002 place count 1960 transition count 1710
Iterating global reduction 2 with 6 rules applied. Total rules applied 2008 place count 1960 transition count 1710
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2008 place count 1960 transition count 1705
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 2018 place count 1955 transition count 1705
Performed 851 Post agglomeration using F-continuation condition.Transition count delta: 851
Deduced a syphon composed of 851 places in 1 ms
Reduce places removed 851 places and 0 transitions.
Iterating global reduction 2 with 1702 rules applied. Total rules applied 3720 place count 1104 transition count 854
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3721 place count 1104 transition count 853
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3723 place count 1103 transition count 852
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3925 place count 1002 transition count 918
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4021 place count 954 transition count 951
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4023 place count 952 transition count 949
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4025 place count 950 transition count 949
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4025 place count 950 transition count 948
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4027 place count 949 transition count 948
Applied a total of 4027 rules in 454 ms. Remains 949 /2965 variables (removed 2016) and now considering 948/2715 (removed 1767) transitions.
// Phase 1: matrix 948 rows 949 cols
[2024-05-29 04:41:07] [INFO ] Computed 449 invariants in 4 ms
[2024-05-29 04:41:07] [INFO ] Implicit Places using invariants in 556 ms returned [938]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 559 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 948/2965 places, 948/2715 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 947 transition count 947
Applied a total of 2 rules in 31 ms. Remains 947 /948 variables (removed 1) and now considering 947/948 (removed 1) transitions.
// Phase 1: matrix 947 rows 947 cols
[2024-05-29 04:41:08] [INFO ] Computed 448 invariants in 4 ms
[2024-05-29 04:41:08] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-29 04:41:08] [INFO ] Invariant cache hit.
[2024-05-29 04:41:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 04:41:09] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1717 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/2965 places, 947/2715 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2763 ms. Remains : 947/2965 places, 947/2715 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s421 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 724 ms.
Product exploration explored 100000 steps with 0 reset in 965 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/947 stabilizing places and 2/947 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 211 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 1 out of 947 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 947/947 places, 947/947 transitions.
Applied a total of 0 rules in 21 ms. Remains 947 /947 variables (removed 0) and now considering 947/947 (removed 0) transitions.
[2024-05-29 04:41:12] [INFO ] Invariant cache hit.
[2024-05-29 04:41:12] [INFO ] Implicit Places using invariants in 546 ms returned []
[2024-05-29 04:41:12] [INFO ] Invariant cache hit.
[2024-05-29 04:41:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 04:41:13] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1741 ms to find 0 implicit places.
[2024-05-29 04:41:13] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-29 04:41:13] [INFO ] Invariant cache hit.
[2024-05-29 04:41:14] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2299 ms. Remains : 947/947 places, 947/947 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/947 stabilizing places and 2/947 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 174 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 698 ms.
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-07 finished in 8622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2965 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2965/2965 places, 2715/2715 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2953 transition count 2703
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2953 transition count 2703
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2952 transition count 2702
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2952 transition count 2702
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2951 transition count 2701
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2951 transition count 2701
Applied a total of 28 rules in 802 ms. Remains 2951 /2965 variables (removed 14) and now considering 2701/2715 (removed 14) transitions.
// Phase 1: matrix 2701 rows 2951 cols
[2024-05-29 04:41:16] [INFO ] Computed 451 invariants in 13 ms
[2024-05-29 04:41:17] [INFO ] Implicit Places using invariants in 1046 ms returned []
[2024-05-29 04:41:17] [INFO ] Invariant cache hit.
[2024-05-29 04:41:20] [INFO ] Implicit Places using invariants and state equation in 3024 ms returned []
Implicit Place search using SMT with State Equation took 4073 ms to find 0 implicit places.
[2024-05-29 04:41:20] [INFO ] Invariant cache hit.
[2024-05-29 04:41:22] [INFO ] Dead Transitions using invariants and state equation in 2028 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2965 places, 2701/2715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6907 ms. Remains : 2951/2965 places, 2701/2715 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s2526 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 5323 steps with 0 reset in 39 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-08 finished in 7079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p1)&&p0) U (F(p2) U p3)))'
Support contains 6 out of 2965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2965/2965 places, 2715/2715 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 602 transitions
Trivial Post-agglo rules discarded 602 transitions
Performed 602 trivial Post agglomeration. Transition count delta: 602
Iterating post reduction 0 with 602 rules applied. Total rules applied 602 place count 2964 transition count 2112
Reduce places removed 602 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 603 rules applied. Total rules applied 1205 place count 2362 transition count 2111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1206 place count 2361 transition count 2111
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 393 Pre rules applied. Total rules applied 1206 place count 2361 transition count 1718
Deduced a syphon composed of 393 places in 3 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 3 with 786 rules applied. Total rules applied 1992 place count 1968 transition count 1718
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1999 place count 1961 transition count 1711
Iterating global reduction 3 with 7 rules applied. Total rules applied 2006 place count 1961 transition count 1711
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 2006 place count 1961 transition count 1705
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 2018 place count 1955 transition count 1705
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 1 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 3 with 1692 rules applied. Total rules applied 3710 place count 1109 transition count 859
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3711 place count 1109 transition count 858
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3713 place count 1108 transition count 857
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3915 place count 1007 transition count 923
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 4009 place count 960 transition count 955
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4011 place count 958 transition count 953
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4013 place count 956 transition count 953
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4013 place count 956 transition count 952
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4015 place count 955 transition count 952
Applied a total of 4015 rules in 543 ms. Remains 955 /2965 variables (removed 2010) and now considering 952/2715 (removed 1763) transitions.
// Phase 1: matrix 952 rows 955 cols
[2024-05-29 04:41:23] [INFO ] Computed 449 invariants in 4 ms
[2024-05-29 04:41:23] [INFO ] Implicit Places using invariants in 564 ms returned [944]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 567 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 954/2965 places, 952/2715 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 953 transition count 951
Applied a total of 2 rules in 39 ms. Remains 953 /954 variables (removed 1) and now considering 951/952 (removed 1) transitions.
// Phase 1: matrix 951 rows 953 cols
[2024-05-29 04:41:23] [INFO ] Computed 448 invariants in 5 ms
[2024-05-29 04:41:24] [INFO ] Implicit Places using invariants in 542 ms returned []
[2024-05-29 04:41:24] [INFO ] Invariant cache hit.
[2024-05-29 04:41:24] [INFO ] State equation strengthened by 369 read => feed constraints.
[2024-05-29 04:41:29] [INFO ] Implicit Places using invariants and state equation in 5266 ms returned []
Implicit Place search using SMT with State Equation took 5810 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 953/2965 places, 951/2715 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6961 ms. Remains : 953/2965 places, 951/2715 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p0 p1), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p1))), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(EQ s839 1), p0:(AND (EQ s177 1) (EQ s189 1)), p1:(AND (OR (AND (EQ s654 1) (EQ s666 1)) (AND (EQ s177 1) (EQ s189 1))) (EQ s654 1) (EQ s666 1)), p2:(E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-09 finished in 7155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 2 out of 2965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2965/2965 places, 2715/2715 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 0 with 606 rules applied. Total rules applied 606 place count 2964 transition count 2108
Reduce places removed 606 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 607 rules applied. Total rules applied 1213 place count 2358 transition count 2107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1214 place count 2357 transition count 2107
Performed 391 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 391 Pre rules applied. Total rules applied 1214 place count 2357 transition count 1716
Deduced a syphon composed of 391 places in 3 ms
Reduce places removed 391 places and 0 transitions.
Iterating global reduction 3 with 782 rules applied. Total rules applied 1996 place count 1966 transition count 1716
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2003 place count 1959 transition count 1709
Iterating global reduction 3 with 7 rules applied. Total rules applied 2010 place count 1959 transition count 1709
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 2010 place count 1959 transition count 1703
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 2022 place count 1953 transition count 1703
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 1 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 3 with 1696 rules applied. Total rules applied 3718 place count 1105 transition count 855
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3719 place count 1105 transition count 854
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3721 place count 1104 transition count 853
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3923 place count 1003 transition count 919
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 4017 place count 956 transition count 950
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4019 place count 954 transition count 948
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4021 place count 952 transition count 948
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4021 place count 952 transition count 947
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4023 place count 951 transition count 947
Applied a total of 4023 rules in 491 ms. Remains 951 /2965 variables (removed 2014) and now considering 947/2715 (removed 1768) transitions.
// Phase 1: matrix 947 rows 951 cols
[2024-05-29 04:41:30] [INFO ] Computed 449 invariants in 5 ms
[2024-05-29 04:41:30] [INFO ] Implicit Places using invariants in 575 ms returned [940]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 576 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 950/2965 places, 947/2715 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 949 transition count 946
Applied a total of 2 rules in 32 ms. Remains 949 /950 variables (removed 1) and now considering 946/947 (removed 1) transitions.
// Phase 1: matrix 946 rows 949 cols
[2024-05-29 04:41:30] [INFO ] Computed 448 invariants in 4 ms
[2024-05-29 04:41:31] [INFO ] Implicit Places using invariants in 578 ms returned []
[2024-05-29 04:41:31] [INFO ] Invariant cache hit.
[2024-05-29 04:41:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:41:32] [INFO ] Implicit Places using invariants and state equation in 1153 ms returned []
Implicit Place search using SMT with State Equation took 1732 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 949/2965 places, 946/2715 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2834 ms. Remains : 949/2965 places, 946/2715 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s242 1), p0:(NEQ s934 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-10 finished in 2972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F((X((!p2 U (G(!p2)||(!p2&&G(p3)))))||p1)))))'
Support contains 5 out of 2965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2965/2965 places, 2715/2715 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 607 transitions
Trivial Post-agglo rules discarded 607 transitions
Performed 607 trivial Post agglomeration. Transition count delta: 607
Iterating post reduction 0 with 607 rules applied. Total rules applied 607 place count 2964 transition count 2107
Reduce places removed 607 places and 0 transitions.
Iterating post reduction 1 with 607 rules applied. Total rules applied 1214 place count 2357 transition count 2107
Performed 389 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 389 Pre rules applied. Total rules applied 1214 place count 2357 transition count 1718
Deduced a syphon composed of 389 places in 2 ms
Reduce places removed 389 places and 0 transitions.
Iterating global reduction 2 with 778 rules applied. Total rules applied 1992 place count 1968 transition count 1718
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1999 place count 1961 transition count 1711
Iterating global reduction 2 with 7 rules applied. Total rules applied 2006 place count 1961 transition count 1711
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2006 place count 1961 transition count 1705
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2018 place count 1955 transition count 1705
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 1 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 2 with 1698 rules applied. Total rules applied 3716 place count 1106 transition count 856
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3717 place count 1106 transition count 855
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3719 place count 1105 transition count 854
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3921 place count 1004 transition count 921
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4015 place count 957 transition count 952
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4017 place count 955 transition count 950
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4019 place count 953 transition count 950
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4019 place count 953 transition count 949
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4021 place count 952 transition count 949
Applied a total of 4021 rules in 462 ms. Remains 952 /2965 variables (removed 2013) and now considering 949/2715 (removed 1766) transitions.
// Phase 1: matrix 949 rows 952 cols
[2024-05-29 04:41:33] [INFO ] Computed 449 invariants in 4 ms
[2024-05-29 04:41:33] [INFO ] Implicit Places using invariants in 562 ms returned [941]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 563 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 951/2965 places, 949/2715 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 950 transition count 948
Applied a total of 2 rules in 33 ms. Remains 950 /951 variables (removed 1) and now considering 948/949 (removed 1) transitions.
// Phase 1: matrix 948 rows 950 cols
[2024-05-29 04:41:33] [INFO ] Computed 448 invariants in 4 ms
[2024-05-29 04:41:34] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-05-29 04:41:34] [INFO ] Invariant cache hit.
[2024-05-29 04:41:35] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 1702 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 950/2965 places, 948/2715 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2760 ms. Remains : 950/2965 places, 948/2715 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) (NOT p3) p2)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p3 p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s381 0), p1:(OR (EQ s124 0) (EQ s129 0) (EQ s136 0)), p3:(NEQ s463 1), p2:(AND (EQ s124 1) (EQ s129 1) (EQ s136 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 743 ms.
Product exploration explored 100000 steps with 0 reset in 910 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter insensitive) to 3 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 152426 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152426 steps, saw 95690 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-29 04:41:41] [INFO ] Invariant cache hit.
[2024-05-29 04:41:41] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 04:41:41] [INFO ] [Nat]Absence check using 448 positive place invariants in 67 ms returned sat
[2024-05-29 04:41:42] [INFO ] After 467ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-29 04:41:42] [INFO ] After 690ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 136 ms.
[2024-05-29 04:41:42] [INFO ] After 1137ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 80 ms.
Support contains 5 out of 950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 948/948 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 950 transition count 947
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 950 transition count 946
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 949 transition count 946
Applied a total of 3 rules in 35 ms. Remains 949 /950 variables (removed 1) and now considering 946/948 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 949/950 places, 946/948 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 158217 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 158217 steps, saw 99667 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 946 rows 949 cols
[2024-05-29 04:41:46] [INFO ] Computed 448 invariants in 4 ms
[2024-05-29 04:41:46] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:41:46] [INFO ] [Nat]Absence check using 448 positive place invariants in 72 ms returned sat
[2024-05-29 04:41:47] [INFO ] After 476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:41:47] [INFO ] After 723ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 143 ms.
[2024-05-29 04:41:47] [INFO ] After 1156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 85 ms.
Support contains 5 out of 949 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 946/946 transitions.
Applied a total of 0 rules in 16 ms. Remains 949 /949 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 949/949 places, 946/946 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 946/946 transitions.
Applied a total of 0 rules in 16 ms. Remains 949 /949 variables (removed 0) and now considering 946/946 (removed 0) transitions.
[2024-05-29 04:41:47] [INFO ] Invariant cache hit.
[2024-05-29 04:41:48] [INFO ] Implicit Places using invariants in 555 ms returned []
[2024-05-29 04:41:48] [INFO ] Invariant cache hit.
[2024-05-29 04:41:49] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned []
Implicit Place search using SMT with State Equation took 1685 ms to find 0 implicit places.
[2024-05-29 04:41:49] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-29 04:41:49] [INFO ] Invariant cache hit.
[2024-05-29 04:41:49] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2237 ms. Remains : 949/949 places, 946/946 transitions.
Partial Free-agglomeration rule applied 98 times.
Drop transitions removed 98 transitions
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 949 transition count 946
Applied a total of 98 rules in 34 ms. Remains 949 /949 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 946 rows 949 cols
[2024-05-29 04:41:49] [INFO ] Computed 448 invariants in 3 ms
[2024-05-29 04:41:49] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:41:50] [INFO ] [Nat]Absence check using 448 positive place invariants in 67 ms returned sat
[2024-05-29 04:41:50] [INFO ] After 471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:41:50] [INFO ] After 693ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 145 ms.
[2024-05-29 04:41:51] [INFO ] After 1117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (G (NOT (AND (NOT p1) (NOT p2) p3))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 86 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 950 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 950/950 places, 948/948 transitions.
Applied a total of 0 rules in 22 ms. Remains 950 /950 variables (removed 0) and now considering 948/948 (removed 0) transitions.
// Phase 1: matrix 948 rows 950 cols
[2024-05-29 04:41:51] [INFO ] Computed 448 invariants in 5 ms
[2024-05-29 04:41:51] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-05-29 04:41:51] [INFO ] Invariant cache hit.
[2024-05-29 04:41:53] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned []
Implicit Place search using SMT with State Equation took 1667 ms to find 0 implicit places.
[2024-05-29 04:41:53] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-29 04:41:53] [INFO ] Invariant cache hit.
[2024-05-29 04:41:53] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2226 ms. Remains : 950/950 places, 948/948 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 159878 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 159878 steps, saw 100703 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 04:41:57] [INFO ] Invariant cache hit.
[2024-05-29 04:41:57] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 04:41:57] [INFO ] [Nat]Absence check using 448 positive place invariants in 70 ms returned sat
[2024-05-29 04:41:57] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 04:41:57] [INFO ] After 512ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-29 04:41:58] [INFO ] After 831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 35 ms.
Support contains 4 out of 950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 948/948 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 950 transition count 947
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 949 transition count 946
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 949 transition count 945
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 948 transition count 945
Applied a total of 5 rules in 51 ms. Remains 948 /950 variables (removed 2) and now considering 945/948 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 948/950 places, 945/948 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 176085 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176085 steps, saw 111592 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 945 rows 948 cols
[2024-05-29 04:42:01] [INFO ] Computed 448 invariants in 1 ms
[2024-05-29 04:42:01] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 04:42:01] [INFO ] [Nat]Absence check using 448 positive place invariants in 67 ms returned sat
[2024-05-29 04:42:02] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 04:42:02] [INFO ] After 532ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-05-29 04:42:02] [INFO ] After 840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 36 ms.
Support contains 4 out of 948 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 945/945 transitions.
Applied a total of 0 rules in 16 ms. Remains 948 /948 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 948/948 places, 945/945 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 945/945 transitions.
Applied a total of 0 rules in 16 ms. Remains 948 /948 variables (removed 0) and now considering 945/945 (removed 0) transitions.
[2024-05-29 04:42:02] [INFO ] Invariant cache hit.
[2024-05-29 04:42:03] [INFO ] Implicit Places using invariants in 555 ms returned []
[2024-05-29 04:42:03] [INFO ] Invariant cache hit.
[2024-05-29 04:42:04] [INFO ] Implicit Places using invariants and state equation in 1104 ms returned []
Implicit Place search using SMT with State Equation took 1661 ms to find 0 implicit places.
[2024-05-29 04:42:04] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-29 04:42:04] [INFO ] Invariant cache hit.
[2024-05-29 04:42:04] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2186 ms. Remains : 948/948 places, 945/945 transitions.
Partial Free-agglomeration rule applied 98 times.
Drop transitions removed 98 transitions
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 948 transition count 945
Applied a total of 98 rules in 32 ms. Remains 948 /948 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 945 rows 948 cols
[2024-05-29 04:42:04] [INFO ] Computed 448 invariants in 4 ms
[2024-05-29 04:42:04] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 04:42:05] [INFO ] [Nat]Absence check using 448 positive place invariants in 70 ms returned sat
[2024-05-29 04:42:05] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 04:42:05] [INFO ] After 507ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-05-29 04:42:05] [INFO ] After 802ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 228 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 732 ms.
Product exploration explored 100000 steps with 0 reset in 925 ms.
Built C files in :
/tmp/ltsmin8103618010596188865
[2024-05-29 04:42:07] [INFO ] Computing symmetric may disable matrix : 948 transitions.
[2024-05-29 04:42:07] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:42:07] [INFO ] Computing symmetric may enable matrix : 948 transitions.
[2024-05-29 04:42:07] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:42:07] [INFO ] Computing Do-Not-Accords matrix : 948 transitions.
[2024-05-29 04:42:07] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:42:07] [INFO ] Built C files in 163ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8103618010596188865
Running compilation step : cd /tmp/ltsmin8103618010596188865;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2751 ms.
Running link step : cd /tmp/ltsmin8103618010596188865;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8103618010596188865;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12948954920521795179.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 950 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 950/950 places, 948/948 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 949 transition count 947
Applied a total of 2 rules in 31 ms. Remains 949 /950 variables (removed 1) and now considering 947/948 (removed 1) transitions.
// Phase 1: matrix 947 rows 949 cols
[2024-05-29 04:42:22] [INFO ] Computed 448 invariants in 3 ms
[2024-05-29 04:42:23] [INFO ] Implicit Places using invariants in 551 ms returned []
[2024-05-29 04:42:23] [INFO ] Invariant cache hit.
[2024-05-29 04:42:24] [INFO ] Implicit Places using invariants and state equation in 1112 ms returned []
Implicit Place search using SMT with State Equation took 1665 ms to find 0 implicit places.
[2024-05-29 04:42:24] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-29 04:42:24] [INFO ] Invariant cache hit.
[2024-05-29 04:42:24] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 949/950 places, 947/948 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2217 ms. Remains : 949/950 places, 947/948 transitions.
Built C files in :
/tmp/ltsmin11009849742708059667
[2024-05-29 04:42:24] [INFO ] Computing symmetric may disable matrix : 947 transitions.
[2024-05-29 04:42:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:42:24] [INFO ] Computing symmetric may enable matrix : 947 transitions.
[2024-05-29 04:42:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:42:25] [INFO ] Computing Do-Not-Accords matrix : 947 transitions.
[2024-05-29 04:42:25] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:42:25] [INFO ] Built C files in 148ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11009849742708059667
Running compilation step : cd /tmp/ltsmin11009849742708059667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2741 ms.
Running link step : cd /tmp/ltsmin11009849742708059667;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin11009849742708059667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3057188983134548236.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 04:42:40] [INFO ] Flatten gal took : 27 ms
[2024-05-29 04:42:40] [INFO ] Flatten gal took : 26 ms
[2024-05-29 04:42:41] [INFO ] Time to serialize gal into /tmp/LTL11067545089003583810.gal : 1126 ms
[2024-05-29 04:42:41] [INFO ] Time to serialize properties into /tmp/LTL1950672591044413956.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11067545089003583810.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6033693578475374681.hoa' '-atoms' '/tmp/LTL1950672591044413956.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1950672591044413956.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6033693578475374681.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 6.21554e+61 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1045 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.5604,327064,1,0,135,1.8931e+06,29,131,26278,1.64316e+06,338
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050B-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-050B-LTLFireability-11 finished in 80963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2965/2965 places, 2715/2715 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 607 transitions
Trivial Post-agglo rules discarded 607 transitions
Performed 607 trivial Post agglomeration. Transition count delta: 607
Iterating post reduction 0 with 607 rules applied. Total rules applied 607 place count 2964 transition count 2107
Reduce places removed 607 places and 0 transitions.
Iterating post reduction 1 with 607 rules applied. Total rules applied 1214 place count 2357 transition count 2107
Performed 391 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 391 Pre rules applied. Total rules applied 1214 place count 2357 transition count 1716
Deduced a syphon composed of 391 places in 3 ms
Reduce places removed 391 places and 0 transitions.
Iterating global reduction 2 with 782 rules applied. Total rules applied 1996 place count 1966 transition count 1716
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2003 place count 1959 transition count 1709
Iterating global reduction 2 with 7 rules applied. Total rules applied 2010 place count 1959 transition count 1709
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2010 place count 1959 transition count 1703
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2022 place count 1953 transition count 1703
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 1 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 2 with 1698 rules applied. Total rules applied 3720 place count 1104 transition count 854
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3721 place count 1104 transition count 853
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3723 place count 1103 transition count 852
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3925 place count 1002 transition count 918
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4021 place count 954 transition count 951
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 4022 place count 954 transition count 951
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4024 place count 952 transition count 949
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4026 place count 950 transition count 949
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4026 place count 950 transition count 948
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4028 place count 949 transition count 948
Applied a total of 4028 rules in 485 ms. Remains 949 /2965 variables (removed 2016) and now considering 948/2715 (removed 1767) transitions.
// Phase 1: matrix 948 rows 949 cols
[2024-05-29 04:42:54] [INFO ] Computed 449 invariants in 2 ms
[2024-05-29 04:42:54] [INFO ] Implicit Places using invariants in 546 ms returned [938]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 547 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 948/2965 places, 948/2715 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 947 transition count 947
Applied a total of 2 rules in 30 ms. Remains 947 /948 variables (removed 1) and now considering 947/948 (removed 1) transitions.
// Phase 1: matrix 947 rows 947 cols
[2024-05-29 04:42:54] [INFO ] Computed 448 invariants in 1 ms
[2024-05-29 04:42:55] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-05-29 04:42:55] [INFO ] Invariant cache hit.
[2024-05-29 04:42:56] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 1611 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/2965 places, 947/2715 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2673 ms. Remains : 947/2965 places, 947/2715 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s148 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-12 finished in 2778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2965/2965 places, 2715/2715 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 0 with 606 rules applied. Total rules applied 606 place count 2964 transition count 2108
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 1 with 606 rules applied. Total rules applied 1212 place count 2358 transition count 2108
Performed 392 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 392 Pre rules applied. Total rules applied 1212 place count 2358 transition count 1716
Deduced a syphon composed of 392 places in 3 ms
Reduce places removed 392 places and 0 transitions.
Iterating global reduction 2 with 784 rules applied. Total rules applied 1996 place count 1966 transition count 1716
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2002 place count 1960 transition count 1710
Iterating global reduction 2 with 6 rules applied. Total rules applied 2008 place count 1960 transition count 1710
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2008 place count 1960 transition count 1705
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 2018 place count 1955 transition count 1705
Performed 851 Post agglomeration using F-continuation condition.Transition count delta: 851
Deduced a syphon composed of 851 places in 1 ms
Reduce places removed 851 places and 0 transitions.
Iterating global reduction 2 with 1702 rules applied. Total rules applied 3720 place count 1104 transition count 854
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3721 place count 1104 transition count 853
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3723 place count 1103 transition count 852
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3925 place count 1002 transition count 918
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4021 place count 954 transition count 951
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4023 place count 952 transition count 949
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4025 place count 950 transition count 949
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4025 place count 950 transition count 948
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4027 place count 949 transition count 948
Applied a total of 4027 rules in 444 ms. Remains 949 /2965 variables (removed 2016) and now considering 948/2715 (removed 1767) transitions.
// Phase 1: matrix 948 rows 949 cols
[2024-05-29 04:42:56] [INFO ] Computed 449 invariants in 5 ms
[2024-05-29 04:42:57] [INFO ] Implicit Places using invariants in 547 ms returned [938]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 548 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 948/2965 places, 948/2715 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 947 transition count 947
Applied a total of 2 rules in 31 ms. Remains 947 /948 variables (removed 1) and now considering 947/948 (removed 1) transitions.
// Phase 1: matrix 947 rows 947 cols
[2024-05-29 04:42:57] [INFO ] Computed 448 invariants in 3 ms
[2024-05-29 04:42:58] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-05-29 04:42:58] [INFO ] Invariant cache hit.
[2024-05-29 04:42:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:42:59] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1578 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/2965 places, 947/2715 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2601 ms. Remains : 947/2965 places, 947/2715 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s609 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-13 finished in 2669 ms.
All properties solved by simple procedures.
Total runtime 322967 ms.

BK_STOP 1716957780499

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-050B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPt-PT-050B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683788800208"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-050B.tgz
mv ShieldIIPt-PT-050B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;