About the Execution of ITS-Tools for ShieldPPPs-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16217.300 | 3600000.00 | 11952772.00 | 162199.60 | TT?FFFFFFFTFF?FT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025300507.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPs-PT-050B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025300507
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.2K Apr 30 03:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 30 03:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 03:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 30 03:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 888K May 10 09:34 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 ShieldPPPs-PT-050B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-050B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-050B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-050B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-050B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-050B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-050B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-050B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-050B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-050B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-050B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-050B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-050B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-050B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-050B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-050B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653006774201
Running Version 202205111006
[2022-05-20 00:32:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 00:32:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 00:32:55] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2022-05-20 00:32:55] [INFO ] Transformed 3403 places.
[2022-05-20 00:32:55] [INFO ] Transformed 3153 transitions.
[2022-05-20 00:32:55] [INFO ] Found NUPN structural information;
[2022-05-20 00:32:55] [INFO ] Parsed PT model containing 3403 places and 3153 transitions in 452 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 3403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Discarding 345 places :
Symmetric choice reduction at 0 with 345 rule applications. Total rules 345 place count 3058 transition count 2808
Iterating global reduction 0 with 345 rules applied. Total rules applied 690 place count 3058 transition count 2808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 691 place count 3057 transition count 2807
Iterating global reduction 0 with 1 rules applied. Total rules applied 692 place count 3057 transition count 2807
Applied a total of 692 rules in 1150 ms. Remains 3057 /3403 variables (removed 346) and now considering 2807/3153 (removed 346) transitions.
// Phase 1: matrix 2807 rows 3057 cols
[2022-05-20 00:32:57] [INFO ] Computed 551 place invariants in 43 ms
[2022-05-20 00:32:58] [INFO ] Implicit Places using invariants in 1302 ms returned []
// Phase 1: matrix 2807 rows 3057 cols
[2022-05-20 00:32:58] [INFO ] Computed 551 place invariants in 14 ms
[2022-05-20 00:33:01] [INFO ] Implicit Places using invariants and state equation in 3343 ms returned []
Implicit Place search using SMT with State Equation took 4673 ms to find 0 implicit places.
// Phase 1: matrix 2807 rows 3057 cols
[2022-05-20 00:33:01] [INFO ] Computed 551 place invariants in 12 ms
[2022-05-20 00:33:03] [INFO ] Dead Transitions using invariants and state equation in 1977 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3057/3403 places, 2807/3153 transitions.
Finished structural reductions, in 1 iterations. Remains : 3057/3403 places, 2807/3153 transitions.
Support contains 37 out of 3057 places after structural reductions.
[2022-05-20 00:33:04] [INFO ] Flatten gal took : 207 ms
[2022-05-20 00:33:04] [INFO ] Flatten gal took : 134 ms
[2022-05-20 00:33:04] [INFO ] Input system was already deterministic with 2807 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 622 ms. (steps per millisecond=16 ) properties (out of 22) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2807 rows 3057 cols
[2022-05-20 00:33:05] [INFO ] Computed 551 place invariants in 10 ms
[2022-05-20 00:33:06] [INFO ] After 774ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-20 00:33:07] [INFO ] [Nat]Absence check using 551 positive place invariants in 202 ms returned sat
[2022-05-20 00:33:09] [INFO ] After 2036ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2022-05-20 00:33:10] [INFO ] Deduced a trap composed of 17 places in 949 ms of which 8 ms to minimize.
[2022-05-20 00:33:11] [INFO ] Deduced a trap composed of 17 places in 885 ms of which 3 ms to minimize.
[2022-05-20 00:33:12] [INFO ] Deduced a trap composed of 31 places in 864 ms of which 6 ms to minimize.
[2022-05-20 00:33:13] [INFO ] Deduced a trap composed of 27 places in 860 ms of which 3 ms to minimize.
[2022-05-20 00:33:14] [INFO ] Deduced a trap composed of 26 places in 829 ms of which 2 ms to minimize.
[2022-05-20 00:33:15] [INFO ] Deduced a trap composed of 22 places in 868 ms of which 2 ms to minimize.
[2022-05-20 00:33:16] [INFO ] Deduced a trap composed of 22 places in 846 ms of which 2 ms to minimize.
[2022-05-20 00:33:17] [INFO ] Deduced a trap composed of 27 places in 853 ms of which 2 ms to minimize.
[2022-05-20 00:33:18] [INFO ] Deduced a trap composed of 21 places in 830 ms of which 1 ms to minimize.
[2022-05-20 00:33:19] [INFO ] Deduced a trap composed of 20 places in 841 ms of which 2 ms to minimize.
[2022-05-20 00:33:20] [INFO ] Deduced a trap composed of 29 places in 808 ms of which 2 ms to minimize.
[2022-05-20 00:33:21] [INFO ] Deduced a trap composed of 24 places in 799 ms of which 1 ms to minimize.
[2022-05-20 00:33:22] [INFO ] Deduced a trap composed of 28 places in 822 ms of which 2 ms to minimize.
[2022-05-20 00:33:22] [INFO ] Deduced a trap composed of 30 places in 792 ms of which 2 ms to minimize.
[2022-05-20 00:33:23] [INFO ] Deduced a trap composed of 19 places in 803 ms of which 1 ms to minimize.
[2022-05-20 00:33:24] [INFO ] Deduced a trap composed of 23 places in 804 ms of which 2 ms to minimize.
[2022-05-20 00:33:25] [INFO ] Deduced a trap composed of 28 places in 799 ms of which 2 ms to minimize.
[2022-05-20 00:33:26] [INFO ] Deduced a trap composed of 34 places in 757 ms of which 1 ms to minimize.
[2022-05-20 00:33:27] [INFO ] Deduced a trap composed of 21 places in 734 ms of which 1 ms to minimize.
[2022-05-20 00:33:28] [INFO ] Deduced a trap composed of 29 places in 768 ms of which 2 ms to minimize.
[2022-05-20 00:33:29] [INFO ] Deduced a trap composed of 28 places in 727 ms of which 1 ms to minimize.
[2022-05-20 00:33:29] [INFO ] Deduced a trap composed of 29 places in 776 ms of which 2 ms to minimize.
[2022-05-20 00:33:30] [INFO ] Deduced a trap composed of 33 places in 755 ms of which 2 ms to minimize.
[2022-05-20 00:33:31] [INFO ] Deduced a trap composed of 43 places in 779 ms of which 2 ms to minimize.
[2022-05-20 00:33:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 00:33:31] [INFO ] After 25251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 722 ms.
Support contains 11 out of 3057 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3057/3057 places, 2807/2807 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3057 transition count 2457
Reduce places removed 350 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 351 rules applied. Total rules applied 701 place count 2707 transition count 2456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 702 place count 2706 transition count 2456
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 249 Pre rules applied. Total rules applied 702 place count 2706 transition count 2207
Deduced a syphon composed of 249 places in 9 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 3 with 498 rules applied. Total rules applied 1200 place count 2457 transition count 2207
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1202 place count 2455 transition count 2205
Iterating global reduction 3 with 2 rules applied. Total rules applied 1204 place count 2455 transition count 2205
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1204 place count 2455 transition count 2203
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1208 place count 2453 transition count 2203
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 5 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 3 with 1784 rules applied. Total rules applied 2992 place count 1561 transition count 1311
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 446 times.
Drop transitions removed 446 transitions
Iterating global reduction 3 with 446 rules applied. Total rules applied 3438 place count 1561 transition count 1311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3439 place count 1560 transition count 1310
Applied a total of 3439 rules in 912 ms. Remains 1560 /3057 variables (removed 1497) and now considering 1310/2807 (removed 1497) transitions.
Finished structural reductions, in 1 iterations. Remains : 1560/3057 places, 1310/2807 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1310 rows 1560 cols
[2022-05-20 00:33:34] [INFO ] Computed 551 place invariants in 103 ms
[2022-05-20 00:33:34] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 00:33:34] [INFO ] [Nat]Absence check using 522 positive place invariants in 91 ms returned sat
[2022-05-20 00:33:34] [INFO ] [Nat]Absence check using 522 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-20 00:33:35] [INFO ] After 789ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 00:33:35] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 1 ms to minimize.
[2022-05-20 00:33:35] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2022-05-20 00:33:36] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2022-05-20 00:33:36] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 0 ms to minimize.
[2022-05-20 00:33:36] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 0 ms to minimize.
[2022-05-20 00:33:36] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2022-05-20 00:33:37] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
[2022-05-20 00:33:37] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2022-05-20 00:33:37] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2022-05-20 00:33:37] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 4 ms to minimize.
[2022-05-20 00:33:37] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 0 ms to minimize.
[2022-05-20 00:33:38] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 0 ms to minimize.
[2022-05-20 00:33:38] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2022-05-20 00:33:38] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 0 ms to minimize.
[2022-05-20 00:33:38] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 1 ms to minimize.
[2022-05-20 00:33:38] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 1 ms to minimize.
[2022-05-20 00:33:39] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 0 ms to minimize.
[2022-05-20 00:33:39] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2022-05-20 00:33:39] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 0 ms to minimize.
[2022-05-20 00:33:39] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 1 ms to minimize.
[2022-05-20 00:33:39] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 0 ms to minimize.
[2022-05-20 00:33:40] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2022-05-20 00:33:40] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
[2022-05-20 00:33:40] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2022-05-20 00:33:40] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 1 ms to minimize.
[2022-05-20 00:33:40] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 1 ms to minimize.
[2022-05-20 00:33:41] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 1 ms to minimize.
[2022-05-20 00:33:41] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 0 ms to minimize.
[2022-05-20 00:33:41] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 0 ms to minimize.
[2022-05-20 00:33:41] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2022-05-20 00:33:41] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 0 ms to minimize.
[2022-05-20 00:33:42] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 1 ms to minimize.
[2022-05-20 00:33:42] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2022-05-20 00:33:42] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 0 ms to minimize.
[2022-05-20 00:33:42] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 0 ms to minimize.
[2022-05-20 00:33:42] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2022-05-20 00:33:43] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 1 ms to minimize.
[2022-05-20 00:33:43] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2022-05-20 00:33:43] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 1 ms to minimize.
[2022-05-20 00:33:43] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 1 ms to minimize.
[2022-05-20 00:33:43] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2022-05-20 00:33:44] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2022-05-20 00:33:44] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2022-05-20 00:33:44] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2022-05-20 00:33:44] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 0 ms to minimize.
[2022-05-20 00:33:44] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
[2022-05-20 00:33:45] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2022-05-20 00:33:45] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2022-05-20 00:33:45] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
[2022-05-20 00:33:45] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 1 ms to minimize.
[2022-05-20 00:33:45] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 1 ms to minimize.
[2022-05-20 00:33:45] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2022-05-20 00:33:46] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2022-05-20 00:33:46] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2022-05-20 00:33:46] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2022-05-20 00:33:46] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2022-05-20 00:33:46] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2022-05-20 00:33:47] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2022-05-20 00:33:47] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2022-05-20 00:33:47] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 1 ms to minimize.
[2022-05-20 00:33:47] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2022-05-20 00:33:47] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 1 ms to minimize.
[2022-05-20 00:33:48] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2022-05-20 00:33:48] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 1 ms to minimize.
[2022-05-20 00:33:48] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2022-05-20 00:33:48] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2022-05-20 00:33:48] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 0 ms to minimize.
[2022-05-20 00:33:48] [INFO ] Trap strengthening (SAT) tested/added 68/67 trap constraints in 13293 ms
[2022-05-20 00:33:48] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2022-05-20 00:33:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2022-05-20 00:33:49] [INFO ] After 14468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 176 ms.
[2022-05-20 00:33:49] [INFO ] After 15035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 106 ms.
Support contains 6 out of 1560 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1560/1560 places, 1310/1310 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1560 transition count 1309
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 1559 transition count 1309
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 1557 transition count 1307
Applied a total of 6 rules in 112 ms. Remains 1557 /1560 variables (removed 3) and now considering 1307/1310 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 1557/1560 places, 1307/1310 transitions.
Finished random walk after 9804 steps, including 2 resets, run visited all 3 properties in 166 ms. (steps per millisecond=59 )
FORMULA ShieldPPPs-PT-050B-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 602 stabilizing places and 602 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 3057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3057/3057 places, 2807/2807 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3052 transition count 2802
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3052 transition count 2802
Applied a total of 10 rules in 299 ms. Remains 3052 /3057 variables (removed 5) and now considering 2802/2807 (removed 5) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:33:50] [INFO ] Computed 551 place invariants in 10 ms
[2022-05-20 00:33:51] [INFO ] Implicit Places using invariants in 1066 ms returned []
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:33:51] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:33:54] [INFO ] Implicit Places using invariants and state equation in 3325 ms returned []
Implicit Place search using SMT with State Equation took 4393 ms to find 0 implicit places.
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:33:54] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 00:33:56] [INFO ] Dead Transitions using invariants and state equation in 1871 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3057 places, 2802/2807 transitions.
Finished structural reductions, in 1 iterations. Remains : 3052/3057 places, 2802/2807 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-01 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 (EQ s1898 0) (EQ s1380 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 1718 ms.
Product exploration explored 100000 steps with 50000 reset in 1644 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-01 finished in 10424 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(F((X(p0)||G(p0)))) U F(G(p0))))'
Support contains 2 out of 3057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3057/3057 places, 2807/2807 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3056 transition count 2455
Reduce places removed 351 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 352 rules applied. Total rules applied 703 place count 2705 transition count 2454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 704 place count 2704 transition count 2454
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 704 place count 2704 transition count 2204
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 1204 place count 2454 transition count 2204
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1209 place count 2449 transition count 2199
Iterating global reduction 3 with 5 rules applied. Total rules applied 1214 place count 2449 transition count 2199
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1214 place count 2449 transition count 2196
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1220 place count 2446 transition count 2196
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 2 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 3 with 1784 rules applied. Total rules applied 3004 place count 1554 transition count 1304
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3006 place count 1552 transition count 1302
Applied a total of 3006 rules in 552 ms. Remains 1552 /3057 variables (removed 1505) and now considering 1302/2807 (removed 1505) transitions.
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:34:00] [INFO ] Computed 551 place invariants in 13 ms
[2022-05-20 00:34:01] [INFO ] Implicit Places using invariants in 669 ms returned []
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:34:01] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:34:03] [INFO ] Implicit Places using invariants and state equation in 1552 ms returned []
Implicit Place search using SMT with State Equation took 2225 ms to find 0 implicit places.
[2022-05-20 00:34:03] [INFO ] Redundant transitions in 94 ms returned []
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:34:03] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:34:03] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1552/3057 places, 1302/2807 transitions.
Finished structural reductions, in 1 iterations. Remains : 1552/3057 places, 1302/2807 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s685 0) (EQ s390 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 30 reset in 1096 ms.
Product exploration explored 100000 steps with 30 reset in 1350 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 1552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 52 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:34:06] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:34:07] [INFO ] Implicit Places using invariants in 717 ms returned []
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:34:07] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:34:09] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 2237 ms to find 0 implicit places.
[2022-05-20 00:34:09] [INFO ] Redundant transitions in 64 ms returned []
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:34:09] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:34:09] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1552/1552 places, 1302/1302 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 29 reset in 1079 ms.
Product exploration explored 100000 steps with 30 reset in 1283 ms.
Built C files in :
/tmp/ltsmin14666471751936844413
[2022-05-20 00:34:12] [INFO ] Computing symmetric may disable matrix : 1302 transitions.
[2022-05-20 00:34:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:34:12] [INFO ] Computing symmetric may enable matrix : 1302 transitions.
[2022-05-20 00:34:12] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:34:12] [INFO ] Computing Do-Not-Accords matrix : 1302 transitions.
[2022-05-20 00:34:13] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:34:13] [INFO ] Built C files in 334ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14666471751936844413
Running compilation step : cd /tmp/ltsmin14666471751936844413;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14666471751936844413;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14666471751936844413;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 1552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 54 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:34:16] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:34:16] [INFO ] Implicit Places using invariants in 819 ms returned []
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:34:16] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:34:18] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 2350 ms to find 0 implicit places.
[2022-05-20 00:34:18] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:34:18] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:34:19] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1552/1552 places, 1302/1302 transitions.
Built C files in :
/tmp/ltsmin10810024298020572183
[2022-05-20 00:34:19] [INFO ] Computing symmetric may disable matrix : 1302 transitions.
[2022-05-20 00:34:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:34:19] [INFO ] Computing symmetric may enable matrix : 1302 transitions.
[2022-05-20 00:34:19] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:34:19] [INFO ] Computing Do-Not-Accords matrix : 1302 transitions.
[2022-05-20 00:34:19] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:34:19] [INFO ] Built C files in 180ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10810024298020572183
Running compilation step : cd /tmp/ltsmin10810024298020572183;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10810024298020572183;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10810024298020572183;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 00:34:22] [INFO ] Flatten gal took : 54 ms
[2022-05-20 00:34:22] [INFO ] Flatten gal took : 53 ms
[2022-05-20 00:34:22] [INFO ] Time to serialize gal into /tmp/LTL15619935052659625087.gal : 14 ms
[2022-05-20 00:34:22] [INFO ] Time to serialize properties into /tmp/LTL18063009755838664499.ltl : 69 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15619935052659625087.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18063009755838664499.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1561993...268
Read 1 LTL properties
Checking formula 0 : !(((!(G(F((X("((p1532==0)||(p888==1))"))||(G("((p1532==0)||(p888==1))"))))))U(F(G("((p1532==0)||(p888==1))")))))
Formula 0 simplified : !(!GF(X"((p1532==0)||(p888==1))" | G"((p1532==0)||(p888==1))") U FG"((p1532==0)||(p888==1))")
Detected timeout of ITS tools.
[2022-05-20 00:34:37] [INFO ] Flatten gal took : 47 ms
[2022-05-20 00:34:37] [INFO ] Applying decomposition
[2022-05-20 00:34:37] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16376697172911956720.txt' '-o' '/tmp/graph16376697172911956720.bin' '-w' '/tmp/graph16376697172911956720.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16376697172911956720.bin' '-l' '-1' '-v' '-w' '/tmp/graph16376697172911956720.weights' '-q' '0' '-e' '0.001'
[2022-05-20 00:34:38] [INFO ] Decomposing Gal with order
[2022-05-20 00:34:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:34:38] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 00:34:38] [INFO ] Flatten gal took : 141 ms
[2022-05-20 00:34:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 20 ms.
[2022-05-20 00:34:38] [INFO ] Time to serialize gal into /tmp/LTL12338661441715068733.gal : 14 ms
[2022-05-20 00:34:38] [INFO ] Time to serialize properties into /tmp/LTL12651752885892878322.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12338661441715068733.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12651752885892878322.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1233866...247
Read 1 LTL properties
Checking formula 0 : !(((!(G(F((X("((i22.u243.p1532==0)||(i12.u139.p888==1))"))||(G("((i22.u243.p1532==0)||(i12.u139.p888==1))"))))))U(F(G("((i22.u243.p153...187
Formula 0 simplified : !(!GF(X"((i22.u243.p1532==0)||(i12.u139.p888==1))" | G"((i22.u243.p1532==0)||(i12.u139.p888==1))") U FG"((i22.u243.p1532==0)||(i12.u...170
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13882560211697695166
[2022-05-20 00:34:53] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13882560211697695166
Running compilation step : cd /tmp/ltsmin13882560211697695166;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2386 ms.
Running link step : cd /tmp/ltsmin13882560211697695166;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin13882560211697695166;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '()||[]((LTLAPp0==true))))) U <>([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-02 finished in 68294 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(F(p0)))&&(X(G(p1))||F(p2))))))'
Support contains 2 out of 3057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3057/3057 places, 2807/2807 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3053 transition count 2803
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3053 transition count 2803
Applied a total of 8 rules in 310 ms. Remains 3053 /3057 variables (removed 4) and now considering 2803/2807 (removed 4) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:35:09] [INFO ] Computed 551 place invariants in 14 ms
[2022-05-20 00:35:10] [INFO ] Implicit Places using invariants in 1186 ms returned []
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:35:10] [INFO ] Computed 551 place invariants in 11 ms
[2022-05-20 00:35:13] [INFO ] Implicit Places using invariants and state equation in 3350 ms returned []
Implicit Place search using SMT with State Equation took 4538 ms to find 0 implicit places.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:35:13] [INFO ] Computed 551 place invariants in 12 ms
[2022-05-20 00:35:15] [INFO ] Dead Transitions using invariants and state equation in 2025 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3057 places, 2803/2807 transitions.
Finished structural reductions, in 1 iterations. Remains : 3053/3057 places, 2803/2807 transitions.
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s926 0), p2:(EQ s2310 1), p1:(EQ s926 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 26 reset in 967 ms.
Product exploration explored 100000 steps with 24 reset in 1193 ms.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), true, (X (X (NOT p2))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 7 states, 11 edges and 3 AP to 7 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:35:19] [INFO ] Computed 551 place invariants in 9 ms
[2022-05-20 00:35:19] [INFO ] [Real]Absence check using 551 positive place invariants in 198 ms returned sat
[2022-05-20 00:35:21] [INFO ] After 2082ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 00:35:21] [INFO ] [Nat]Absence check using 551 positive place invariants in 204 ms returned sat
[2022-05-20 00:35:23] [INFO ] After 1612ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 00:35:24] [INFO ] Deduced a trap composed of 25 places in 897 ms of which 2 ms to minimize.
[2022-05-20 00:35:25] [INFO ] Deduced a trap composed of 37 places in 897 ms of which 2 ms to minimize.
[2022-05-20 00:35:26] [INFO ] Deduced a trap composed of 28 places in 896 ms of which 2 ms to minimize.
[2022-05-20 00:35:27] [INFO ] Deduced a trap composed of 20 places in 865 ms of which 2 ms to minimize.
[2022-05-20 00:35:28] [INFO ] Deduced a trap composed of 30 places in 854 ms of which 2 ms to minimize.
[2022-05-20 00:35:29] [INFO ] Deduced a trap composed of 26 places in 833 ms of which 2 ms to minimize.
[2022-05-20 00:35:30] [INFO ] Deduced a trap composed of 20 places in 845 ms of which 2 ms to minimize.
[2022-05-20 00:35:31] [INFO ] Deduced a trap composed of 27 places in 862 ms of which 1 ms to minimize.
[2022-05-20 00:35:32] [INFO ] Deduced a trap composed of 36 places in 840 ms of which 2 ms to minimize.
[2022-05-20 00:35:33] [INFO ] Deduced a trap composed of 31 places in 850 ms of which 2 ms to minimize.
[2022-05-20 00:35:34] [INFO ] Deduced a trap composed of 19 places in 835 ms of which 2 ms to minimize.
[2022-05-20 00:35:35] [INFO ] Deduced a trap composed of 11 places in 871 ms of which 2 ms to minimize.
[2022-05-20 00:35:36] [INFO ] Deduced a trap composed of 17 places in 833 ms of which 4 ms to minimize.
[2022-05-20 00:35:36] [INFO ] Deduced a trap composed of 24 places in 797 ms of which 1 ms to minimize.
[2022-05-20 00:35:37] [INFO ] Deduced a trap composed of 25 places in 805 ms of which 2 ms to minimize.
[2022-05-20 00:35:38] [INFO ] Deduced a trap composed of 22 places in 792 ms of which 2 ms to minimize.
[2022-05-20 00:35:39] [INFO ] Deduced a trap composed of 28 places in 792 ms of which 4 ms to minimize.
[2022-05-20 00:35:40] [INFO ] Deduced a trap composed of 19 places in 782 ms of which 2 ms to minimize.
[2022-05-20 00:35:41] [INFO ] Deduced a trap composed of 27 places in 761 ms of which 1 ms to minimize.
[2022-05-20 00:35:42] [INFO ] Deduced a trap composed of 31 places in 774 ms of which 2 ms to minimize.
[2022-05-20 00:35:43] [INFO ] Deduced a trap composed of 33 places in 756 ms of which 2 ms to minimize.
[2022-05-20 00:35:44] [INFO ] Deduced a trap composed of 29 places in 755 ms of which 2 ms to minimize.
[2022-05-20 00:35:44] [INFO ] Deduced a trap composed of 34 places in 734 ms of which 1 ms to minimize.
[2022-05-20 00:35:45] [INFO ] Deduced a trap composed of 50 places in 746 ms of which 2 ms to minimize.
[2022-05-20 00:35:46] [INFO ] Deduced a trap composed of 35 places in 704 ms of which 2 ms to minimize.
[2022-05-20 00:35:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 00:35:46] [INFO ] After 25328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 110 ms.
Support contains 2 out of 3053 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 3053 transition count 2451
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 704 place count 2701 transition count 2451
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 704 place count 2701 transition count 2201
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1204 place count 2451 transition count 2201
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 2 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 3002 place count 1552 transition count 1302
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 446 times.
Drop transitions removed 446 transitions
Iterating global reduction 2 with 446 rules applied. Total rules applied 3448 place count 1552 transition count 1302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3449 place count 1551 transition count 1301
Applied a total of 3449 rules in 482 ms. Remains 1551 /3053 variables (removed 1502) and now considering 1301/2803 (removed 1502) transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/3053 places, 1301/2803 transitions.
Finished random walk after 2351 steps, including 0 resets, run visited all 2 properties in 48 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), true, (X (X (NOT p2))), (X (X p0))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 4 factoid took 255 ms. Reduced automaton from 7 states, 10 edges and 3 AP to 7 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:35:48] [INFO ] Computed 551 place invariants in 13 ms
[2022-05-20 00:35:51] [INFO ] [Real]Absence check using 551 positive place invariants in 1300 ms returned sat
[2022-05-20 00:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:36:03] [INFO ] [Real]Absence check using state equation in 11700 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 2 out of 3053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Applied a total of 0 rules in 173 ms. Remains 3053 /3053 variables (removed 0) and now considering 2803/2803 (removed 0) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:36:03] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 00:36:04] [INFO ] Implicit Places using invariants in 1137 ms returned []
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:36:04] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:36:07] [INFO ] Implicit Places using invariants and state equation in 3373 ms returned []
Implicit Place search using SMT with State Equation took 4512 ms to find 0 implicit places.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:36:07] [INFO ] Computed 551 place invariants in 10 ms
[2022-05-20 00:36:09] [INFO ] Dead Transitions using invariants and state equation in 1905 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3053/3053 places, 2803/2803 transitions.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 7 states, 10 edges and 3 AP to 7 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:36:10] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 00:36:10] [INFO ] [Real]Absence check using 551 positive place invariants in 204 ms returned sat
[2022-05-20 00:36:12] [INFO ] After 2083ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 00:36:12] [INFO ] [Nat]Absence check using 551 positive place invariants in 204 ms returned sat
[2022-05-20 00:36:14] [INFO ] After 1587ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 00:36:15] [INFO ] Deduced a trap composed of 25 places in 812 ms of which 1 ms to minimize.
[2022-05-20 00:36:16] [INFO ] Deduced a trap composed of 37 places in 889 ms of which 1 ms to minimize.
[2022-05-20 00:36:17] [INFO ] Deduced a trap composed of 28 places in 849 ms of which 2 ms to minimize.
[2022-05-20 00:36:18] [INFO ] Deduced a trap composed of 20 places in 835 ms of which 2 ms to minimize.
[2022-05-20 00:36:19] [INFO ] Deduced a trap composed of 30 places in 859 ms of which 2 ms to minimize.
[2022-05-20 00:36:20] [INFO ] Deduced a trap composed of 26 places in 819 ms of which 2 ms to minimize.
[2022-05-20 00:36:21] [INFO ] Deduced a trap composed of 20 places in 841 ms of which 1 ms to minimize.
[2022-05-20 00:36:22] [INFO ] Deduced a trap composed of 27 places in 819 ms of which 2 ms to minimize.
[2022-05-20 00:36:23] [INFO ] Deduced a trap composed of 36 places in 810 ms of which 1 ms to minimize.
[2022-05-20 00:36:24] [INFO ] Deduced a trap composed of 31 places in 811 ms of which 2 ms to minimize.
[2022-05-20 00:36:24] [INFO ] Deduced a trap composed of 19 places in 807 ms of which 2 ms to minimize.
[2022-05-20 00:36:25] [INFO ] Deduced a trap composed of 11 places in 818 ms of which 2 ms to minimize.
[2022-05-20 00:36:26] [INFO ] Deduced a trap composed of 17 places in 810 ms of which 2 ms to minimize.
[2022-05-20 00:36:27] [INFO ] Deduced a trap composed of 24 places in 786 ms of which 1 ms to minimize.
[2022-05-20 00:36:28] [INFO ] Deduced a trap composed of 25 places in 789 ms of which 2 ms to minimize.
[2022-05-20 00:36:29] [INFO ] Deduced a trap composed of 22 places in 771 ms of which 2 ms to minimize.
[2022-05-20 00:36:30] [INFO ] Deduced a trap composed of 28 places in 772 ms of which 2 ms to minimize.
[2022-05-20 00:36:31] [INFO ] Deduced a trap composed of 19 places in 756 ms of which 1 ms to minimize.
[2022-05-20 00:36:31] [INFO ] Deduced a trap composed of 27 places in 735 ms of which 1 ms to minimize.
[2022-05-20 00:36:32] [INFO ] Deduced a trap composed of 31 places in 743 ms of which 2 ms to minimize.
[2022-05-20 00:36:33] [INFO ] Deduced a trap composed of 33 places in 752 ms of which 2 ms to minimize.
[2022-05-20 00:36:34] [INFO ] Deduced a trap composed of 29 places in 758 ms of which 2 ms to minimize.
[2022-05-20 00:36:35] [INFO ] Deduced a trap composed of 34 places in 726 ms of which 2 ms to minimize.
[2022-05-20 00:36:36] [INFO ] Deduced a trap composed of 50 places in 716 ms of which 2 ms to minimize.
[2022-05-20 00:36:36] [INFO ] Deduced a trap composed of 35 places in 719 ms of which 2 ms to minimize.
[2022-05-20 00:36:37] [INFO ] Deduced a trap composed of 25 places in 738 ms of which 1 ms to minimize.
[2022-05-20 00:36:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 00:36:37] [INFO ] After 25429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 126 ms.
Support contains 2 out of 3053 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 3053 transition count 2451
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 704 place count 2701 transition count 2451
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 704 place count 2701 transition count 2201
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1204 place count 2451 transition count 2201
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 2 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 3002 place count 1552 transition count 1302
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 446 times.
Drop transitions removed 446 transitions
Iterating global reduction 2 with 446 rules applied. Total rules applied 3448 place count 1552 transition count 1302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3449 place count 1551 transition count 1301
Applied a total of 3449 rules in 385 ms. Remains 1551 /3053 variables (removed 1502) and now considering 1301/2803 (removed 1502) transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/3053 places, 1301/2803 transitions.
Finished random walk after 2172 steps, including 0 resets, run visited all 2 properties in 36 ms. (steps per millisecond=60 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 7 states, 10 edges and 3 AP to 7 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:36:39] [INFO ] Computed 551 place invariants in 13 ms
[2022-05-20 00:36:42] [INFO ] [Real]Absence check using 551 positive place invariants in 1255 ms returned sat
[2022-05-20 00:36:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:36:54] [INFO ] [Real]Absence check using state equation in 11828 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 27 reset in 937 ms.
Product exploration explored 100000 steps with 24 reset in 1095 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 2 out of 3053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Performed 351 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3053 transition count 2803
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 102 Pre rules applied. Total rules applied 351 place count 3053 transition count 2805
Deduced a syphon composed of 453 places in 7 ms
Iterating global reduction 1 with 102 rules applied. Total rules applied 453 place count 3053 transition count 2805
Performed 1048 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1501 places in 3 ms
Iterating global reduction 1 with 1048 rules applied. Total rules applied 1501 place count 3053 transition count 2805
Renaming transitions due to excessive name length > 1024 char.
Discarding 351 places :
Symmetric choice reduction at 1 with 351 rule applications. Total rules 1852 place count 2702 transition count 2454
Deduced a syphon composed of 1150 places in 3 ms
Iterating global reduction 1 with 351 rules applied. Total rules applied 2203 place count 2702 transition count 2454
Deduced a syphon composed of 1150 places in 3 ms
Applied a total of 2203 rules in 1299 ms. Remains 2702 /3053 variables (removed 351) and now considering 2454/2803 (removed 349) transitions.
[2022-05-20 00:36:58] [INFO ] Redundant transitions in 56 ms returned []
// Phase 1: matrix 2454 rows 2702 cols
[2022-05-20 00:36:58] [INFO ] Computed 551 place invariants in 28 ms
[2022-05-20 00:37:00] [INFO ] Dead Transitions using invariants and state equation in 1516 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2702/3053 places, 2454/2803 transitions.
Finished structural reductions, in 1 iterations. Remains : 2702/3053 places, 2454/2803 transitions.
Product exploration explored 100000 steps with 68 reset in 1071 ms.
Product exploration explored 100000 steps with 62 reset in 1279 ms.
Built C files in :
/tmp/ltsmin6996735218168572601
[2022-05-20 00:37:02] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6996735218168572601
Running compilation step : cd /tmp/ltsmin6996735218168572601;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6996735218168572601;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6996735218168572601;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 3053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Applied a total of 0 rules in 156 ms. Remains 3053 /3053 variables (removed 0) and now considering 2803/2803 (removed 0) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:37:05] [INFO ] Computed 551 place invariants in 11 ms
[2022-05-20 00:37:06] [INFO ] Implicit Places using invariants in 1108 ms returned []
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:37:06] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:37:10] [INFO ] Implicit Places using invariants and state equation in 3344 ms returned []
Implicit Place search using SMT with State Equation took 4466 ms to find 0 implicit places.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:37:10] [INFO ] Computed 551 place invariants in 12 ms
[2022-05-20 00:37:12] [INFO ] Dead Transitions using invariants and state equation in 1874 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3053/3053 places, 2803/2803 transitions.
Built C files in :
/tmp/ltsmin7047944228677990493
[2022-05-20 00:37:12] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7047944228677990493
Running compilation step : cd /tmp/ltsmin7047944228677990493;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7047944228677990493;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7047944228677990493;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 00:37:15] [INFO ] Flatten gal took : 115 ms
[2022-05-20 00:37:15] [INFO ] Flatten gal took : 156 ms
[2022-05-20 00:37:15] [INFO ] Time to serialize gal into /tmp/LTL1695483791850546185.gal : 26 ms
[2022-05-20 00:37:15] [INFO ] Time to serialize properties into /tmp/LTL5535219427058768974.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1695483791850546185.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5535219427058768974.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1695483...266
Read 1 LTL properties
Checking formula 0 : !((X(X((X(G(F("(p1024==0)"))))&&((X(G("(p1024==1)")))||(F("(p2568==1)")))))))
Formula 0 simplified : !XX(XGF"(p1024==0)" & (XG"(p1024==1)" | F"(p2568==1)"))
Detected timeout of ITS tools.
[2022-05-20 00:37:30] [INFO ] Flatten gal took : 78 ms
[2022-05-20 00:37:30] [INFO ] Applying decomposition
[2022-05-20 00:37:30] [INFO ] Flatten gal took : 78 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10168072434535500711.txt' '-o' '/tmp/graph10168072434535500711.bin' '-w' '/tmp/graph10168072434535500711.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10168072434535500711.bin' '-l' '-1' '-v' '-w' '/tmp/graph10168072434535500711.weights' '-q' '0' '-e' '0.001'
[2022-05-20 00:37:30] [INFO ] Decomposing Gal with order
[2022-05-20 00:37:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:37:31] [INFO ] Removed a total of 450 redundant transitions.
[2022-05-20 00:37:31] [INFO ] Flatten gal took : 149 ms
[2022-05-20 00:37:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 26 ms.
[2022-05-20 00:37:31] [INFO ] Time to serialize gal into /tmp/LTL7917990897238011684.gal : 41 ms
[2022-05-20 00:37:31] [INFO ] Time to serialize properties into /tmp/LTL5517274882062699211.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7917990897238011684.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5517274882062699211.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7917990...245
Read 1 LTL properties
Checking formula 0 : !((X(X((X(G(F("(i4.u370.p1024==0)"))))&&((X(G("(i4.u370.p1024==1)")))||(F("(i37.u912.p2568==1)")))))))
Formula 0 simplified : !XX(XGF"(i4.u370.p1024==0)" & (XG"(i4.u370.p1024==1)" | F"(i37.u912.p2568==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9263910664002891363
[2022-05-20 00:37:46] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9263910664002891363
Running compilation step : cd /tmp/ltsmin9263910664002891363;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9263910664002891363;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9263910664002891363;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-03 finished in 160982 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(F(p0))))))'
Support contains 2 out of 3057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3057/3057 places, 2807/2807 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3056 transition count 2455
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2705 transition count 2455
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 702 place count 2705 transition count 2205
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1202 place count 2455 transition count 2205
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1207 place count 2450 transition count 2200
Iterating global reduction 2 with 5 rules applied. Total rules applied 1212 place count 2450 transition count 2200
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1212 place count 2450 transition count 2197
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1218 place count 2447 transition count 2197
Performed 894 Post agglomeration using F-continuation condition.Transition count delta: 894
Deduced a syphon composed of 894 places in 2 ms
Reduce places removed 894 places and 0 transitions.
Iterating global reduction 2 with 1788 rules applied. Total rules applied 3006 place count 1553 transition count 1303
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3008 place count 1551 transition count 1301
Applied a total of 3008 rules in 610 ms. Remains 1551 /3057 variables (removed 1506) and now considering 1301/2807 (removed 1506) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:37:50] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:37:51] [INFO ] Implicit Places using invariants in 837 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:37:51] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:37:52] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 2385 ms to find 0 implicit places.
[2022-05-20 00:37:52] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:37:52] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:37:53] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/3057 places, 1301/2807 transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/3057 places, 1301/2807 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-05 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:(AND (EQ s1234 0) (EQ s157 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]]
Product exploration explored 100000 steps with 806 reset in 1003 ms.
Product exploration explored 100000 steps with 716 reset in 1173 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:37:56] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:37:57] [INFO ] [Real]Absence check using 551 positive place invariants in 422 ms returned sat
[2022-05-20 00:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:38:02] [INFO ] [Real]Absence check using state equation in 4714 ms returned sat
[2022-05-20 00:38:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:38:03] [INFO ] [Nat]Absence check using 551 positive place invariants in 406 ms returned sat
[2022-05-20 00:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:38:07] [INFO ] [Nat]Absence check using state equation in 4201 ms returned sat
[2022-05-20 00:38:08] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2022-05-20 00:38:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2022-05-20 00:38:08] [INFO ] Computed and/alt/rep : 1298/2495/1298 causal constraints (skipped 0 transitions) in 76 ms.
[2022-05-20 00:38:18] [INFO ] Deduced a trap composed of 3 places in 770 ms of which 2 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-20 00:38:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 47 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:38:18] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:38:18] [INFO ] Implicit Places using invariants in 671 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:38:18] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:38:20] [INFO ] Implicit Places using invariants and state equation in 1525 ms returned []
Implicit Place search using SMT with State Equation took 2196 ms to find 0 implicit places.
[2022-05-20 00:38:20] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:38:20] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:38:21] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1551 places, 1301/1301 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:38:21] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:38:23] [INFO ] [Real]Absence check using 551 positive place invariants in 426 ms returned sat
[2022-05-20 00:38:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:38:27] [INFO ] [Real]Absence check using state equation in 4743 ms returned sat
[2022-05-20 00:38:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:38:29] [INFO ] [Nat]Absence check using 551 positive place invariants in 408 ms returned sat
[2022-05-20 00:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:38:33] [INFO ] [Nat]Absence check using state equation in 4409 ms returned sat
[2022-05-20 00:38:33] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2022-05-20 00:38:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2022-05-20 00:38:33] [INFO ] Computed and/alt/rep : 1298/2495/1298 causal constraints (skipped 0 transitions) in 64 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-20 00:38:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 814 reset in 920 ms.
Product exploration explored 100000 steps with 831 reset in 1066 ms.
Built C files in :
/tmp/ltsmin4791594927026084727
[2022-05-20 00:38:44] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2022-05-20 00:38:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:38:44] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2022-05-20 00:38:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:38:45] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2022-05-20 00:38:45] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:38:45] [INFO ] Built C files in 175ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4791594927026084727
Running compilation step : cd /tmp/ltsmin4791594927026084727;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4791594927026084727;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4791594927026084727;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 51 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:38:48] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:38:48] [INFO ] Implicit Places using invariants in 724 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:38:48] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:38:50] [INFO ] Implicit Places using invariants and state equation in 1614 ms returned []
Implicit Place search using SMT with State Equation took 2340 ms to find 0 implicit places.
[2022-05-20 00:38:50] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:38:50] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:38:51] [INFO ] Dead Transitions using invariants and state equation in 664 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1551 places, 1301/1301 transitions.
Built C files in :
/tmp/ltsmin10740303051256456629
[2022-05-20 00:38:51] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2022-05-20 00:38:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:38:51] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2022-05-20 00:38:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:38:51] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2022-05-20 00:38:51] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:38:51] [INFO ] Built C files in 148ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10740303051256456629
Running compilation step : cd /tmp/ltsmin10740303051256456629;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10740303051256456629;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10740303051256456629;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 00:38:54] [INFO ] Flatten gal took : 40 ms
[2022-05-20 00:38:54] [INFO ] Flatten gal took : 40 ms
[2022-05-20 00:38:54] [INFO ] Time to serialize gal into /tmp/LTL6196965368401363148.gal : 4 ms
[2022-05-20 00:38:54] [INFO ] Time to serialize properties into /tmp/LTL3604980979734993839.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6196965368401363148.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3604980979734993839.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6196965...266
Read 1 LTL properties
Checking formula 0 : !((F(G(F(G(F("((p2710==0)&&(p385==1))")))))))
Formula 0 simplified : !FGFGF"((p2710==0)&&(p385==1))"
Detected timeout of ITS tools.
[2022-05-20 00:39:09] [INFO ] Flatten gal took : 38 ms
[2022-05-20 00:39:09] [INFO ] Applying decomposition
[2022-05-20 00:39:09] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18185325530372919046.txt' '-o' '/tmp/graph18185325530372919046.bin' '-w' '/tmp/graph18185325530372919046.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18185325530372919046.bin' '-l' '-1' '-v' '-w' '/tmp/graph18185325530372919046.weights' '-q' '0' '-e' '0.001'
[2022-05-20 00:39:09] [INFO ] Decomposing Gal with order
[2022-05-20 00:39:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:39:09] [INFO ] Removed a total of 301 redundant transitions.
[2022-05-20 00:39:09] [INFO ] Flatten gal took : 65 ms
[2022-05-20 00:39:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 596 labels/synchronizations in 10 ms.
[2022-05-20 00:39:09] [INFO ] Time to serialize gal into /tmp/LTL9005431250392036312.gal : 8 ms
[2022-05-20 00:39:09] [INFO ] Time to serialize properties into /tmp/LTL15528886419033929666.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9005431250392036312.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15528886419033929666.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9005431...246
Read 1 LTL properties
Checking formula 0 : !((F(G(F(G(F("((i39.u439.p2710==0)&&(i4.u55.p385==1))")))))))
Formula 0 simplified : !FGFGF"((i39.u439.p2710==0)&&(i4.u55.p385==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8298697055938966556
[2022-05-20 00:39:25] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8298697055938966556
Running compilation step : cd /tmp/ltsmin8298697055938966556;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2372 ms.
Running link step : cd /tmp/ltsmin8298697055938966556;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin8298697055938966556;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](<>([](<>((LTLAPp0==true))))))' '--buchi-type=spotba'
LTSmin run took 10286 ms.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-05 finished in 108059 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0 U X(G(p1)))))'
Support contains 4 out of 3057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3057/3057 places, 2807/2807 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3052 transition count 2802
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3052 transition count 2802
Applied a total of 10 rules in 329 ms. Remains 3052 /3057 variables (removed 5) and now considering 2802/2807 (removed 5) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:39:38] [INFO ] Computed 551 place invariants in 16 ms
[2022-05-20 00:39:39] [INFO ] Implicit Places using invariants in 1082 ms returned []
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:39:39] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:39:42] [INFO ] Implicit Places using invariants and state equation in 3238 ms returned []
Implicit Place search using SMT with State Equation took 4322 ms to find 0 implicit places.
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:39:42] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:39:44] [INFO ] Dead Transitions using invariants and state equation in 1903 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3057 places, 2802/2807 transitions.
Finished structural reductions, in 1 iterations. Remains : 3052/3057 places, 2802/2807 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s114 0) (EQ s793 1)), p0:(OR (EQ s2237 0) (EQ s1329 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1986 steps with 0 reset in 19 ms.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-08 finished in 6681 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(F(G(X((F(p0)&&(F(p1)||p2))))))))'
Support contains 5 out of 3057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3057/3057 places, 2807/2807 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 3056 transition count 2458
Reduce places removed 348 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 349 rules applied. Total rules applied 697 place count 2708 transition count 2457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 698 place count 2707 transition count 2457
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 251 Pre rules applied. Total rules applied 698 place count 2707 transition count 2206
Deduced a syphon composed of 251 places in 6 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 3 with 502 rules applied. Total rules applied 1200 place count 2456 transition count 2206
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1205 place count 2451 transition count 2201
Iterating global reduction 3 with 5 rules applied. Total rules applied 1210 place count 2451 transition count 2201
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1210 place count 2451 transition count 2198
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1216 place count 2448 transition count 2198
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 2 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 3 with 1784 rules applied. Total rules applied 3000 place count 1556 transition count 1306
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3002 place count 1554 transition count 1304
Applied a total of 3002 rules in 488 ms. Remains 1554 /3057 variables (removed 1503) and now considering 1304/2807 (removed 1503) transitions.
// Phase 1: matrix 1304 rows 1554 cols
[2022-05-20 00:39:44] [INFO ] Computed 551 place invariants in 9 ms
[2022-05-20 00:39:45] [INFO ] Implicit Places using invariants in 693 ms returned []
// Phase 1: matrix 1304 rows 1554 cols
[2022-05-20 00:39:45] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:39:47] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 2256 ms to find 0 implicit places.
[2022-05-20 00:39:47] [INFO ] Redundant transitions in 141 ms returned []
// Phase 1: matrix 1304 rows 1554 cols
[2022-05-20 00:39:47] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:39:47] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1554/3057 places, 1304/2807 transitions.
Finished structural reductions, in 1 iterations. Remains : 1554/3057 places, 1304/2807 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1045 0), p2:(AND (EQ s692 0) (EQ s1148 1)), p1:(AND (EQ s716 0) (EQ s757 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 9925 steps with 4 reset in 104 ms.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-09 finished in 3783 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 3057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3057/3057 places, 2807/2807 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3053 transition count 2803
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3053 transition count 2803
Applied a total of 8 rules in 328 ms. Remains 3053 /3057 variables (removed 4) and now considering 2803/2807 (removed 4) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:39:48] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 00:39:49] [INFO ] Implicit Places using invariants in 1083 ms returned []
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:39:49] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:39:53] [INFO ] Implicit Places using invariants and state equation in 3428 ms returned []
Implicit Place search using SMT with State Equation took 4513 ms to find 0 implicit places.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:39:53] [INFO ] Computed 551 place invariants in 12 ms
[2022-05-20 00:39:54] [INFO ] Dead Transitions using invariants and state equation in 1874 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3057 places, 2803/2807 transitions.
Finished structural reductions, in 1 iterations. Remains : 3053/3057 places, 2803/2807 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s963 0) (EQ s2808 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1775 ms.
Product exploration explored 100000 steps with 50000 reset in 1757 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-10 finished in 10434 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 3057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3057/3057 places, 2807/2807 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3052 transition count 2802
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3052 transition count 2802
Applied a total of 10 rules in 324 ms. Remains 3052 /3057 variables (removed 5) and now considering 2802/2807 (removed 5) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:39:58] [INFO ] Computed 551 place invariants in 15 ms
[2022-05-20 00:39:59] [INFO ] Implicit Places using invariants in 1033 ms returned []
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:40:00] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:40:03] [INFO ] Implicit Places using invariants and state equation in 3284 ms returned []
Implicit Place search using SMT with State Equation took 4318 ms to find 0 implicit places.
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:40:03] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:40:05] [INFO ] Dead Transitions using invariants and state equation in 1834 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3057 places, 2802/2807 transitions.
Finished structural reductions, in 1 iterations. Remains : 3052/3057 places, 2802/2807 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s2866 0) (NEQ s683 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 201 reset in 484 ms.
Product exploration explored 100000 steps with 195 reset in 532 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Finished random walk after 520 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=130 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:40:06] [INFO ] Computed 551 place invariants in 9 ms
[2022-05-20 00:40:09] [INFO ] [Real]Absence check using 551 positive place invariants in 1224 ms returned sat
[2022-05-20 00:40:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:40:21] [INFO ] [Real]Absence check using state equation in 11858 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 3052 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3052/3052 places, 2802/2802 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 3051 transition count 2449
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 704 place count 2699 transition count 2449
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 704 place count 2699 transition count 2200
Deduced a syphon composed of 249 places in 5 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 1202 place count 2450 transition count 2200
Performed 896 Post agglomeration using F-continuation condition.Transition count delta: 896
Deduced a syphon composed of 896 places in 2 ms
Reduce places removed 896 places and 0 transitions.
Iterating global reduction 2 with 1792 rules applied. Total rules applied 2994 place count 1554 transition count 1304
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2996 place count 1552 transition count 1302
Applied a total of 2996 rules in 363 ms. Remains 1552 /3052 variables (removed 1500) and now considering 1302/2802 (removed 1500) transitions.
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:40:21] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:40:22] [INFO ] Implicit Places using invariants in 664 ms returned []
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:40:22] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:40:24] [INFO ] Implicit Places using invariants and state equation in 1525 ms returned []
Implicit Place search using SMT with State Equation took 2190 ms to find 0 implicit places.
[2022-05-20 00:40:24] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:40:24] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:40:24] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1552/3052 places, 1302/2802 transitions.
Finished structural reductions, in 1 iterations. Remains : 1552/3052 places, 1302/2802 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 73 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:40:25] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:40:26] [INFO ] [Real]Absence check using 551 positive place invariants in 407 ms returned sat
[2022-05-20 00:40:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:40:31] [INFO ] [Real]Absence check using state equation in 4541 ms returned sat
[2022-05-20 00:40:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:40:32] [INFO ] [Nat]Absence check using 551 positive place invariants in 400 ms returned sat
[2022-05-20 00:40:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:40:38] [INFO ] [Nat]Absence check using state equation in 6175 ms returned sat
[2022-05-20 00:40:38] [INFO ] Computed and/alt/rep : 1300/2495/1300 causal constraints (skipped 0 transitions) in 67 ms.
[2022-05-20 00:40:46] [INFO ] Added : 265 causal constraints over 53 iterations in 7332 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1355 reset in 812 ms.
Product exploration explored 100000 steps with 1361 reset in 987 ms.
Built C files in :
/tmp/ltsmin341797653332668403
[2022-05-20 00:40:48] [INFO ] Computing symmetric may disable matrix : 1302 transitions.
[2022-05-20 00:40:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:40:48] [INFO ] Computing symmetric may enable matrix : 1302 transitions.
[2022-05-20 00:40:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:40:48] [INFO ] Computing Do-Not-Accords matrix : 1302 transitions.
[2022-05-20 00:40:48] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:40:48] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin341797653332668403
Running compilation step : cd /tmp/ltsmin341797653332668403;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin341797653332668403;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin341797653332668403;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 1552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 44 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:40:51] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:40:52] [INFO ] Implicit Places using invariants in 731 ms returned []
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:40:52] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:40:53] [INFO ] Implicit Places using invariants and state equation in 1560 ms returned []
Implicit Place search using SMT with State Equation took 2293 ms to find 0 implicit places.
[2022-05-20 00:40:53] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:40:53] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:40:54] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1552/1552 places, 1302/1302 transitions.
Built C files in :
/tmp/ltsmin3634210359992933419
[2022-05-20 00:40:54] [INFO ] Computing symmetric may disable matrix : 1302 transitions.
[2022-05-20 00:40:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:40:54] [INFO ] Computing symmetric may enable matrix : 1302 transitions.
[2022-05-20 00:40:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:40:54] [INFO ] Computing Do-Not-Accords matrix : 1302 transitions.
[2022-05-20 00:40:54] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:40:54] [INFO ] Built C files in 144ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3634210359992933419
Running compilation step : cd /tmp/ltsmin3634210359992933419;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3634210359992933419;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3634210359992933419;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 00:40:57] [INFO ] Flatten gal took : 39 ms
[2022-05-20 00:40:57] [INFO ] Flatten gal took : 40 ms
[2022-05-20 00:40:57] [INFO ] Time to serialize gal into /tmp/LTL5754264765281571302.gal : 5 ms
[2022-05-20 00:40:57] [INFO ] Time to serialize properties into /tmp/LTL2396025653058101985.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5754264765281571302.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2396025653058101985.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5754264...266
Read 1 LTL properties
Checking formula 0 : !((X(F("((p3193!=0)&&(p753!=1))"))))
Formula 0 simplified : !XF"((p3193!=0)&&(p753!=1))"
Detected timeout of ITS tools.
[2022-05-20 00:41:12] [INFO ] Flatten gal took : 36 ms
[2022-05-20 00:41:12] [INFO ] Applying decomposition
[2022-05-20 00:41:12] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7875726518798020429.txt' '-o' '/tmp/graph7875726518798020429.bin' '-w' '/tmp/graph7875726518798020429.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7875726518798020429.bin' '-l' '-1' '-v' '-w' '/tmp/graph7875726518798020429.weights' '-q' '0' '-e' '0.001'
[2022-05-20 00:41:12] [INFO ] Decomposing Gal with order
[2022-05-20 00:41:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:41:12] [INFO ] Removed a total of 302 redundant transitions.
[2022-05-20 00:41:12] [INFO ] Flatten gal took : 60 ms
[2022-05-20 00:41:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 9 ms.
[2022-05-20 00:41:12] [INFO ] Time to serialize gal into /tmp/LTL2687022556448190806.gal : 8 ms
[2022-05-20 00:41:12] [INFO ] Time to serialize properties into /tmp/LTL16530283812339353884.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2687022556448190806.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16530283812339353884.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2687022...246
Read 1 LTL properties
Checking formula 0 : !((X(F("((i46.u517.p3193!=0)&&(i10.u116.p753!=1))"))))
Formula 0 simplified : !XF"((i46.u517.p3193!=0)&&(i10.u116.p753!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7573845011958748118
[2022-05-20 00:41:28] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7573845011958748118
Running compilation step : cd /tmp/ltsmin7573845011958748118;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2398 ms.
Running link step : cd /tmp/ltsmin7573845011958748118;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7573845011958748118;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 10231 ms.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-12 finished in 102055 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&(p1 U p2)))'
Support contains 6 out of 3057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3057/3057 places, 2807/2807 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 3054 transition count 2804
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 3054 transition count 2804
Applied a total of 6 rules in 312 ms. Remains 3054 /3057 variables (removed 3) and now considering 2804/2807 (removed 3) transitions.
// Phase 1: matrix 2804 rows 3054 cols
[2022-05-20 00:41:41] [INFO ] Computed 551 place invariants in 13 ms
[2022-05-20 00:41:42] [INFO ] Implicit Places using invariants in 1060 ms returned []
// Phase 1: matrix 2804 rows 3054 cols
[2022-05-20 00:41:42] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:41:45] [INFO ] Implicit Places using invariants and state equation in 3223 ms returned []
Implicit Place search using SMT with State Equation took 4284 ms to find 0 implicit places.
// Phase 1: matrix 2804 rows 3054 cols
[2022-05-20 00:41:45] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:41:47] [INFO ] Dead Transitions using invariants and state equation in 1792 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3054/3057 places, 2804/2807 transitions.
Finished structural reductions, in 1 iterations. Remains : 3054/3057 places, 2804/2807 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s249 0) (EQ s1722 1)), p1:(OR (EQ s1044 0) (EQ s181 1)), p0:(OR (AND (EQ s181 0) (EQ s1044 1)) (AND (EQ s863 0) (EQ s773 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 81 reset in 657 ms.
Product exploration explored 100000 steps with 83 reset in 730 ms.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 218 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2804 rows 3054 cols
[2022-05-20 00:41:49] [INFO ] Computed 551 place invariants in 17 ms
[2022-05-20 00:41:49] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 00:41:49] [INFO ] [Nat]Absence check using 551 positive place invariants in 200 ms returned sat
[2022-05-20 00:41:51] [INFO ] After 1497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 00:41:52] [INFO ] Deduced a trap composed of 28 places in 820 ms of which 2 ms to minimize.
[2022-05-20 00:41:53] [INFO ] Deduced a trap composed of 16 places in 792 ms of which 1 ms to minimize.
[2022-05-20 00:41:54] [INFO ] Deduced a trap composed of 19 places in 783 ms of which 2 ms to minimize.
[2022-05-20 00:41:55] [INFO ] Deduced a trap composed of 17 places in 760 ms of which 2 ms to minimize.
[2022-05-20 00:41:55] [INFO ] Deduced a trap composed of 48 places in 747 ms of which 2 ms to minimize.
[2022-05-20 00:41:56] [INFO ] Deduced a trap composed of 16 places in 755 ms of which 2 ms to minimize.
[2022-05-20 00:41:57] [INFO ] Deduced a trap composed of 18 places in 727 ms of which 2 ms to minimize.
[2022-05-20 00:41:58] [INFO ] Deduced a trap composed of 34 places in 734 ms of which 1 ms to minimize.
[2022-05-20 00:41:59] [INFO ] Deduced a trap composed of 24 places in 728 ms of which 2 ms to minimize.
[2022-05-20 00:42:00] [INFO ] Deduced a trap composed of 23 places in 735 ms of which 2 ms to minimize.
[2022-05-20 00:42:00] [INFO ] Deduced a trap composed of 20 places in 722 ms of which 2 ms to minimize.
[2022-05-20 00:42:01] [INFO ] Deduced a trap composed of 31 places in 705 ms of which 1 ms to minimize.
[2022-05-20 00:42:02] [INFO ] Deduced a trap composed of 28 places in 692 ms of which 2 ms to minimize.
[2022-05-20 00:42:03] [INFO ] Deduced a trap composed of 18 places in 679 ms of which 1 ms to minimize.
[2022-05-20 00:42:03] [INFO ] Deduced a trap composed of 18 places in 676 ms of which 1 ms to minimize.
[2022-05-20 00:42:04] [INFO ] Deduced a trap composed of 36 places in 678 ms of which 1 ms to minimize.
[2022-05-20 00:42:05] [INFO ] Deduced a trap composed of 34 places in 696 ms of which 1 ms to minimize.
[2022-05-20 00:42:06] [INFO ] Deduced a trap composed of 28 places in 694 ms of which 1 ms to minimize.
[2022-05-20 00:42:07] [INFO ] Deduced a trap composed of 19 places in 723 ms of which 2 ms to minimize.
[2022-05-20 00:42:07] [INFO ] Deduced a trap composed of 34 places in 695 ms of which 2 ms to minimize.
[2022-05-20 00:42:08] [INFO ] Deduced a trap composed of 33 places in 699 ms of which 2 ms to minimize.
[2022-05-20 00:42:09] [INFO ] Deduced a trap composed of 26 places in 669 ms of which 1 ms to minimize.
[2022-05-20 00:42:10] [INFO ] Deduced a trap composed of 38 places in 653 ms of which 2 ms to minimize.
[2022-05-20 00:42:11] [INFO ] Deduced a trap composed of 38 places in 640 ms of which 1 ms to minimize.
[2022-05-20 00:42:11] [INFO ] Deduced a trap composed of 22 places in 658 ms of which 2 ms to minimize.
[2022-05-20 00:42:12] [INFO ] Deduced a trap composed of 35 places in 641 ms of which 2 ms to minimize.
[2022-05-20 00:42:13] [INFO ] Deduced a trap composed of 46 places in 631 ms of which 1 ms to minimize.
[2022-05-20 00:42:13] [INFO ] Deduced a trap composed of 19 places in 632 ms of which 2 ms to minimize.
[2022-05-20 00:42:14] [INFO ] Deduced a trap composed of 24 places in 644 ms of which 2 ms to minimize.
[2022-05-20 00:42:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 00:42:14] [INFO ] After 25275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 28 ms.
Support contains 2 out of 3054 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3054/3054 places, 2804/2804 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 3054 transition count 2452
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 704 place count 2702 transition count 2452
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 704 place count 2702 transition count 2202
Deduced a syphon composed of 250 places in 23 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1204 place count 2452 transition count 2202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1205 place count 2451 transition count 2201
Iterating global reduction 2 with 1 rules applied. Total rules applied 1206 place count 2451 transition count 2201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1206 place count 2451 transition count 2200
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1208 place count 2450 transition count 2200
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: 897
Deduced a syphon composed of 897 places in 2 ms
Reduce places removed 897 places and 0 transitions.
Iterating global reduction 2 with 1794 rules applied. Total rules applied 3002 place count 1553 transition count 1303
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 447 times.
Drop transitions removed 447 transitions
Iterating global reduction 2 with 447 rules applied. Total rules applied 3449 place count 1553 transition count 1303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3450 place count 1552 transition count 1302
Applied a total of 3450 rules in 568 ms. Remains 1552 /3054 variables (removed 1502) and now considering 1302/2804 (removed 1502) transitions.
Finished structural reductions, in 1 iterations. Remains : 1552/3054 places, 1302/2804 transitions.
Finished random walk after 3248 steps, including 0 resets, run visited all 1 properties in 38 ms. (steps per millisecond=85 )
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p2)), (F p0)]
Knowledge based reduction with 7 factoid took 285 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0)), (NOT p0)]
// Phase 1: matrix 2804 rows 3054 cols
[2022-05-20 00:42:15] [INFO ] Computed 551 place invariants in 12 ms
[2022-05-20 00:42:19] [INFO ] [Real]Absence check using 551 positive place invariants in 1266 ms returned sat
[2022-05-20 00:42:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:42:30] [INFO ] [Real]Absence check using state equation in 11570 ms returned unknown
Could not prove EG (AND p2 (NOT p0))
Support contains 6 out of 3054 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3054/3054 places, 2804/2804 transitions.
Applied a total of 0 rules in 169 ms. Remains 3054 /3054 variables (removed 0) and now considering 2804/2804 (removed 0) transitions.
// Phase 1: matrix 2804 rows 3054 cols
[2022-05-20 00:42:30] [INFO ] Computed 551 place invariants in 14 ms
[2022-05-20 00:42:32] [INFO ] Implicit Places using invariants in 1046 ms returned []
// Phase 1: matrix 2804 rows 3054 cols
[2022-05-20 00:42:32] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 00:42:35] [INFO ] Implicit Places using invariants and state equation in 3254 ms returned []
Implicit Place search using SMT with State Equation took 4307 ms to find 0 implicit places.
// Phase 1: matrix 2804 rows 3054 cols
[2022-05-20 00:42:35] [INFO ] Computed 551 place invariants in 10 ms
[2022-05-20 00:42:37] [INFO ] Dead Transitions using invariants and state equation in 1859 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3054/3054 places, 2804/2804 transitions.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1231 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=136 )
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 2804 rows 3054 cols
[2022-05-20 00:42:37] [INFO ] Computed 551 place invariants in 15 ms
[2022-05-20 00:42:41] [INFO ] [Real]Absence check using 551 positive place invariants in 1239 ms returned sat
[2022-05-20 00:42:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:42:52] [INFO ] [Real]Absence check using state equation in 11727 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 87 reset in 651 ms.
Product exploration explored 100000 steps with 83 reset in 729 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 3054 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3054/3054 places, 2804/2804 transitions.
Performed 350 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3054 transition count 2804
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 102 Pre rules applied. Total rules applied 350 place count 3054 transition count 2806
Deduced a syphon composed of 452 places in 6 ms
Iterating global reduction 1 with 102 rules applied. Total rules applied 452 place count 3054 transition count 2806
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 453 place count 3053 transition count 2805
Deduced a syphon composed of 452 places in 7 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 454 place count 3053 transition count 2805
Performed 1045 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1497 places in 4 ms
Iterating global reduction 1 with 1045 rules applied. Total rules applied 1499 place count 3053 transition count 2805
Renaming transitions due to excessive name length > 1024 char.
Discarding 350 places :
Symmetric choice reduction at 1 with 350 rule applications. Total rules 1849 place count 2703 transition count 2455
Deduced a syphon composed of 1147 places in 3 ms
Iterating global reduction 1 with 350 rules applied. Total rules applied 2199 place count 2703 transition count 2455
Deduced a syphon composed of 1147 places in 3 ms
Applied a total of 2199 rules in 981 ms. Remains 2703 /3054 variables (removed 351) and now considering 2455/2804 (removed 349) transitions.
[2022-05-20 00:42:55] [INFO ] Redundant transitions in 64 ms returned []
// Phase 1: matrix 2455 rows 2703 cols
[2022-05-20 00:42:55] [INFO ] Computed 551 place invariants in 30 ms
[2022-05-20 00:42:57] [INFO ] Dead Transitions using invariants and state equation in 1570 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2703/3054 places, 2455/2804 transitions.
Finished structural reductions, in 1 iterations. Remains : 2703/3054 places, 2455/2804 transitions.
Product exploration explored 100000 steps with 10091 reset in 2995 ms.
Product exploration explored 100000 steps with 10109 reset in 3087 ms.
Built C files in :
/tmp/ltsmin13953921369233474902
[2022-05-20 00:43:03] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13953921369233474902
Running compilation step : cd /tmp/ltsmin13953921369233474902;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13953921369233474902;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13953921369233474902;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 3054 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3054/3054 places, 2804/2804 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 3053 transition count 2803
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3053 transition count 2803
Applied a total of 2 rules in 309 ms. Remains 3053 /3054 variables (removed 1) and now considering 2803/2804 (removed 1) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:43:06] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:43:07] [INFO ] Implicit Places using invariants in 1032 ms returned []
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:43:07] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:43:10] [INFO ] Implicit Places using invariants and state equation in 3342 ms returned []
Implicit Place search using SMT with State Equation took 4377 ms to find 0 implicit places.
// Phase 1: matrix 2803 rows 3053 cols
[2022-05-20 00:43:10] [INFO ] Computed 551 place invariants in 16 ms
[2022-05-20 00:43:12] [INFO ] Dead Transitions using invariants and state equation in 1868 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3054 places, 2803/2804 transitions.
Finished structural reductions, in 1 iterations. Remains : 3053/3054 places, 2803/2804 transitions.
Built C files in :
/tmp/ltsmin2174156551641477205
[2022-05-20 00:43:12] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2174156551641477205
Running compilation step : cd /tmp/ltsmin2174156551641477205;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2174156551641477205;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2174156551641477205;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 00:43:15] [INFO ] Flatten gal took : 65 ms
[2022-05-20 00:43:15] [INFO ] Flatten gal took : 66 ms
[2022-05-20 00:43:15] [INFO ] Time to serialize gal into /tmp/LTL15422488086332090913.gal : 7 ms
[2022-05-20 00:43:15] [INFO ] Time to serialize properties into /tmp/LTL11408704371950464073.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15422488086332090913.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11408704371950464073.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1542248...268
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("(((p195==0)&&(p1155==1))||((p953==0)&&(p856==1)))"))))&&(("((p1155==0)||(p195==1))")U("((p270==0)||(p1913==1))"))))
Formula 0 simplified : !(XXF"(((p195==0)&&(p1155==1))||((p953==0)&&(p856==1)))" & ("((p1155==0)||(p195==1))" U "((p270==0)||(p1913==1))"))
Detected timeout of ITS tools.
[2022-05-20 00:43:31] [INFO ] Flatten gal took : 66 ms
[2022-05-20 00:43:31] [INFO ] Applying decomposition
[2022-05-20 00:43:31] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14138406663082702580.txt' '-o' '/tmp/graph14138406663082702580.bin' '-w' '/tmp/graph14138406663082702580.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14138406663082702580.bin' '-l' '-1' '-v' '-w' '/tmp/graph14138406663082702580.weights' '-q' '0' '-e' '0.001'
[2022-05-20 00:43:31] [INFO ] Decomposing Gal with order
[2022-05-20 00:43:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:43:31] [INFO ] Removed a total of 450 redundant transitions.
[2022-05-20 00:43:31] [INFO ] Flatten gal took : 111 ms
[2022-05-20 00:43:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2022-05-20 00:43:31] [INFO ] Time to serialize gal into /tmp/LTL11496992185898234777.gal : 23 ms
[2022-05-20 00:43:31] [INFO ] Time to serialize properties into /tmp/LTL13256448315931117630.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11496992185898234777.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13256448315931117630.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1149699...247
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("(((i3.i0.i1.u76.p195==0)&&(i17.u417.p1155==1))||((i14.u347.p953==0)&&(i12.i1.i1.u307.p856==1)))"))))&&(("((i17.u417.p1155==...238
Formula 0 simplified : !(XXF"(((i3.i0.i1.u76.p195==0)&&(i17.u417.p1155==1))||((i14.u347.p953==0)&&(i12.i1.i1.u307.p856==1)))" & ("((i17.u417.p1155==0)||(i3...229
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18182883235520198939
[2022-05-20 00:43:46] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18182883235520198939
Running compilation step : cd /tmp/ltsmin18182883235520198939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18182883235520198939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18182883235520198939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-13 finished in 129262 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!F(X(X(p0)))) U X((F(p0)||(p1 U !p2)))))'
Support contains 4 out of 3057 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3057/3057 places, 2807/2807 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3052 transition count 2802
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3052 transition count 2802
Applied a total of 10 rules in 350 ms. Remains 3052 /3057 variables (removed 5) and now considering 2802/2807 (removed 5) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:43:50] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:43:51] [INFO ] Implicit Places using invariants in 1075 ms returned []
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:43:51] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:43:54] [INFO ] Implicit Places using invariants and state equation in 3370 ms returned []
Implicit Place search using SMT with State Equation took 4461 ms to find 0 implicit places.
// Phase 1: matrix 2802 rows 3052 cols
[2022-05-20 00:43:54] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:43:56] [INFO ] Dead Transitions using invariants and state equation in 1833 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3057 places, 2802/2807 transitions.
Finished structural reductions, in 1 iterations. Remains : 3052/3057 places, 2802/2807 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1857 0) (EQ s2549 1)), p2:(OR (EQ s50 0) (EQ s2341 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 1766 ms.
Product exploration explored 100000 steps with 50000 reset in 1782 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p2)))
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-15 finished in 10386 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(F((X(p0)||G(p0)))) U F(G(p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(F(p0)))&&(X(G(p1))||F(p2))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&(p1 U p2)))'
Found a CL insensitive property : ShieldPPPs-PT-050B-LTLCardinality-13
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p0)]
Support contains 6 out of 3057 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 3057/3057 places, 2807/2807 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3056 transition count 2456
Reduce places removed 350 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 351 rules applied. Total rules applied 701 place count 2706 transition count 2455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 702 place count 2705 transition count 2455
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 702 place count 2705 transition count 2205
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 1202 place count 2455 transition count 2205
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1205 place count 2452 transition count 2202
Iterating global reduction 3 with 3 rules applied. Total rules applied 1208 place count 2452 transition count 2202
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1208 place count 2452 transition count 2200
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1212 place count 2450 transition count 2200
Performed 891 Post agglomeration using F-continuation condition.Transition count delta: 891
Deduced a syphon composed of 891 places in 2 ms
Reduce places removed 891 places and 0 transitions.
Iterating global reduction 3 with 1782 rules applied. Total rules applied 2994 place count 1559 transition count 1309
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2996 place count 1557 transition count 1307
Applied a total of 2996 rules in 511 ms. Remains 1557 /3057 variables (removed 1500) and now considering 1307/2807 (removed 1500) transitions.
// Phase 1: matrix 1307 rows 1557 cols
[2022-05-20 00:44:01] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:44:01] [INFO ] Implicit Places using invariants in 694 ms returned []
// Phase 1: matrix 1307 rows 1557 cols
[2022-05-20 00:44:01] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:44:03] [INFO ] Implicit Places using invariants and state equation in 1559 ms returned []
Implicit Place search using SMT with State Equation took 2254 ms to find 0 implicit places.
// Phase 1: matrix 1307 rows 1557 cols
[2022-05-20 00:44:03] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:44:04] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1557/3057 places, 1307/2807 transitions.
Finished structural reductions, in 1 iterations. Remains : 1557/3057 places, 1307/2807 transitions.
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s103 0) (EQ s871 1)), p1:(OR (EQ s519 0) (EQ s65 1)), p0:(OR (AND (EQ s65 0) (EQ s519 1)) (AND (EQ s424 0) (EQ s378 1)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3347 steps with 20 reset in 35 ms.
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-13 finished in 3678 ms.
CL/SL decision was in the wrong direction : CL + false
[2022-05-20 00:44:04] [INFO ] Flatten gal took : 67 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4326078821448431826
[2022-05-20 00:44:04] [INFO ] Too many transitions (2807) to apply POR reductions. Disabling POR matrices.
[2022-05-20 00:44:04] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4326078821448431826
Running compilation step : cd /tmp/ltsmin4326078821448431826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 00:44:04] [INFO ] Applying decomposition
[2022-05-20 00:44:04] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7214642757064387175.txt' '-o' '/tmp/graph7214642757064387175.bin' '-w' '/tmp/graph7214642757064387175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7214642757064387175.bin' '-l' '-1' '-v' '-w' '/tmp/graph7214642757064387175.weights' '-q' '0' '-e' '0.001'
[2022-05-20 00:44:04] [INFO ] Decomposing Gal with order
[2022-05-20 00:44:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:44:04] [INFO ] Removed a total of 450 redundant transitions.
[2022-05-20 00:44:04] [INFO ] Flatten gal took : 139 ms
[2022-05-20 00:44:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2022-05-20 00:44:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality9954284048834662575.gal : 18 ms
[2022-05-20 00:44:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality4266891829692986080.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9954284048834662575.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4266891829692986080.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...267
Read 3 LTL properties
Checking formula 0 : !(((!(G(F((X("((i22.i0.i1.u547.p1532==0)||(i13.i3.i0.u319.p888==1))"))||(G("((i22.i0.i1.u547.p1532==0)||(i13.i3.i0.u319.p888==1))"))))...223
Formula 0 simplified : !(!GF(X"((i22.i0.i1.u547.p1532==0)||(i13.i3.i0.u319.p888==1))" | G"((i22.i0.i1.u547.p1532==0)||(i13.i3.i0.u319.p888==1))") U FG"((i2...206
Compilation finished in 6513 ms.
Running link step : cd /tmp/ltsmin4326078821448431826;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin4326078821448431826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '()||[]((LTLAPp0==true))))) U <>([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin4326078821448431826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '()||[]((LTLAPp0==true))))) U <>([]((LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4326078821448431826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((X([](<>((LTLAPp1==true))))&&(X([]((LTLAPp2==true)))||<>((LTLAPp3==true))))))' '--buchi-type=spotba'
LTSmin run took 31724 ms.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin4326078821448431826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(<>((LTLAPp4==true))))&&((LTLAPp5==true) U (LTLAPp6==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 01:07:47] [INFO ] Applying decomposition
[2022-05-20 01:07:48] [INFO ] Flatten gal took : 220 ms
[2022-05-20 01:07:48] [INFO ] Decomposing Gal with order
[2022-05-20 01:07:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 01:07:49] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 01:07:49] [INFO ] Flatten gal took : 415 ms
[2022-05-20 01:07:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 50 ms.
[2022-05-20 01:07:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality17685074373652560016.gal : 55 ms
[2022-05-20 01:07:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality5437031029443356350.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17685074373652560016.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5437031029443356350.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 2 LTL properties
Checking formula 0 : !(((!(G(F((X("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.u1414.p1532==0)||(i0.i...841
Formula 0 simplified : !(!GF(X"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.u1414.p1532==0)||(i0.i0.i0...824
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin4326078821448431826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(<>((LTLAPp4==true))))&&((LTLAPp5==true) U (LTLAPp6==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin4326078821448431826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '()||[]((LTLAPp0==true))))) U <>([]((LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 01:32:10] [INFO ] Flatten gal took : 8540 ms
[2022-05-20 01:32:14] [INFO ] Input system was already deterministic with 2807 transitions.
[2022-05-20 01:32:14] [INFO ] Transformed 3057 places.
[2022-05-20 01:32:14] [INFO ] Transformed 2807 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-20 01:32:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality12171440536308028404.gal : 22 ms
[2022-05-20 01:32:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality4407683999517691572.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12171440536308028404.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4407683999517691572.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((!(G(F((X("((p1532==0)||(p888==1))"))||(G("((p1532==0)||(p888==1))"))))))U(F(G("((p1532==0)||(p888==1))")))))
Formula 0 simplified : !(!GF(X"((p1532==0)||(p888==1))" | G"((p1532==0)||(p888==1))") U FG"((p1532==0)||(p888==1))")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-050B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-050B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025300507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-050B.tgz
mv ShieldPPPs-PT-050B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;