About the Execution of ITS-Tools for ASLink-PT-02a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11055.735 | 1574155.00 | 5299681.00 | 954.90 | FFFTTFFFFFFTFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r007-tall-162037989400026.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-02a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989400026
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 105K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K Mar 28 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 09:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 09:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 279K May 5 16:51 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 ASLink-PT-02a-00
FORMULA_NAME ASLink-PT-02a-01
FORMULA_NAME ASLink-PT-02a-02
FORMULA_NAME ASLink-PT-02a-03
FORMULA_NAME ASLink-PT-02a-04
FORMULA_NAME ASLink-PT-02a-05
FORMULA_NAME ASLink-PT-02a-06
FORMULA_NAME ASLink-PT-02a-07
FORMULA_NAME ASLink-PT-02a-08
FORMULA_NAME ASLink-PT-02a-09
FORMULA_NAME ASLink-PT-02a-10
FORMULA_NAME ASLink-PT-02a-11
FORMULA_NAME ASLink-PT-02a-12
FORMULA_NAME ASLink-PT-02a-13
FORMULA_NAME ASLink-PT-02a-14
FORMULA_NAME ASLink-PT-02a-15
=== Now, execution of the tool begins
BK_START 1620392349025
Running Version 0
[2021-05-07 12:59:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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]
[2021-05-07 12:59:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 12:59:10] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2021-05-07 12:59:10] [INFO ] Transformed 626 places.
[2021-05-07 12:59:10] [INFO ] Transformed 1008 transitions.
[2021-05-07 12:59:10] [INFO ] Found NUPN structural information;
[2021-05-07 12:59:10] [INFO ] Parsed PT model containing 626 places and 1008 transitions in 140 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-07 12:59:10] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA ASLink-PT-02a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 626 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 614 transition count 998
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 18 place count 608 transition count 974
Ensure Unique test removed 1 places
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 607 transition count 974
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 607 transition count 973
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 606 transition count 965
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 606 transition count 965
Applied a total of 28 rules in 123 ms. Remains 606 /626 variables (removed 20) and now considering 965/998 (removed 33) transitions.
// Phase 1: matrix 965 rows 606 cols
[2021-05-07 12:59:11] [INFO ] Computed 105 place invariants in 57 ms
[2021-05-07 12:59:11] [INFO ] Implicit Places using invariants in 514 ms returned [1, 19, 20, 23, 33, 69, 198, 214, 219, 220, 221, 257, 386, 391, 403, 408, 410, 445, 448, 466, 467, 468, 469, 486, 494, 502, 508, 514, 520, 534, 540, 546, 554]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 541 ms to find 33 implicit places.
// Phase 1: matrix 965 rows 573 cols
[2021-05-07 12:59:11] [INFO ] Computed 72 place invariants in 40 ms
[2021-05-07 12:59:12] [INFO ] Dead Transitions using invariants and state equation in 474 ms returned []
Starting structural reductions, iteration 1 : 573/626 places, 965/998 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 562 transition count 954
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 562 transition count 954
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 554 transition count 946
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 554 transition count 946
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 551 transition count 943
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 551 transition count 943
Applied a total of 44 rules in 79 ms. Remains 551 /573 variables (removed 22) and now considering 943/965 (removed 22) transitions.
// Phase 1: matrix 943 rows 551 cols
[2021-05-07 12:59:12] [INFO ] Computed 72 place invariants in 29 ms
[2021-05-07 12:59:12] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 943 rows 551 cols
[2021-05-07 12:59:12] [INFO ] Computed 72 place invariants in 28 ms
[2021-05-07 12:59:13] [INFO ] Implicit Places using invariants and state equation in 1195 ms returned []
Implicit Place search using SMT with State Equation took 1457 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 551/626 places, 943/998 transitions.
[2021-05-07 12:59:13] [INFO ] Flatten gal took : 155 ms
[2021-05-07 12:59:13] [INFO ] Flatten gal took : 74 ms
[2021-05-07 12:59:14] [INFO ] Input system was already deterministic with 943 transitions.
Incomplete random walk after 100000 steps, including 1144 resets, run finished after 544 ms. (steps per millisecond=183 ) properties (out of 33) seen :16
Running SMT prover for 17 properties.
// Phase 1: matrix 943 rows 551 cols
[2021-05-07 12:59:14] [INFO ] Computed 72 place invariants in 8 ms
[2021-05-07 12:59:14] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 12:59:14] [INFO ] [Real]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 12:59:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:14] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2021-05-07 12:59:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:59:15] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2021-05-07 12:59:15] [INFO ] [Nat]Absence check using 18 positive and 54 generalized place invariants in 10 ms returned sat
[2021-05-07 12:59:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:17] [INFO ] [Nat]Absence check using state equation in 2057 ms returned unsat
[2021-05-07 12:59:17] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 12:59:17] [INFO ] [Real]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 12:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:17] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2021-05-07 12:59:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:59:17] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2021-05-07 12:59:17] [INFO ] [Nat]Absence check using 18 positive and 54 generalized place invariants in 13 ms returned sat
[2021-05-07 12:59:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:21] [INFO ] [Nat]Absence check using state equation in 3545 ms returned unsat
[2021-05-07 12:59:21] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 12:59:21] [INFO ] [Real]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 12:59:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:21] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2021-05-07 12:59:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:59:21] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2021-05-07 12:59:21] [INFO ] [Nat]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 12:59:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:22] [INFO ] [Nat]Absence check using state equation in 519 ms returned unsat
[2021-05-07 12:59:22] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2021-05-07 12:59:22] [INFO ] [Real]Absence check using 18 positive and 54 generalized place invariants in 12 ms returned sat
[2021-05-07 12:59:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:22] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2021-05-07 12:59:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:59:22] [INFO ] [Nat]Absence check using 18 positive place invariants in 25 ms returned sat
[2021-05-07 12:59:22] [INFO ] [Nat]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 12:59:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:23] [INFO ] [Nat]Absence check using state equation in 931 ms returned unsat
[2021-05-07 12:59:23] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2021-05-07 12:59:23] [INFO ] [Real]Absence check using 18 positive and 54 generalized place invariants in 12 ms returned sat
[2021-05-07 12:59:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:23] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2021-05-07 12:59:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:59:23] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2021-05-07 12:59:23] [INFO ] [Nat]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 12:59:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:24] [INFO ] [Nat]Absence check using state equation in 823 ms returned unsat
[2021-05-07 12:59:24] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 12:59:24] [INFO ] [Real]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 12:59:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:25] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2021-05-07 12:59:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:59:25] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2021-05-07 12:59:25] [INFO ] [Nat]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 12:59:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:31] [INFO ] [Nat]Absence check using state equation in 6131 ms returned unknown
[2021-05-07 12:59:31] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2021-05-07 12:59:31] [INFO ] [Real]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 12:59:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:31] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2021-05-07 12:59:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:59:31] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 12:59:31] [INFO ] [Nat]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 12:59:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:35] [INFO ] [Nat]Absence check using state equation in 4312 ms returned unsat
[2021-05-07 12:59:35] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 12:59:36] [INFO ] [Real]Absence check using 18 positive and 54 generalized place invariants in 12 ms returned sat
[2021-05-07 12:59:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:36] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2021-05-07 12:59:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:59:36] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2021-05-07 12:59:36] [INFO ] [Nat]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 12:59:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:42] [INFO ] [Nat]Absence check using state equation in 6170 ms returned unknown
[2021-05-07 12:59:42] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 12:59:42] [INFO ] [Real]Absence check using 18 positive and 54 generalized place invariants in 10 ms returned sat
[2021-05-07 12:59:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:42] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2021-05-07 12:59:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:59:42] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2021-05-07 12:59:42] [INFO ] [Nat]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 12:59:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:49] [INFO ] [Nat]Absence check using state equation in 6207 ms returned unknown
[2021-05-07 12:59:49] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 12:59:49] [INFO ] [Real]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 12:59:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:49] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2021-05-07 12:59:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:59:49] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 12:59:49] [INFO ] [Nat]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 12:59:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:51] [INFO ] [Nat]Absence check using state equation in 1705 ms returned unsat
[2021-05-07 12:59:51] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 12:59:51] [INFO ] [Real]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 12:59:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:51] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2021-05-07 12:59:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:59:51] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2021-05-07 12:59:51] [INFO ] [Nat]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 12:59:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:57] [INFO ] [Nat]Absence check using state equation in 6166 ms returned unknown
[2021-05-07 12:59:57] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 12:59:57] [INFO ] [Real]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 12:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:59:58] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2021-05-07 12:59:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:59:58] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 12:59:58] [INFO ] [Nat]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 12:59:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:00:00] [INFO ] [Nat]Absence check using state equation in 2478 ms returned unsat
[2021-05-07 13:00:00] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 13:00:00] [INFO ] [Real]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 13:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:00:00] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2021-05-07 13:00:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:00:01] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 13:00:01] [INFO ] [Nat]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 13:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:00:03] [INFO ] [Nat]Absence check using state equation in 2457 ms returned unsat
[2021-05-07 13:00:03] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 13:00:03] [INFO ] [Real]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 13:00:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:00:03] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2021-05-07 13:00:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:00:03] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 13:00:03] [INFO ] [Nat]Absence check using 18 positive and 54 generalized place invariants in 10 ms returned sat
[2021-05-07 13:00:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:00:04] [INFO ] [Nat]Absence check using state equation in 504 ms returned unsat
[2021-05-07 13:00:04] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned unsat
[2021-05-07 13:00:04] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 13:00:04] [INFO ] [Real]Absence check using 18 positive and 54 generalized place invariants in 10 ms returned sat
[2021-05-07 13:00:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:00:04] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2021-05-07 13:00:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:00:04] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 13:00:04] [INFO ] [Nat]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 13:00:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:00:11] [INFO ] [Nat]Absence check using state equation in 6176 ms returned unknown
[2021-05-07 13:00:11] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2021-05-07 13:00:11] [INFO ] [Real]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 13:00:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:00:11] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2021-05-07 13:00:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:00:11] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2021-05-07 13:00:11] [INFO ] [Nat]Absence check using 18 positive and 54 generalized place invariants in 11 ms returned sat
[2021-05-07 13:00:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:00:14] [INFO ] [Nat]Absence check using state equation in 3165 ms returned unknown
Successfully simplified 11 atomic propositions for a total of 15 simplifications.
[2021-05-07 13:00:14] [INFO ] Initial state test concluded for 2 properties.
FORMULA ASLink-PT-02a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 943/943 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 548 transition count 933
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 548 transition count 933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 548 transition count 932
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 546 transition count 923
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 546 transition count 923
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 545 transition count 915
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 545 transition count 915
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 544 transition count 907
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 544 transition count 907
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 543 transition count 899
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 543 transition count 899
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 542 transition count 891
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 542 transition count 891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 541 transition count 883
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 541 transition count 883
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 540 transition count 875
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 540 transition count 875
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 539 transition count 867
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 539 transition count 867
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 538 transition count 859
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 538 transition count 859
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 537 transition count 851
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 537 transition count 851
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 536 transition count 843
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 536 transition count 843
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 535 transition count 835
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 535 transition count 835
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 534 transition count 827
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 534 transition count 827
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 533 transition count 819
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 533 transition count 819
Applied a total of 37 rules in 243 ms. Remains 533 /551 variables (removed 18) and now considering 819/943 (removed 124) transitions.
// Phase 1: matrix 819 rows 533 cols
[2021-05-07 13:00:14] [INFO ] Computed 72 place invariants in 6 ms
[2021-05-07 13:00:15] [INFO ] Implicit Places using invariants in 255 ms returned [46, 228, 393, 411, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 264 ms to find 5 implicit places.
// Phase 1: matrix 819 rows 528 cols
[2021-05-07 13:00:15] [INFO ] Computed 67 place invariants in 6 ms
[2021-05-07 13:00:15] [INFO ] Dead Transitions using invariants and state equation in 374 ms returned []
Starting structural reductions, iteration 1 : 528/551 places, 819/943 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 526 transition count 817
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 526 transition count 817
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 524 transition count 815
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 524 transition count 815
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 522 transition count 813
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 522 transition count 813
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 521 transition count 812
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 521 transition count 812
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 520 transition count 811
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 520 transition count 811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 519 transition count 810
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 519 transition count 810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 518 transition count 809
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 518 transition count 809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 517 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 517 transition count 808
Applied a total of 22 rules in 67 ms. Remains 517 /528 variables (removed 11) and now considering 808/819 (removed 11) transitions.
// Phase 1: matrix 808 rows 517 cols
[2021-05-07 13:00:15] [INFO ] Computed 67 place invariants in 6 ms
[2021-05-07 13:00:15] [INFO ] Implicit Places using invariants in 194 ms returned []
// Phase 1: matrix 808 rows 517 cols
[2021-05-07 13:00:15] [INFO ] Computed 67 place invariants in 8 ms
[2021-05-07 13:00:16] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 517/551 places, 808/943 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-02a-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s121 1), p0:(AND (EQ s381 1) (EQ s414 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-02a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-02 finished in 2110 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 943/943 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 548 transition count 933
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 548 transition count 933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 548 transition count 932
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 546 transition count 923
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 546 transition count 923
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 545 transition count 915
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 545 transition count 915
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 544 transition count 907
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 544 transition count 907
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 543 transition count 899
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 543 transition count 899
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 542 transition count 891
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 542 transition count 891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 541 transition count 883
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 541 transition count 883
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 540 transition count 875
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 540 transition count 875
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 539 transition count 867
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 539 transition count 867
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 538 transition count 859
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 538 transition count 859
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 537 transition count 851
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 537 transition count 851
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 536 transition count 843
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 536 transition count 843
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 535 transition count 835
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 535 transition count 835
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 534 transition count 827
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 534 transition count 827
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 533 transition count 819
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 533 transition count 819
Applied a total of 37 rules in 106 ms. Remains 533 /551 variables (removed 18) and now considering 819/943 (removed 124) transitions.
// Phase 1: matrix 819 rows 533 cols
[2021-05-07 13:00:16] [INFO ] Computed 72 place invariants in 6 ms
[2021-05-07 13:00:17] [INFO ] Implicit Places using invariants in 224 ms returned [228, 393, 411, 471]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 225 ms to find 4 implicit places.
// Phase 1: matrix 819 rows 529 cols
[2021-05-07 13:00:17] [INFO ] Computed 68 place invariants in 6 ms
[2021-05-07 13:00:17] [INFO ] Dead Transitions using invariants and state equation in 320 ms returned []
Starting structural reductions, iteration 1 : 529/551 places, 819/943 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 527 transition count 817
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 527 transition count 817
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 525 transition count 815
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 525 transition count 815
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 523 transition count 813
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 523 transition count 813
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 522 transition count 812
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 522 transition count 812
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 521 transition count 811
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 521 transition count 811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 520 transition count 810
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 520 transition count 810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 519 transition count 809
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 519 transition count 809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 518 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 518 transition count 808
Applied a total of 22 rules in 110 ms. Remains 518 /529 variables (removed 11) and now considering 808/819 (removed 11) transitions.
// Phase 1: matrix 808 rows 518 cols
[2021-05-07 13:00:17] [INFO ] Computed 68 place invariants in 6 ms
[2021-05-07 13:00:17] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 808 rows 518 cols
[2021-05-07 13:00:17] [INFO ] Computed 68 place invariants in 9 ms
[2021-05-07 13:00:18] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 518/551 places, 808/943 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ASLink-PT-02a-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (NEQ s13 1) (NEQ s72 1)), p0:(OR (NEQ s46 1) (NEQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1211 reset in 278 ms.
Product exploration explored 100000 steps with 1179 reset in 249 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 1183 reset in 180 ms.
Product exploration explored 100000 steps with 1189 reset in 197 ms.
Applying partial POR strategy [true, false, true, false, true]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Support contains 4 out of 518 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 518/518 places, 808/808 transitions.
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 518 transition count 808
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 85 place count 518 transition count 859
Deduced a syphon composed of 125 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 125 place count 518 transition count 859
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 144 place count 499 transition count 840
Deduced a syphon composed of 108 places in 1 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 163 place count 499 transition count 840
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 163 place count 499 transition count 840
Deduced a syphon composed of 109 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 499 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 498 transition count 839
Deduced a syphon composed of 108 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 498 transition count 839
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 176 places in 1 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 234 place count 498 transition count 847
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 263 place count 469 transition count 818
Deduced a syphon composed of 147 places in 2 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 292 place count 469 transition count 818
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 149 places in 2 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 294 place count 469 transition count 826
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 295 place count 469 transition count 830
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 297 place count 467 transition count 824
Deduced a syphon composed of 148 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 299 place count 467 transition count 824
Deduced a syphon composed of 148 places in 1 ms
Applied a total of 299 rules in 182 ms. Remains 467 /518 variables (removed 51) and now considering 824/808 (removed -16) transitions.
[2021-05-07 13:00:20] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 824 rows 467 cols
[2021-05-07 13:00:20] [INFO ] Computed 68 place invariants in 7 ms
[2021-05-07 13:00:20] [INFO ] Dead Transitions using invariants and state equation in 373 ms returned []
Finished structural reductions, in 1 iterations. Remains : 467/518 places, 824/808 transitions.
Product exploration explored 100000 steps with 1980 reset in 418 ms.
Product exploration explored 100000 steps with 2018 reset in 338 ms.
[2021-05-07 13:00:21] [INFO ] Flatten gal took : 44 ms
[2021-05-07 13:00:21] [INFO ] Flatten gal took : 40 ms
[2021-05-07 13:00:21] [INFO ] Time to serialize gal into /tmp/LTL6508253240058183254.gal : 18 ms
[2021-05-07 13:00:21] [INFO ] Time to serialize properties into /tmp/LTL9167489522087228853.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6508253240058183254.gal, -t, CGAL, -LTL, /tmp/LTL9167489522087228853.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6508253240058183254.gal -t CGAL -LTL /tmp/LTL9167489522087228853.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("((p54!=1)||(p132!=1))"))&&(X(G("((p14!=1)||(p81!=1))"))))))
Formula 0 simplified : !X(F"((p54!=1)||(p132!=1))" & XG"((p14!=1)||(p81!=1))")
Detected timeout of ITS tools.
[2021-05-07 13:00:36] [INFO ] Flatten gal took : 36 ms
[2021-05-07 13:00:36] [INFO ] Applying decomposition
[2021-05-07 13:00:36] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16063603768765284142.txt, -o, /tmp/graph16063603768765284142.bin, -w, /tmp/graph16063603768765284142.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16063603768765284142.bin, -l, -1, -v, -w, /tmp/graph16063603768765284142.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 13:00:36] [INFO ] Decomposing Gal with order
[2021-05-07 13:00:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 13:00:36] [INFO ] Removed a total of 1138 redundant transitions.
[2021-05-07 13:00:36] [INFO ] Flatten gal took : 95 ms
[2021-05-07 13:00:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 18 ms.
[2021-05-07 13:00:36] [INFO ] Time to serialize gal into /tmp/LTL11406844734535127194.gal : 9 ms
[2021-05-07 13:00:36] [INFO ] Time to serialize properties into /tmp/LTL15449985073702499197.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11406844734535127194.gal, -t, CGAL, -LTL, /tmp/LTL15449985073702499197.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11406844734535127194.gal -t CGAL -LTL /tmp/LTL15449985073702499197.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("((i2.i1.u17.p54!=1)||(i2.i0.u37.p132!=1))"))&&(X(G("((i0.u5.p14!=1)||(i0.u22.p81!=1))"))))))
Formula 0 simplified : !X(F"((i2.i1.u17.p54!=1)||(i2.i0.u37.p132!=1))" & XG"((i0.u5.p14!=1)||(i0.u22.p81!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7327405077364549227
[2021-05-07 13:00:52] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7327405077364549227
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7327405077364549227]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7327405077364549227] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7327405077364549227] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ASLink-PT-02a-04 finished in 36260 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 943/943 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 548 transition count 933
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 548 transition count 933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 548 transition count 932
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 546 transition count 923
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 546 transition count 923
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 545 transition count 915
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 545 transition count 915
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 544 transition count 907
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 544 transition count 907
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 543 transition count 899
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 543 transition count 899
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 542 transition count 891
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 542 transition count 891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 541 transition count 883
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 541 transition count 883
Applied a total of 21 rules in 108 ms. Remains 541 /551 variables (removed 10) and now considering 883/943 (removed 60) transitions.
// Phase 1: matrix 883 rows 541 cols
[2021-05-07 13:00:53] [INFO ] Computed 72 place invariants in 9 ms
[2021-05-07 13:00:53] [INFO ] Implicit Places using invariants in 260 ms returned [46, 228, 393, 419, 479]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 262 ms to find 5 implicit places.
// Phase 1: matrix 883 rows 536 cols
[2021-05-07 13:00:53] [INFO ] Computed 67 place invariants in 6 ms
[2021-05-07 13:00:53] [INFO ] Dead Transitions using invariants and state equation in 384 ms returned []
Starting structural reductions, iteration 1 : 536/551 places, 883/943 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 534 transition count 881
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 534 transition count 881
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 532 transition count 879
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 532 transition count 879
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 530 transition count 877
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 530 transition count 877
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 529 transition count 876
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 529 transition count 876
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 528 transition count 875
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 528 transition count 875
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 527 transition count 874
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 527 transition count 874
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 526 transition count 873
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 526 transition count 873
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 525 transition count 872
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 525 transition count 872
Applied a total of 22 rules in 73 ms. Remains 525 /536 variables (removed 11) and now considering 872/883 (removed 11) transitions.
// Phase 1: matrix 872 rows 525 cols
[2021-05-07 13:00:53] [INFO ] Computed 67 place invariants in 5 ms
[2021-05-07 13:00:54] [INFO ] Implicit Places using invariants in 209 ms returned []
// Phase 1: matrix 872 rows 525 cols
[2021-05-07 13:00:54] [INFO ] Computed 67 place invariants in 7 ms
[2021-05-07 13:00:54] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 525/551 places, 872/943 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : ASLink-PT-02a-06 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s223 1) (EQ s408 1)), p1:(AND (EQ s384 1) (EQ s424 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-06 finished in 1863 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 943/943 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 551 transition count 866
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 154 place count 474 transition count 866
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 154 place count 474 transition count 810
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 131 rules applied. Total rules applied 285 place count 399 transition count 810
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 19 rules applied. Total rules applied 304 place count 393 transition count 797
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 317 place count 380 transition count 797
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 317 place count 380 transition count 793
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 325 place count 376 transition count 793
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 331 place count 370 transition count 780
Iterating global reduction 4 with 6 rules applied. Total rules applied 337 place count 370 transition count 780
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 341 place count 370 transition count 776
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 342 place count 369 transition count 776
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 342 place count 369 transition count 775
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 344 place count 368 transition count 775
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 346 place count 366 transition count 766
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 366 transition count 766
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 349 place count 366 transition count 765
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 350 place count 365 transition count 765
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 351 place count 364 transition count 757
Iterating global reduction 8 with 1 rules applied. Total rules applied 352 place count 364 transition count 757
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 353 place count 363 transition count 749
Iterating global reduction 8 with 1 rules applied. Total rules applied 354 place count 363 transition count 749
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 355 place count 362 transition count 741
Iterating global reduction 8 with 1 rules applied. Total rules applied 356 place count 362 transition count 741
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 357 place count 361 transition count 733
Iterating global reduction 8 with 1 rules applied. Total rules applied 358 place count 361 transition count 733
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 359 place count 360 transition count 725
Iterating global reduction 8 with 1 rules applied. Total rules applied 360 place count 360 transition count 725
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 361 place count 359 transition count 717
Iterating global reduction 8 with 1 rules applied. Total rules applied 362 place count 359 transition count 717
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 363 place count 358 transition count 709
Iterating global reduction 8 with 1 rules applied. Total rules applied 364 place count 358 transition count 709
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 365 place count 357 transition count 701
Iterating global reduction 8 with 1 rules applied. Total rules applied 366 place count 357 transition count 701
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 367 place count 356 transition count 693
Iterating global reduction 8 with 1 rules applied. Total rules applied 368 place count 356 transition count 693
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 369 place count 355 transition count 685
Iterating global reduction 8 with 1 rules applied. Total rules applied 370 place count 355 transition count 685
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 371 place count 354 transition count 677
Iterating global reduction 8 with 1 rules applied. Total rules applied 372 place count 354 transition count 677
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 373 place count 353 transition count 669
Iterating global reduction 8 with 1 rules applied. Total rules applied 374 place count 353 transition count 669
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 375 place count 352 transition count 661
Iterating global reduction 8 with 1 rules applied. Total rules applied 376 place count 352 transition count 661
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 8 with 66 rules applied. Total rules applied 442 place count 319 transition count 628
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 444 place count 318 transition count 628
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 445 place count 318 transition count 628
Applied a total of 445 rules in 207 ms. Remains 318 /551 variables (removed 233) and now considering 628/943 (removed 315) transitions.
// Phase 1: matrix 628 rows 318 cols
[2021-05-07 13:00:55] [INFO ] Computed 47 place invariants in 6 ms
[2021-05-07 13:00:55] [INFO ] Implicit Places using invariants in 183 ms returned [38, 95, 103, 109, 125, 143, 240, 241, 259, 297, 308]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 184 ms to find 11 implicit places.
[2021-05-07 13:00:55] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 628 rows 307 cols
[2021-05-07 13:00:55] [INFO ] Computed 36 place invariants in 5 ms
[2021-05-07 13:00:55] [INFO ] Dead Transitions using invariants and state equation in 223 ms returned []
Starting structural reductions, iteration 1 : 307/551 places, 628/943 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 307 transition count 617
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 296 transition count 617
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 22 place count 296 transition count 609
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 38 place count 288 transition count 609
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 284 transition count 605
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 284 transition count 605
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 281 transition count 602
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 281 transition count 602
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 279 transition count 600
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 279 transition count 600
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 278 transition count 599
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 278 transition count 599
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 90 place count 262 transition count 583
Applied a total of 90 rules in 59 ms. Remains 262 /307 variables (removed 45) and now considering 583/628 (removed 45) transitions.
// Phase 1: matrix 583 rows 262 cols
[2021-05-07 13:00:55] [INFO ] Computed 36 place invariants in 4 ms
[2021-05-07 13:00:55] [INFO ] Implicit Places using invariants in 144 ms returned [93, 96, 173, 180, 185, 187, 190]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 145 ms to find 7 implicit places.
Starting structural reductions, iteration 2 : 255/551 places, 583/943 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 255 transition count 581
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 253 transition count 581
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 249 transition count 577
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 249 transition count 577
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 249 transition count 575
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 16 place count 247 transition count 573
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 247 transition count 573
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 246 transition count 572
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 246 transition count 572
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 244 transition count 570
Applied a total of 24 rules in 40 ms. Remains 244 /255 variables (removed 11) and now considering 570/583 (removed 13) transitions.
// Phase 1: matrix 570 rows 244 cols
[2021-05-07 13:00:55] [INFO ] Computed 29 place invariants in 4 ms
[2021-05-07 13:00:55] [INFO ] Implicit Places using invariants in 129 ms returned [72, 151]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 130 ms to find 2 implicit places.
Starting structural reductions, iteration 3 : 242/551 places, 570/943 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 240 transition count 568
Applied a total of 4 rules in 13 ms. Remains 240 /242 variables (removed 2) and now considering 568/570 (removed 2) transitions.
// Phase 1: matrix 568 rows 240 cols
[2021-05-07 13:00:55] [INFO ] Computed 27 place invariants in 4 ms
[2021-05-07 13:00:56] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 568 rows 240 cols
[2021-05-07 13:00:56] [INFO ] Computed 27 place invariants in 9 ms
[2021-05-07 13:00:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-07 13:00:56] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Finished structural reductions, in 4 iterations. Remains : 240/551 places, 568/943 transitions.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-02a-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s165 1) (NEQ s171 1)), p1:(OR (EQ s235 0) (EQ s237 0) (EQ s239 0))], nbAcceptance=2, 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 1973 reset in 353 ms.
Product exploration explored 100000 steps with 1929 reset in 261 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 21 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1918 reset in 212 ms.
Product exploration explored 100000 steps with 1980 reset in 217 ms.
[2021-05-07 13:00:57] [INFO ] Flatten gal took : 26 ms
[2021-05-07 13:00:57] [INFO ] Flatten gal took : 24 ms
[2021-05-07 13:00:57] [INFO ] Time to serialize gal into /tmp/LTL7151526345151267197.gal : 4 ms
[2021-05-07 13:00:57] [INFO ] Time to serialize properties into /tmp/LTL16767679231128933038.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7151526345151267197.gal, -t, CGAL, -LTL, /tmp/LTL16767679231128933038.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7151526345151267197.gal -t CGAL -LTL /tmp/LTL16767679231128933038.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((p351!=1)||(p405!=1))"))||(G("(((p621==0)||(p623==0))||(p625==0))")))))
Formula 0 simplified : !F(G"((p351!=1)||(p405!=1))" | G"(((p621==0)||(p623==0))||(p625==0))")
Detected timeout of ITS tools.
[2021-05-07 13:01:12] [INFO ] Flatten gal took : 31 ms
[2021-05-07 13:01:12] [INFO ] Applying decomposition
[2021-05-07 13:01:12] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3013511031200679383.txt, -o, /tmp/graph3013511031200679383.bin, -w, /tmp/graph3013511031200679383.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3013511031200679383.bin, -l, -1, -v, -w, /tmp/graph3013511031200679383.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 13:01:12] [INFO ] Decomposing Gal with order
[2021-05-07 13:01:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 13:01:12] [INFO ] Removed a total of 1162 redundant transitions.
[2021-05-07 13:01:12] [INFO ] Flatten gal took : 45 ms
[2021-05-07 13:01:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 9 ms.
[2021-05-07 13:01:12] [INFO ] Time to serialize gal into /tmp/LTL2286147940858955180.gal : 3 ms
[2021-05-07 13:01:12] [INFO ] Time to serialize properties into /tmp/LTL15971493255745047562.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2286147940858955180.gal, -t, CGAL, -LTL, /tmp/LTL15971493255745047562.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2286147940858955180.gal -t CGAL -LTL /tmp/LTL15971493255745047562.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("((i4.u46.p351!=1)||(i4.u47.p405!=1))"))||(G("(((i5.u67.p621==0)||(i5.u68.p623==0))||(i5.u69.p625==0))")))))
Formula 0 simplified : !F(G"((i4.u46.p351!=1)||(i4.u47.p405!=1))" | G"(((i5.u67.p621==0)||(i5.u68.p623==0))||(i5.u69.p625==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7331652228902527443
[2021-05-07 13:01:27] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7331652228902527443
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7331652228902527443]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7331652228902527443] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7331652228902527443] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ASLink-PT-02a-07 finished in 34127 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 943/943 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 550 transition count 865
Reduce places removed 79 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 81 rules applied. Total rules applied 158 place count 471 transition count 863
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 160 place count 469 transition count 863
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 160 place count 469 transition count 800
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 306 place count 386 transition count 800
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 3 with 26 rules applied. Total rules applied 332 place count 377 transition count 783
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 20 rules applied. Total rules applied 352 place count 359 transition count 781
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 354 place count 357 transition count 781
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 354 place count 357 transition count 772
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 372 place count 348 transition count 772
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 381 place count 339 transition count 756
Iterating global reduction 6 with 9 rules applied. Total rules applied 390 place count 339 transition count 756
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 10 rules applied. Total rules applied 400 place count 338 transition count 747
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 403 place count 335 transition count 747
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 403 place count 335 transition count 746
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 405 place count 334 transition count 746
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 407 place count 332 transition count 737
Iterating global reduction 8 with 2 rules applied. Total rules applied 409 place count 332 transition count 737
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 410 place count 332 transition count 736
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 411 place count 331 transition count 736
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 412 place count 330 transition count 728
Iterating global reduction 10 with 1 rules applied. Total rules applied 413 place count 330 transition count 728
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 414 place count 329 transition count 720
Iterating global reduction 10 with 1 rules applied. Total rules applied 415 place count 329 transition count 720
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 416 place count 328 transition count 712
Iterating global reduction 10 with 1 rules applied. Total rules applied 417 place count 328 transition count 712
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 418 place count 327 transition count 704
Iterating global reduction 10 with 1 rules applied. Total rules applied 419 place count 327 transition count 704
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 420 place count 326 transition count 696
Iterating global reduction 10 with 1 rules applied. Total rules applied 421 place count 326 transition count 696
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 422 place count 325 transition count 688
Iterating global reduction 10 with 1 rules applied. Total rules applied 423 place count 325 transition count 688
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 424 place count 324 transition count 680
Iterating global reduction 10 with 1 rules applied. Total rules applied 425 place count 324 transition count 680
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 426 place count 323 transition count 672
Iterating global reduction 10 with 1 rules applied. Total rules applied 427 place count 323 transition count 672
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 428 place count 322 transition count 664
Iterating global reduction 10 with 1 rules applied. Total rules applied 429 place count 322 transition count 664
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 430 place count 321 transition count 656
Iterating global reduction 10 with 1 rules applied. Total rules applied 431 place count 321 transition count 656
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 432 place count 320 transition count 648
Iterating global reduction 10 with 1 rules applied. Total rules applied 433 place count 320 transition count 648
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 434 place count 319 transition count 640
Iterating global reduction 10 with 1 rules applied. Total rules applied 435 place count 319 transition count 640
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 436 place count 318 transition count 632
Iterating global reduction 10 with 1 rules applied. Total rules applied 437 place count 318 transition count 632
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 10 with 64 rules applied. Total rules applied 501 place count 286 transition count 600
Applied a total of 501 rules in 124 ms. Remains 286 /551 variables (removed 265) and now considering 600/943 (removed 343) transitions.
// Phase 1: matrix 600 rows 286 cols
[2021-05-07 13:01:29] [INFO ] Computed 39 place invariants in 11 ms
[2021-05-07 13:01:29] [INFO ] Implicit Places using invariants in 173 ms returned [38, 73, 94, 102, 108, 133, 168, 189, 197, 203, 205, 234, 272, 283]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 174 ms to find 14 implicit places.
[2021-05-07 13:01:29] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 600 rows 272 cols
[2021-05-07 13:01:29] [INFO ] Computed 25 place invariants in 9 ms
[2021-05-07 13:01:29] [INFO ] Dead Transitions using invariants and state equation in 235 ms returned []
Starting structural reductions, iteration 1 : 272/551 places, 600/943 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 272 transition count 590
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 262 transition count 590
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 26 place count 256 transition count 584
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 256 transition count 584
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 37 place count 251 transition count 579
Iterating global reduction 2 with 5 rules applied. Total rules applied 42 place count 251 transition count 579
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 248 transition count 576
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 248 transition count 576
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 247 transition count 575
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 247 transition count 575
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 84 place count 230 transition count 558
Applied a total of 84 rules in 34 ms. Remains 230 /272 variables (removed 42) and now considering 558/600 (removed 42) transitions.
// Phase 1: matrix 558 rows 230 cols
[2021-05-07 13:01:29] [INFO ] Computed 25 place invariants in 4 ms
[2021-05-07 13:01:29] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 558 rows 230 cols
[2021-05-07 13:01:29] [INFO ] Computed 25 place invariants in 8 ms
[2021-05-07 13:01:30] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 230/551 places, 558/943 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-02a-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s176 1) (EQ s200 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-09 finished in 1108 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 943/943 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 548 transition count 933
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 548 transition count 933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 548 transition count 932
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 546 transition count 923
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 546 transition count 923
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 545 transition count 915
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 545 transition count 915
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 544 transition count 907
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 544 transition count 907
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 543 transition count 899
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 543 transition count 899
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 542 transition count 891
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 542 transition count 891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 541 transition count 883
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 541 transition count 883
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 540 transition count 875
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 540 transition count 875
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 539 transition count 867
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 539 transition count 867
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 538 transition count 859
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 538 transition count 859
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 537 transition count 851
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 537 transition count 851
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 536 transition count 843
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 536 transition count 843
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 535 transition count 835
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 535 transition count 835
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 534 transition count 827
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 534 transition count 827
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 533 transition count 819
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 533 transition count 819
Applied a total of 37 rules in 141 ms. Remains 533 /551 variables (removed 18) and now considering 819/943 (removed 124) transitions.
// Phase 1: matrix 819 rows 533 cols
[2021-05-07 13:01:30] [INFO ] Computed 72 place invariants in 6 ms
[2021-05-07 13:01:30] [INFO ] Implicit Places using invariants in 227 ms returned [46, 393, 411, 471]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 228 ms to find 4 implicit places.
// Phase 1: matrix 819 rows 529 cols
[2021-05-07 13:01:30] [INFO ] Computed 68 place invariants in 8 ms
[2021-05-07 13:01:30] [INFO ] Dead Transitions using invariants and state equation in 418 ms returned []
Starting structural reductions, iteration 1 : 529/551 places, 819/943 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 527 transition count 817
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 527 transition count 817
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 525 transition count 815
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 525 transition count 815
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 523 transition count 813
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 523 transition count 813
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 522 transition count 812
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 522 transition count 812
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 521 transition count 811
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 521 transition count 811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 520 transition count 810
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 520 transition count 810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 519 transition count 809
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 519 transition count 809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 518 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 518 transition count 808
Applied a total of 22 rules in 74 ms. Remains 518 /529 variables (removed 11) and now considering 808/819 (removed 11) transitions.
// Phase 1: matrix 808 rows 518 cols
[2021-05-07 13:01:30] [INFO ] Computed 68 place invariants in 5 ms
[2021-05-07 13:01:31] [INFO ] Implicit Places using invariants in 211 ms returned []
// Phase 1: matrix 808 rows 518 cols
[2021-05-07 13:01:31] [INFO ] Computed 68 place invariants in 5 ms
[2021-05-07 13:01:32] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 1037 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 518/551 places, 808/943 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02a-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s180 1) (AND (EQ s227 1) (EQ s344 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 601 ms.
Product exploration explored 100000 steps with 50000 reset in 630 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 585 ms.
Product exploration explored 100000 steps with 50000 reset in 595 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 518 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 518/518 places, 808/808 transitions.
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 518 transition count 808
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 39 Pre rules applied. Total rules applied 84 place count 518 transition count 859
Deduced a syphon composed of 123 places in 1 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 123 place count 518 transition count 859
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 140 place count 501 transition count 842
Deduced a syphon composed of 108 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 157 place count 501 transition count 842
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 157 place count 501 transition count 842
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 158 place count 501 transition count 842
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 159 place count 500 transition count 841
Deduced a syphon composed of 108 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 160 place count 500 transition count 841
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 176 places in 1 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 228 place count 500 transition count 849
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 257 place count 471 transition count 820
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 286 place count 471 transition count 820
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 149 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 288 place count 471 transition count 828
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 289 place count 471 transition count 832
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 291 place count 469 transition count 826
Deduced a syphon composed of 148 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 293 place count 469 transition count 826
Deduced a syphon composed of 148 places in 1 ms
Applied a total of 293 rules in 77 ms. Remains 469 /518 variables (removed 49) and now considering 826/808 (removed -18) transitions.
[2021-05-07 13:01:34] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 826 rows 469 cols
[2021-05-07 13:01:34] [INFO ] Computed 68 place invariants in 6 ms
[2021-05-07 13:01:35] [INFO ] Dead Transitions using invariants and state equation in 336 ms returned []
Finished structural reductions, in 1 iterations. Remains : 469/518 places, 826/808 transitions.
Product exploration explored 100000 steps with 50000 reset in 2488 ms.
Product exploration explored 100000 steps with 50000 reset in 2501 ms.
[2021-05-07 13:01:40] [INFO ] Flatten gal took : 28 ms
[2021-05-07 13:01:40] [INFO ] Flatten gal took : 27 ms
[2021-05-07 13:01:40] [INFO ] Time to serialize gal into /tmp/LTL1599818768562101797.gal : 3 ms
[2021-05-07 13:01:40] [INFO ] Time to serialize properties into /tmp/LTL3374557831642603537.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1599818768562101797.gal, -t, CGAL, -LTL, /tmp/LTL3374557831642603537.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1599818768562101797.gal -t CGAL -LTL /tmp/LTL3374557831642603537.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p192!=1)||((p248==1)&&(p368==1)))"))))
Formula 0 simplified : !XF"((p192!=1)||((p248==1)&&(p368==1)))"
Detected timeout of ITS tools.
[2021-05-07 13:01:55] [INFO ] Flatten gal took : 27 ms
[2021-05-07 13:01:55] [INFO ] Applying decomposition
[2021-05-07 13:01:55] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14997506437087005175.txt, -o, /tmp/graph14997506437087005175.bin, -w, /tmp/graph14997506437087005175.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14997506437087005175.bin, -l, -1, -v, -w, /tmp/graph14997506437087005175.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 13:01:55] [INFO ] Decomposing Gal with order
[2021-05-07 13:01:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 13:01:55] [INFO ] Removed a total of 1158 redundant transitions.
[2021-05-07 13:01:55] [INFO ] Flatten gal took : 76 ms
[2021-05-07 13:01:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 9 ms.
[2021-05-07 13:01:55] [INFO ] Time to serialize gal into /tmp/LTL12404772449128782613.gal : 4 ms
[2021-05-07 13:01:55] [INFO ] Time to serialize properties into /tmp/LTL2097748812018279957.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12404772449128782613.gal, -t, CGAL, -LTL, /tmp/LTL2097748812018279957.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12404772449128782613.gal -t CGAL -LTL /tmp/LTL2097748812018279957.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i4.i1.u60.p192!=1)||((i7.i2.u76.p248==1)&&(i7.i2.u108.p368==1)))"))))
Formula 0 simplified : !XF"((i4.i1.u60.p192!=1)||((i7.i2.u76.p248==1)&&(i7.i2.u108.p368==1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8833627604217878000
[2021-05-07 13:02:10] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8833627604217878000
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8833627604217878000]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8833627604217878000] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8833627604217878000] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ASLink-PT-02a-11 finished in 41373 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 943/943 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 548 transition count 933
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 548 transition count 933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 548 transition count 932
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 546 transition count 923
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 546 transition count 923
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 545 transition count 915
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 545 transition count 915
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 544 transition count 907
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 544 transition count 907
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 543 transition count 899
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 543 transition count 899
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 542 transition count 891
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 542 transition count 891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 541 transition count 883
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 541 transition count 883
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 540 transition count 875
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 540 transition count 875
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 539 transition count 867
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 539 transition count 867
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 538 transition count 859
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 538 transition count 859
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 537 transition count 851
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 537 transition count 851
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 536 transition count 843
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 536 transition count 843
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 535 transition count 835
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 535 transition count 835
Applied a total of 33 rules in 117 ms. Remains 535 /551 variables (removed 16) and now considering 835/943 (removed 108) transitions.
// Phase 1: matrix 835 rows 535 cols
[2021-05-07 13:02:11] [INFO ] Computed 72 place invariants in 6 ms
[2021-05-07 13:02:11] [INFO ] Implicit Places using invariants in 215 ms returned [46, 228, 393, 413, 473]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 217 ms to find 5 implicit places.
// Phase 1: matrix 835 rows 530 cols
[2021-05-07 13:02:11] [INFO ] Computed 67 place invariants in 5 ms
[2021-05-07 13:02:12] [INFO ] Dead Transitions using invariants and state equation in 331 ms returned []
Starting structural reductions, iteration 1 : 530/551 places, 835/943 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 528 transition count 833
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 528 transition count 833
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 526 transition count 831
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 526 transition count 831
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 524 transition count 829
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 524 transition count 829
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 523 transition count 828
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 523 transition count 828
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 522 transition count 827
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 522 transition count 827
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 521 transition count 826
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 521 transition count 826
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 520 transition count 825
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 520 transition count 825
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 519 transition count 824
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 519 transition count 824
Applied a total of 22 rules in 75 ms. Remains 519 /530 variables (removed 11) and now considering 824/835 (removed 11) transitions.
// Phase 1: matrix 824 rows 519 cols
[2021-05-07 13:02:12] [INFO ] Computed 67 place invariants in 18 ms
[2021-05-07 13:02:12] [INFO ] Implicit Places using invariants in 206 ms returned []
// Phase 1: matrix 824 rows 519 cols
[2021-05-07 13:02:12] [INFO ] Computed 67 place invariants in 5 ms
[2021-05-07 13:02:13] [INFO ] Implicit Places using invariants and state equation in 845 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 519/551 places, 824/943 transitions.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02a-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s215 1) (NEQ s406 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1190 reset in 181 ms.
Product exploration explored 100000 steps with 1147 reset in 196 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1216 reset in 183 ms.
Product exploration explored 100000 steps with 1173 reset in 202 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 519 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 519/519 places, 824/824 transitions.
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 519 transition count 824
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 95 place count 519 transition count 875
Deduced a syphon composed of 135 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 135 place count 519 transition count 875
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 154 place count 500 transition count 856
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 173 place count 500 transition count 856
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 173 place count 500 transition count 856
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 500 transition count 856
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 175 place count 499 transition count 855
Deduced a syphon composed of 118 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 499 transition count 855
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 184 places in 1 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 242 place count 499 transition count 864
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 271 place count 470 transition count 835
Deduced a syphon composed of 155 places in 1 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 300 place count 470 transition count 835
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 157 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 302 place count 470 transition count 843
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 158 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 303 place count 470 transition count 847
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 305 place count 468 transition count 841
Deduced a syphon composed of 156 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 307 place count 468 transition count 841
Deduced a syphon composed of 156 places in 1 ms
Applied a total of 307 rules in 71 ms. Remains 468 /519 variables (removed 51) and now considering 841/824 (removed -17) transitions.
[2021-05-07 13:02:14] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 841 rows 468 cols
[2021-05-07 13:02:14] [INFO ] Computed 67 place invariants in 6 ms
[2021-05-07 13:02:14] [INFO ] Dead Transitions using invariants and state equation in 321 ms returned []
Finished structural reductions, in 1 iterations. Remains : 468/519 places, 841/824 transitions.
Product exploration explored 100000 steps with 2049 reset in 282 ms.
Product exploration explored 100000 steps with 2073 reset in 292 ms.
[2021-05-07 13:02:15] [INFO ] Flatten gal took : 30 ms
[2021-05-07 13:02:15] [INFO ] Flatten gal took : 25 ms
[2021-05-07 13:02:15] [INFO ] Time to serialize gal into /tmp/LTL14305595948554683533.gal : 3 ms
[2021-05-07 13:02:15] [INFO ] Time to serialize properties into /tmp/LTL16165371527649752995.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14305595948554683533.gal, -t, CGAL, -LTL, /tmp/LTL16165371527649752995.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14305595948554683533.gal -t CGAL -LTL /tmp/LTL16165371527649752995.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G("((p236!=1)||(p440!=1))"))))
Formula 0 simplified : !XG"((p236!=1)||(p440!=1))"
Detected timeout of ITS tools.
[2021-05-07 13:02:30] [INFO ] Flatten gal took : 34 ms
[2021-05-07 13:02:30] [INFO ] Applying decomposition
[2021-05-07 13:02:30] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10781426517437155377.txt, -o, /tmp/graph10781426517437155377.bin, -w, /tmp/graph10781426517437155377.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10781426517437155377.bin, -l, -1, -v, -w, /tmp/graph10781426517437155377.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 13:02:30] [INFO ] Decomposing Gal with order
[2021-05-07 13:02:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 13:02:30] [INFO ] Removed a total of 1200 redundant transitions.
[2021-05-07 13:02:30] [INFO ] Flatten gal took : 46 ms
[2021-05-07 13:02:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 10 ms.
[2021-05-07 13:02:30] [INFO ] Time to serialize gal into /tmp/LTL4526398923582981257.gal : 5 ms
[2021-05-07 13:02:30] [INFO ] Time to serialize properties into /tmp/LTL10599674629705312956.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4526398923582981257.gal, -t, CGAL, -LTL, /tmp/LTL10599674629705312956.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4526398923582981257.gal -t CGAL -LTL /tmp/LTL10599674629705312956.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G("((i9.i1.u67.p236!=1)||(i9.i1.u129.p440!=1))"))))
Formula 0 simplified : !XG"((i9.i1.u67.p236!=1)||(i9.i1.u129.p440!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1490028840664742347
[2021-05-07 13:02:45] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1490028840664742347
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1490028840664742347]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1490028840664742347] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1490028840664742347] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ASLink-PT-02a-13 finished in 35209 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(G(p0))&&(p1 U G(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 943/943 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 548 transition count 933
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 548 transition count 933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 548 transition count 932
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 546 transition count 923
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 546 transition count 923
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 545 transition count 915
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 545 transition count 915
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 544 transition count 907
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 544 transition count 907
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 543 transition count 899
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 543 transition count 899
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 542 transition count 891
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 542 transition count 891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 541 transition count 883
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 541 transition count 883
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 540 transition count 875
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 540 transition count 875
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 539 transition count 867
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 539 transition count 867
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 538 transition count 859
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 538 transition count 859
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 537 transition count 851
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 537 transition count 851
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 536 transition count 843
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 536 transition count 843
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 535 transition count 835
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 535 transition count 835
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 534 transition count 827
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 534 transition count 827
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 533 transition count 819
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 533 transition count 819
Applied a total of 37 rules in 131 ms. Remains 533 /551 variables (removed 18) and now considering 819/943 (removed 124) transitions.
// Phase 1: matrix 819 rows 533 cols
[2021-05-07 13:02:46] [INFO ] Computed 72 place invariants in 6 ms
[2021-05-07 13:02:47] [INFO ] Implicit Places using invariants in 216 ms returned [46, 228, 393]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 217 ms to find 3 implicit places.
// Phase 1: matrix 819 rows 530 cols
[2021-05-07 13:02:47] [INFO ] Computed 69 place invariants in 6 ms
[2021-05-07 13:02:47] [INFO ] Dead Transitions using invariants and state equation in 385 ms returned []
Starting structural reductions, iteration 1 : 530/551 places, 819/943 transitions.
Applied a total of 0 rules in 13 ms. Remains 530 /530 variables (removed 0) and now considering 819/819 (removed 0) transitions.
// Phase 1: matrix 819 rows 530 cols
[2021-05-07 13:02:47] [INFO ] Computed 69 place invariants in 5 ms
[2021-05-07 13:02:47] [INFO ] Dead Transitions using invariants and state equation in 333 ms returned []
Finished structural reductions, in 2 iterations. Remains : 530/551 places, 819/943 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : ASLink-PT-02a-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(OR p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s468 1) (EQ s473 1)), p1:(EQ s180 1), p0:(AND (EQ s408 1) (EQ s460 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-14 finished in 1272 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 551/551 places, 943/943 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 550 transition count 865
Reduce places removed 79 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 81 rules applied. Total rules applied 158 place count 471 transition count 863
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 160 place count 469 transition count 863
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 160 place count 469 transition count 800
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 306 place count 386 transition count 800
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 3 with 26 rules applied. Total rules applied 332 place count 377 transition count 783
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 20 rules applied. Total rules applied 352 place count 359 transition count 781
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 354 place count 357 transition count 781
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 354 place count 357 transition count 772
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 372 place count 348 transition count 772
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 381 place count 339 transition count 756
Iterating global reduction 6 with 9 rules applied. Total rules applied 390 place count 339 transition count 756
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 10 rules applied. Total rules applied 400 place count 338 transition count 747
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 403 place count 335 transition count 747
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 403 place count 335 transition count 746
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 405 place count 334 transition count 746
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 407 place count 332 transition count 737
Iterating global reduction 8 with 2 rules applied. Total rules applied 409 place count 332 transition count 737
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 410 place count 332 transition count 736
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 411 place count 331 transition count 736
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 412 place count 330 transition count 728
Iterating global reduction 10 with 1 rules applied. Total rules applied 413 place count 330 transition count 728
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 414 place count 329 transition count 720
Iterating global reduction 10 with 1 rules applied. Total rules applied 415 place count 329 transition count 720
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 416 place count 328 transition count 712
Iterating global reduction 10 with 1 rules applied. Total rules applied 417 place count 328 transition count 712
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 418 place count 327 transition count 704
Iterating global reduction 10 with 1 rules applied. Total rules applied 419 place count 327 transition count 704
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 420 place count 326 transition count 696
Iterating global reduction 10 with 1 rules applied. Total rules applied 421 place count 326 transition count 696
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 422 place count 325 transition count 688
Iterating global reduction 10 with 1 rules applied. Total rules applied 423 place count 325 transition count 688
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 424 place count 324 transition count 680
Iterating global reduction 10 with 1 rules applied. Total rules applied 425 place count 324 transition count 680
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 426 place count 323 transition count 672
Iterating global reduction 10 with 1 rules applied. Total rules applied 427 place count 323 transition count 672
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 428 place count 322 transition count 664
Iterating global reduction 10 with 1 rules applied. Total rules applied 429 place count 322 transition count 664
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 430 place count 321 transition count 656
Iterating global reduction 10 with 1 rules applied. Total rules applied 431 place count 321 transition count 656
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 432 place count 320 transition count 648
Iterating global reduction 10 with 1 rules applied. Total rules applied 433 place count 320 transition count 648
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 434 place count 319 transition count 640
Iterating global reduction 10 with 1 rules applied. Total rules applied 435 place count 319 transition count 640
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 436 place count 318 transition count 632
Iterating global reduction 10 with 1 rules applied. Total rules applied 437 place count 318 transition count 632
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 10 with 64 rules applied. Total rules applied 501 place count 286 transition count 600
Applied a total of 501 rules in 104 ms. Remains 286 /551 variables (removed 265) and now considering 600/943 (removed 343) transitions.
// Phase 1: matrix 600 rows 286 cols
[2021-05-07 13:02:48] [INFO ] Computed 39 place invariants in 5 ms
[2021-05-07 13:02:48] [INFO ] Implicit Places using invariants in 157 ms returned [38, 73, 94, 102, 108, 133, 168, 189, 197, 203, 205, 234, 272, 283]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 163 ms to find 14 implicit places.
[2021-05-07 13:02:48] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 600 rows 272 cols
[2021-05-07 13:02:48] [INFO ] Computed 25 place invariants in 4 ms
[2021-05-07 13:02:48] [INFO ] Dead Transitions using invariants and state equation in 208 ms returned []
Starting structural reductions, iteration 1 : 272/551 places, 600/943 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 272 transition count 590
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 262 transition count 590
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 26 place count 256 transition count 584
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 256 transition count 584
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 37 place count 251 transition count 579
Iterating global reduction 2 with 5 rules applied. Total rules applied 42 place count 251 transition count 579
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 248 transition count 576
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 248 transition count 576
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 247 transition count 575
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 247 transition count 575
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 84 place count 230 transition count 558
Applied a total of 84 rules in 31 ms. Remains 230 /272 variables (removed 42) and now considering 558/600 (removed 42) transitions.
// Phase 1: matrix 558 rows 230 cols
[2021-05-07 13:02:48] [INFO ] Computed 25 place invariants in 4 ms
[2021-05-07 13:02:48] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 558 rows 230 cols
[2021-05-07 13:02:48] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-07 13:02:48] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 230/551 places, 558/943 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02a-15 automaton TGBA [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 s9 1) (EQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-15 finished in 1026 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2714132581525758462
[2021-05-07 13:02:49] [INFO ] Applying decomposition
[2021-05-07 13:02:49] [INFO ] Computing symmetric may disable matrix : 943 transitions.
[2021-05-07 13:02:49] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-07 13:02:49] [INFO ] Computing symmetric may enable matrix : 943 transitions.
[2021-05-07 13:02:49] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-07 13:02:49] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph689557588477791746.txt, -o, /tmp/graph689557588477791746.bin, -w, /tmp/graph689557588477791746.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph689557588477791746.bin, -l, -1, -v, -w, /tmp/graph689557588477791746.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 13:02:49] [INFO ] Decomposing Gal with order
[2021-05-07 13:02:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 13:02:49] [INFO ] Computing Do-Not-Accords matrix : 943 transitions.
[2021-05-07 13:02:49] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-07 13:02:49] [INFO ] Built C files in 199ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2714132581525758462
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2714132581525758462]
[2021-05-07 13:02:49] [INFO ] Removed a total of 1466 redundant transitions.
[2021-05-07 13:02:49] [INFO ] Flatten gal took : 119 ms
[2021-05-07 13:02:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 42 ms.
[2021-05-07 13:02:49] [INFO ] Time to serialize gal into /tmp/LTLFireability732639707120362312.gal : 9 ms
[2021-05-07 13:02:49] [INFO ] Time to serialize properties into /tmp/LTLFireability13561890019714360907.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability732639707120362312.gal, -t, CGAL, -LTL, /tmp/LTLFireability13561890019714360907.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability732639707120362312.gal -t CGAL -LTL /tmp/LTLFireability13561890019714360907.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((X((F(!("((i2.u19.p54==1)&&(i2.u40.p132==1))")))&&(X(G(!("((i1.u6.p14==1)&&(i1.u24.p81==1))")))))))
Formula 0 simplified : !X(F!"((i2.u19.p54==1)&&(i2.u40.p132==1))" & XG!"((i1.u6.p14==1)&&(i1.u24.p81==1))")
Compilation finished in 6237 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2714132581525758462]
Link finished in 61 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))&&X([]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2714132581525758462]
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t7, t8, t9, t23, t490, t838, t893, t920, t975, i0.t5, i2.u39.t117, i2.u45.t127, i2.u50.t137, i3.t4, i5.u93.t98, i5.u98.t88, i5.u105.t78, i6.t11, i6.t10, i6.t6, i8.t829, i8.t812, i8.t805, i8.t799, i8.t165, i8.t17, i8.u148.t172, i8.u150.t168, i9.i1.i0.t731, i9.i1.i0.t603, i10.t25, i10.t22, i10.t21, i10.t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :441/441/38/920
Computing Next relation with stutter on 2.68735e+06 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
6871 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,68.7729,1221280,1,0,2.00515e+06,114312,12217,3.63794e+06,1988,852064,4451250
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ASLink-PT-02a-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((G(!("((i6.u100.p351==1)&&(i7.u115.p405==1))")))||(G("(((i10.u172.p621==0)||(i10.u173.p623==0))||(i10.u174.p625==0))")))))
Formula 1 simplified : !F(G!"((i6.u100.p351==1)&&(i7.u115.p405==1))" | G"(((i10.u172.p621==0)||(i10.u173.p623==0))||(i10.u174.p625==0))")
Computing Next relation with stutter on 2.68735e+06 deadlock states
WARNING : LTSmin timed out (>240 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))&&X([]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2714132581525758462]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp2==true))||[]((LTLAPp3==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin2714132581525758462]
LTSmin run took 7417 ms.
FORMULA ASLink-PT-02a-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2714132581525758462]
LTSmin run took 295 ms.
FORMULA ASLink-PT-02a-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([]((LTLAPp5==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2714132581525758462]
WARNING : LTSmin timed out (>240 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([]((LTLAPp5==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2714132581525758462]
Retrying LTSmin with larger timeout 1920 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([]((LTLAPp5==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2714132581525758462]
Detected timeout of ITS tools.
[2021-05-07 13:24:02] [INFO ] Applying decomposition
[2021-05-07 13:24:02] [INFO ] Flatten gal took : 74 ms
[2021-05-07 13:24:02] [INFO ] Decomposing Gal with order
[2021-05-07 13:24:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 13:24:02] [INFO ] Removed a total of 1185 redundant transitions.
[2021-05-07 13:24:02] [INFO ] Flatten gal took : 198 ms
[2021-05-07 13:24:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 354 labels/synchronizations in 47 ms.
[2021-05-07 13:24:02] [INFO ] Time to serialize gal into /tmp/LTLFireability236379839112274454.gal : 4 ms
[2021-05-07 13:24:02] [INFO ] Time to serialize properties into /tmp/LTLFireability13839253903790822857.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability236379839112274454.gal, -t, CGAL, -LTL, /tmp/LTLFireability13839253903790822857.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability236379839112274454.gal -t CGAL -LTL /tmp/LTLFireability13839253903790822857.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("((((u39.p236==1)&&(u74.p440==1))&&(u75.p465==1))&&(i21.u81.p513==1))")||(G(!("((u39.p236==1)&&(u74.p440==1))"))))))
Formula 0 simplified : !X("((((u39.p236==1)&&(u74.p440==1))&&(u75.p465==1))&&(i21.u81.p513==1))" | G!"((u39.p236==1)&&(u74.p440==1))")
Reverse transition relation is NOT exact ! Due to transitions t460, t651, t799, t805, t812, t829, t838, t893, t920, t975, i5.t5, i5.t4, i5.t3, i5.t2, i5.t1, i5.t0, i5.u13.t117, i5.u18.t127, i5.u23.t137, i13.t11, i13.t10, i13.t9, i13.t8, i13.t7, i13.t6, i13.u48.t98, i13.u53.t88, i13.u58.t78, i21.t25, i21.t23, i21.t22, i21.t21, i21.t20, i21.t17, i21.u79.t172, i21.u81.t168, i21.u118.t165, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/237/37/274
Computing Next relation with stutter on 2.68735e+06 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3158 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,31.6239,587296,1,0,1.1435e+06,16072,4335,1.84689e+06,1118,82748,2793382
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ASLink-PT-02a-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
BK_STOP 1620393923180
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="ASLink-PT-02a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-02a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-tall-162037989400026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02a.tgz
mv ASLink-PT-02a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;