About the Execution of 2021-gold for DES-PT-40a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2280.384 | 501780.00 | 941678.00 | 1293.90 | TTTFFFTFFFFTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r046-smll-165252115900188.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is DES-PT-40a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r046-smll-165252115900188
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.7K Apr 29 15:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 15:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 29 15:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 29 15:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 29 16:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 29 16:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 29 15:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 29 15:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 83K May 10 09:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1655073791238
Running Version 0
[2022-06-12 22:43:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 22:43:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 22:43:14] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2022-06-12 22:43:14] [INFO ] Transformed 274 places.
[2022-06-12 22:43:14] [INFO ] Transformed 231 transitions.
[2022-06-12 22:43:14] [INFO ] Found NUPN structural information;
[2022-06-12 22:43:14] [INFO ] Parsed PT model containing 274 places and 231 transitions in 174 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-40a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 222 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 14) seen :3
FORMULA DES-PT-40a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 59 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 217 rows 274 cols
[2022-06-12 22:43:15] [INFO ] Computed 59 place invariants in 31 ms
[2022-06-12 22:43:15] [INFO ] [Real]Absence check using 34 positive place invariants in 32 ms returned sat
[2022-06-12 22:43:15] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 32 ms returned sat
[2022-06-12 22:43:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:16] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2022-06-12 22:43:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:43:16] [INFO ] [Real]Absence check using 34 positive place invariants in 21 ms returned sat
[2022-06-12 22:43:16] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 31 ms returned sat
[2022-06-12 22:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:17] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2022-06-12 22:43:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:43:17] [INFO ] [Nat]Absence check using 34 positive place invariants in 35 ms returned sat
[2022-06-12 22:43:17] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 71 ms returned sat
[2022-06-12 22:43:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:17] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2022-06-12 22:43:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-12 22:43:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-06-12 22:43:17] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 50 ms.
[2022-06-12 22:43:20] [INFO ] Added : 152 causal constraints over 31 iterations in 2579 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-06-12 22:43:20] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2022-06-12 22:43:20] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 22 ms returned sat
[2022-06-12 22:43:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:20] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2022-06-12 22:43:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:43:20] [INFO ] [Nat]Absence check using 34 positive place invariants in 19 ms returned sat
[2022-06-12 22:43:20] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 156 ms returned sat
[2022-06-12 22:43:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:21] [INFO ] [Nat]Absence check using state equation in 867 ms returned sat
[2022-06-12 22:43:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2022-06-12 22:43:21] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 32 ms.
[2022-06-12 22:43:23] [INFO ] Added : 157 causal constraints over 32 iterations in 1304 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-06-12 22:43:23] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2022-06-12 22:43:23] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 17 ms returned sat
[2022-06-12 22:43:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:23] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2022-06-12 22:43:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:43:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 24 ms returned sat
[2022-06-12 22:43:23] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 303 ms returned sat
[2022-06-12 22:43:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:24] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2022-06-12 22:43:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-06-12 22:43:24] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 29 ms.
[2022-06-12 22:43:26] [INFO ] Added : 147 causal constraints over 30 iterations in 2215 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-12 22:43:26] [INFO ] [Real]Absence check using 34 positive place invariants in 19 ms returned sat
[2022-06-12 22:43:26] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2022-06-12 22:43:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:26] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2022-06-12 22:43:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:43:27] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2022-06-12 22:43:27] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2022-06-12 22:43:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:27] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2022-06-12 22:43:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:43:27] [INFO ] [Nat]Absence check using 34 positive place invariants in 23 ms returned sat
[2022-06-12 22:43:27] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 258 ms returned sat
[2022-06-12 22:43:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:28] [INFO ] [Nat]Absence check using state equation in 886 ms returned sat
[2022-06-12 22:43:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-06-12 22:43:28] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 19 ms.
[2022-06-12 22:43:29] [INFO ] Added : 149 causal constraints over 30 iterations in 1386 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 22:43:30] [INFO ] [Real]Absence check using 34 positive place invariants in 20 ms returned sat
[2022-06-12 22:43:30] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2022-06-12 22:43:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:30] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2022-06-12 22:43:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:43:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 13 ms returned sat
[2022-06-12 22:43:30] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 85 ms returned sat
[2022-06-12 22:43:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:31] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2022-06-12 22:43:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2022-06-12 22:43:31] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 17 ms.
[2022-06-12 22:43:33] [INFO ] Added : 171 causal constraints over 35 iterations in 1969 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-12 22:43:33] [INFO ] [Real]Absence check using 34 positive place invariants in 21 ms returned sat
[2022-06-12 22:43:33] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2022-06-12 22:43:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:34] [INFO ] [Real]Absence check using state equation in 1184 ms returned sat
[2022-06-12 22:43:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:43:34] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-06-12 22:43:34] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 163 ms returned sat
[2022-06-12 22:43:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:35] [INFO ] [Nat]Absence check using state equation in 834 ms returned sat
[2022-06-12 22:43:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2022-06-12 22:43:35] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 29 ms.
[2022-06-12 22:43:36] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2022-06-12 22:43:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-06-12 22:43:36] [INFO ] Added : 101 causal constraints over 21 iterations in 975 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-12 22:43:36] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2022-06-12 22:43:36] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2022-06-12 22:43:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:37] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2022-06-12 22:43:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:43:37] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-06-12 22:43:37] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2022-06-12 22:43:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:37] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2022-06-12 22:43:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:43:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 24 ms returned sat
[2022-06-12 22:43:38] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 644 ms returned sat
[2022-06-12 22:43:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:42] [INFO ] [Nat]Absence check using state equation in 4253 ms returned unknown
[2022-06-12 22:43:42] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2022-06-12 22:43:42] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2022-06-12 22:43:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:43] [INFO ] [Real]Absence check using state equation in 692 ms returned sat
[2022-06-12 22:43:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:43:43] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2022-06-12 22:43:43] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 85 ms returned sat
[2022-06-12 22:43:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:45] [INFO ] [Nat]Absence check using state equation in 1864 ms returned sat
[2022-06-12 22:43:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2022-06-12 22:43:45] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 16 ms.
[2022-06-12 22:43:47] [INFO ] Added : 196 causal constraints over 40 iterations in 2080 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
FORMULA DES-PT-40a-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-40a-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-40a-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 8 different solutions.
Incomplete Parikh walk after 130200 steps, including 3143 resets, run finished after 725 ms. (steps per millisecond=179 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 145300 steps, including 3732 resets, run finished after 646 ms. (steps per millisecond=224 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 150600 steps, including 4059 resets, run finished after 820 ms. (steps per millisecond=183 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 130800 steps, including 3406 resets, run finished after 636 ms. (steps per millisecond=205 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 156800 steps, including 4084 resets, run finished after 675 ms. (steps per millisecond=232 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 97900 steps, including 2269 resets, run finished after 368 ms. (steps per millisecond=266 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 202000 steps, including 5365 resets, run finished after 883 ms. (steps per millisecond=228 ) properties (out of 8) seen :0 could not realise parikh vector
Support contains 68 out of 274 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 274/274 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 273 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 216
Applied a total of 2 rules in 77 ms. Remains 273 /274 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 273/274 places, 216/217 transitions.
[2022-06-12 22:43:52] [INFO ] Flatten gal took : 114 ms
[2022-06-12 22:43:52] [INFO ] Flatten gal took : 45 ms
[2022-06-12 22:43:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17405056109981273536.gal : 24 ms
[2022-06-12 22:43:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6497708248966513983.prop : 2 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality17405056109981273536.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6497708248966513983.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality17405056109981273536.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6497708248966513983.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6497708248966513983.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :13 after 18
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :18 after 56
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :56 after 61
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :61 after 167
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :167 after 1585
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :1585 after 4065
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :4065 after 242941
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :242941 after 805173
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :805173 after 7.01655e+06
Detected timeout of ITS tools.
[2022-06-12 22:44:08] [INFO ] Flatten gal took : 31 ms
[2022-06-12 22:44:08] [INFO ] Applying decomposition
[2022-06-12 22:44:08] [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/graph906409171147708943.txt, -o, /tmp/graph906409171147708943.bin, -w, /tmp/graph906409171147708943.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/graph906409171147708943.bin, -l, -1, -v, -w, /tmp/graph906409171147708943.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:44:08] [INFO ] Decomposing Gal with order
[2022-06-12 22:44:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:44:08] [INFO ] Removed a total of 45 redundant transitions.
[2022-06-12 22:44:08] [INFO ] Flatten gal took : 128 ms
[2022-06-12 22:44:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 17 ms.
[2022-06-12 22:44:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1984760325093479795.gal : 18 ms
[2022-06-12 22:44:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12301040269592905277.prop : 3 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality1984760325093479795.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12301040269592905277.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality1984760325093479795.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12301040269592905277.prop --nowitness
Loading property file /tmp/ReachabilityCardinality12301040269592905277.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :9 after 1593
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :1593 after 10755
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :10755 after 7.6268e+08
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :7.6268e+08 after 1.34093e+09
Reachability property DES-PT-40a-ReachabilityCardinality-15 is true.
FORMULA DES-PT-40a-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :1.34093e+09 after 2.03483e+09
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :2.03483e+09 after 2.72872e+09
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :2.72872e+09 after 3.90585e+09
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :8.52216e+12 after 9.32393e+12
Invariant property DES-PT-40a-ReachabilityCardinality-14 does not hold.
FORMULA DES-PT-40a-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin88814831000277371
[2022-06-12 22:44:23] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin88814831000277371
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/ltsmin88814831000277371]
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/ltsmin88814831000277371] 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/ltsmin88814831000277371] 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)
Incomplete random walk after 1000000 steps, including 22283 resets, run finished after 2909 ms. (steps per millisecond=343 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4554 resets, run finished after 1405 ms. (steps per millisecond=711 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4515 resets, run finished after 1550 ms. (steps per millisecond=645 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4508 resets, run finished after 1074 ms. (steps per millisecond=931 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 1441 ms. (steps per millisecond=693 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4547 resets, run finished after 1696 ms. (steps per millisecond=589 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4610 resets, run finished after 1758 ms. (steps per millisecond=568 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 13929228 steps, run timeout after 30001 ms. (steps per millisecond=464 ) properties seen :{}
Probabilistic random walk after 13929228 steps, saw 1589534 distinct states, run finished after 30014 ms. (steps per millisecond=464 ) properties seen :{}
Running SMT prover for 6 properties.
// Phase 1: matrix 216 rows 273 cols
[2022-06-12 22:45:06] [INFO ] Computed 59 place invariants in 21 ms
[2022-06-12 22:45:06] [INFO ] [Real]Absence check using 34 positive place invariants in 20 ms returned sat
[2022-06-12 22:45:06] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2022-06-12 22:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:06] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2022-06-12 22:45:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:45:07] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2022-06-12 22:45:07] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 164 ms returned sat
[2022-06-12 22:45:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:07] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2022-06-12 22:45:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-12 22:45:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-06-12 22:45:07] [INFO ] Computed and/alt/rep : 208/624/208 causal constraints (skipped 7 transitions) in 37 ms.
[2022-06-12 22:45:08] [INFO ] Added : 149 causal constraints over 30 iterations in 890 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-12 22:45:08] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-06-12 22:45:08] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2022-06-12 22:45:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:08] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2022-06-12 22:45:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:45:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2022-06-12 22:45:08] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 77 ms returned sat
[2022-06-12 22:45:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:09] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2022-06-12 22:45:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-06-12 22:45:09] [INFO ] Computed and/alt/rep : 208/624/208 causal constraints (skipped 7 transitions) in 16 ms.
[2022-06-12 22:45:09] [INFO ] Added : 152 causal constraints over 31 iterations in 691 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-12 22:45:10] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2022-06-12 22:45:10] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2022-06-12 22:45:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:10] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2022-06-12 22:45:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:45:10] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2022-06-12 22:45:10] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 64 ms returned sat
[2022-06-12 22:45:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:10] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2022-06-12 22:45:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-06-12 22:45:10] [INFO ] Computed and/alt/rep : 208/624/208 causal constraints (skipped 7 transitions) in 16 ms.
[2022-06-12 22:45:11] [INFO ] Added : 148 causal constraints over 30 iterations in 1096 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-12 22:45:11] [INFO ] [Real]Absence check using 34 positive place invariants in 19 ms returned sat
[2022-06-12 22:45:11] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2022-06-12 22:45:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:12] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2022-06-12 22:45:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:45:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2022-06-12 22:45:12] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 37 ms returned sat
[2022-06-12 22:45:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:12] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2022-06-12 22:45:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-06-12 22:45:12] [INFO ] Computed and/alt/rep : 208/624/208 causal constraints (skipped 7 transitions) in 24 ms.
[2022-06-12 22:45:13] [INFO ] Added : 128 causal constraints over 26 iterations in 920 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-12 22:45:13] [INFO ] [Real]Absence check using 34 positive place invariants in 20 ms returned sat
[2022-06-12 22:45:13] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2022-06-12 22:45:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:13] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2022-06-12 22:45:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:45:13] [INFO ] [Nat]Absence check using 34 positive place invariants in 23 ms returned sat
[2022-06-12 22:45:14] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 101 ms returned sat
[2022-06-12 22:45:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:14] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2022-06-12 22:45:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2022-06-12 22:45:14] [INFO ] Computed and/alt/rep : 208/624/208 causal constraints (skipped 7 transitions) in 39 ms.
[2022-06-12 22:45:15] [INFO ] Added : 175 causal constraints over 35 iterations in 1449 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 22:45:16] [INFO ] [Real]Absence check using 34 positive place invariants in 20 ms returned sat
[2022-06-12 22:45:16] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 30 ms returned sat
[2022-06-12 22:45:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:16] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2022-06-12 22:45:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:45:16] [INFO ] [Nat]Absence check using 34 positive place invariants in 20 ms returned sat
[2022-06-12 22:45:16] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 136 ms returned sat
[2022-06-12 22:45:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:17] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2022-06-12 22:45:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-06-12 22:45:17] [INFO ] Computed and/alt/rep : 208/624/208 causal constraints (skipped 7 transitions) in 26 ms.
[2022-06-12 22:45:18] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2022-06-12 22:45:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2022-06-12 22:45:18] [INFO ] Added : 120 causal constraints over 25 iterations in 1127 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
Incomplete Parikh walk after 127400 steps, including 3417 resets, run finished after 656 ms. (steps per millisecond=194 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 136400 steps, including 3326 resets, run finished after 565 ms. (steps per millisecond=241 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 142200 steps, including 3253 resets, run finished after 628 ms. (steps per millisecond=226 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 104700 steps, including 2956 resets, run finished after 318 ms. (steps per millisecond=329 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 171900 steps, including 4699 resets, run finished after 488 ms. (steps per millisecond=352 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 97100 steps, including 2165 resets, run finished after 313 ms. (steps per millisecond=310 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 39 out of 273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 273/273 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 273 transition count 214
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 273 transition count 214
Applied a total of 4 rules in 36 ms. Remains 273 /273 variables (removed 0) and now considering 214/216 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 273/273 places, 214/216 transitions.
[2022-06-12 22:45:21] [INFO ] Flatten gal took : 25 ms
[2022-06-12 22:45:21] [INFO ] Flatten gal took : 25 ms
[2022-06-12 22:45:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5049474889626224833.gal : 4 ms
[2022-06-12 22:45:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16810948883590459647.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality5049474889626224833.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16810948883590459647.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality5049474889626224833.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16810948883590459647.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16810948883590459647.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :9 after 11
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :11 after 23
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :23 after 157
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :157 after 651
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :651 after 1311
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1311 after 12165
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :12165 after 183461
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :183461 after 1.42679e+06
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1.42679e+06 after 5.97658e+06
Detected timeout of ITS tools.
[2022-06-12 22:45:36] [INFO ] Flatten gal took : 24 ms
[2022-06-12 22:45:36] [INFO ] Applying decomposition
[2022-06-12 22:45:36] [INFO ] Flatten gal took : 22 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/graph13400068764493242340.txt, -o, /tmp/graph13400068764493242340.bin, -w, /tmp/graph13400068764493242340.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/graph13400068764493242340.bin, -l, -1, -v, -w, /tmp/graph13400068764493242340.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:45:36] [INFO ] Decomposing Gal with order
[2022-06-12 22:45:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:45:36] [INFO ] Removed a total of 52 redundant transitions.
[2022-06-12 22:45:36] [INFO ] Flatten gal took : 39 ms
[2022-06-12 22:45:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 4 ms.
[2022-06-12 22:45:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15267343174493867763.gal : 6 ms
[2022-06-12 22:45:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12013956387871407087.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality15267343174493867763.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12013956387871407087.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality15267343174493867763.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12013956387871407087.prop --nowitness
Loading property file /tmp/ReachabilityCardinality12013956387871407087.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :9 after 853
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :853 after 8207
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :8207 after 3.34151e+08
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :3.34151e+08 after 5.8669e+08
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :5.8669e+08 after 9.02754e+08
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :9.02754e+08 after 1.45834e+09
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :3.86334e+12 after 4.05104e+12
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5251282033112432758
[2022-06-12 22:45:51] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5251282033112432758
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/ltsmin5251282033112432758]
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/ltsmin5251282033112432758] 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/ltsmin5251282033112432758] 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)
Incomplete random walk after 1000000 steps, including 13180 resets, run finished after 2843 ms. (steps per millisecond=351 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2192 resets, run finished after 1020 ms. (steps per millisecond=980 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2349 resets, run finished after 1075 ms. (steps per millisecond=930 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2260 resets, run finished after 1051 ms. (steps per millisecond=951 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3051 resets, run finished after 1065 ms. (steps per millisecond=938 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2373 resets, run finished after 1708 ms. (steps per millisecond=585 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2221 resets, run finished after 1797 ms. (steps per millisecond=556 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 13494442 steps, run timeout after 30001 ms. (steps per millisecond=449 ) properties seen :{}
Probabilistic random walk after 13494442 steps, saw 1698114 distinct states, run finished after 30002 ms. (steps per millisecond=449 ) properties seen :{}
Running SMT prover for 6 properties.
// Phase 1: matrix 214 rows 273 cols
[2022-06-12 22:46:33] [INFO ] Computed 61 place invariants in 7 ms
[2022-06-12 22:46:33] [INFO ] [Real]Absence check using 37 positive place invariants in 10 ms returned sat
[2022-06-12 22:46:33] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 16 ms returned sat
[2022-06-12 22:46:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:46:33] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2022-06-12 22:46:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:46:33] [INFO ] [Nat]Absence check using 37 positive place invariants in 15 ms returned sat
[2022-06-12 22:46:33] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 177 ms returned sat
[2022-06-12 22:46:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:46:34] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2022-06-12 22:46:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-12 22:46:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 27 ms returned sat
[2022-06-12 22:46:34] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2022-06-12 22:46:34] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2022-06-12 22:46:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2022-06-12 22:46:34] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 14 ms.
[2022-06-12 22:46:35] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 0 ms to minimize.
[2022-06-12 22:46:35] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2022-06-12 22:46:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2022-06-12 22:46:35] [INFO ] Added : 121 causal constraints over 25 iterations in 872 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-12 22:46:35] [INFO ] [Real]Absence check using 37 positive place invariants in 14 ms returned sat
[2022-06-12 22:46:35] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 18 ms returned sat
[2022-06-12 22:46:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:46:35] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2022-06-12 22:46:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:46:35] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2022-06-12 22:46:35] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 123 ms returned sat
[2022-06-12 22:46:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:46:36] [INFO ] [Nat]Absence check using state equation in 489 ms returned sat
[2022-06-12 22:46:36] [INFO ] [Nat]Added 3 Read/Feed constraints in 64 ms returned sat
[2022-06-12 22:46:36] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2022-06-12 22:46:36] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2022-06-12 22:46:36] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2022-06-12 22:46:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 337 ms
[2022-06-12 22:46:36] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 14 ms.
[2022-06-12 22:46:37] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2022-06-12 22:46:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2022-06-12 22:46:37] [INFO ] Added : 143 causal constraints over 29 iterations in 1094 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-12 22:46:37] [INFO ] [Real]Absence check using 37 positive place invariants in 20 ms returned sat
[2022-06-12 22:46:37] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 28 ms returned sat
[2022-06-12 22:46:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:46:37] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2022-06-12 22:46:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:46:38] [INFO ] [Nat]Absence check using 37 positive place invariants in 20 ms returned sat
[2022-06-12 22:46:38] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 28 ms returned sat
[2022-06-12 22:46:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:46:38] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2022-06-12 22:46:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 18 ms returned sat
[2022-06-12 22:46:38] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2022-06-12 22:46:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2022-06-12 22:46:38] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 17 ms.
[2022-06-12 22:46:39] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2022-06-12 22:46:39] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2022-06-12 22:46:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2022-06-12 22:46:39] [INFO ] Added : 128 causal constraints over 26 iterations in 1047 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-12 22:46:39] [INFO ] [Real]Absence check using 37 positive place invariants in 18 ms returned sat
[2022-06-12 22:46:39] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 25 ms returned sat
[2022-06-12 22:46:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:46:39] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2022-06-12 22:46:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:46:39] [INFO ] [Nat]Absence check using 37 positive place invariants in 17 ms returned sat
[2022-06-12 22:46:40] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 243 ms returned sat
[2022-06-12 22:46:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:46:40] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2022-06-12 22:46:40] [INFO ] [Nat]Added 3 Read/Feed constraints in 9 ms returned sat
[2022-06-12 22:46:40] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 16 ms.
[2022-06-12 22:46:41] [INFO ] Added : 109 causal constraints over 22 iterations in 582 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-12 22:46:41] [INFO ] [Real]Absence check using 37 positive place invariants in 21 ms returned sat
[2022-06-12 22:46:41] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 29 ms returned sat
[2022-06-12 22:46:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:46:41] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2022-06-12 22:46:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:46:41] [INFO ] [Nat]Absence check using 37 positive place invariants in 22 ms returned sat
[2022-06-12 22:46:42] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 133 ms returned sat
[2022-06-12 22:46:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:46:42] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2022-06-12 22:46:42] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2022-06-12 22:46:42] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 18 ms.
[2022-06-12 22:46:43] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 2 ms to minimize.
[2022-06-12 22:46:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-06-12 22:46:43] [INFO ] Added : 134 causal constraints over 27 iterations in 1092 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 22:46:43] [INFO ] [Real]Absence check using 37 positive place invariants in 22 ms returned sat
[2022-06-12 22:46:43] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 29 ms returned sat
[2022-06-12 22:46:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:46:44] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2022-06-12 22:46:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:46:44] [INFO ] [Nat]Absence check using 37 positive place invariants in 21 ms returned sat
[2022-06-12 22:46:44] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 184 ms returned sat
[2022-06-12 22:46:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:46:45] [INFO ] [Nat]Absence check using state equation in 998 ms returned sat
[2022-06-12 22:46:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2022-06-12 22:46:45] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 16 ms.
[2022-06-12 22:46:45] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2022-06-12 22:46:46] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 1 ms to minimize.
[2022-06-12 22:46:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2022-06-12 22:46:46] [INFO ] Added : 103 causal constraints over 21 iterations in 752 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
Incomplete Parikh walk after 125700 steps, including 2167 resets, run finished after 346 ms. (steps per millisecond=363 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 167600 steps, including 2768 resets, run finished after 456 ms. (steps per millisecond=367 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 146800 steps, including 2596 resets, run finished after 407 ms. (steps per millisecond=360 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 97800 steps, including 1578 resets, run finished after 268 ms. (steps per millisecond=364 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 151600 steps, including 2645 resets, run finished after 418 ms. (steps per millisecond=362 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 86300 steps, including 1468 resets, run finished after 237 ms. (steps per millisecond=364 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 39 out of 273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 273/273 places, 214/214 transitions.
Applied a total of 0 rules in 16 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 273/273 places, 214/214 transitions.
Starting structural reductions, iteration 0 : 273/273 places, 214/214 transitions.
Applied a total of 0 rules in 17 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 273 cols
[2022-06-12 22:46:48] [INFO ] Computed 61 place invariants in 7 ms
[2022-06-12 22:46:48] [INFO ] Implicit Places using invariants in 289 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 292 ms to find 1 implicit places.
[2022-06-12 22:46:48] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 214 rows 272 cols
[2022-06-12 22:46:48] [INFO ] Computed 60 place invariants in 10 ms
[2022-06-12 22:46:48] [INFO ] Dead Transitions using invariants and state equation in 191 ms returned []
Starting structural reductions, iteration 1 : 272/273 places, 214/214 transitions.
Applied a total of 0 rules in 14 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2022-06-12 22:46:48] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 214 rows 272 cols
[2022-06-12 22:46:48] [INFO ] Computed 60 place invariants in 6 ms
[2022-06-12 22:46:48] [INFO ] Dead Transitions using invariants and state equation in 189 ms returned []
Finished structural reductions, in 2 iterations. Remains : 272/273 places, 214/214 transitions.
[2022-06-12 22:46:49] [INFO ] Flatten gal took : 18 ms
[2022-06-12 22:46:49] [INFO ] Flatten gal took : 17 ms
[2022-06-12 22:46:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8659675953037319132.gal : 3 ms
[2022-06-12 22:46:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10174363933052524625.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality8659675953037319132.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10174363933052524625.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality8659675953037319132.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10174363933052524625.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10174363933052524625.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :9 after 11
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :11 after 23
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :23 after 157
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :157 after 651
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :651 after 1227
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1227 after 2641
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :2641 after 183421
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :183421 after 682489
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :682489 after 5.97636e+06
Detected timeout of ITS tools.
[2022-06-12 22:47:04] [INFO ] Flatten gal took : 16 ms
[2022-06-12 22:47:04] [INFO ] Applying decomposition
[2022-06-12 22:47:04] [INFO ] Flatten gal took : 19 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/graph9952015766821615391.txt, -o, /tmp/graph9952015766821615391.bin, -w, /tmp/graph9952015766821615391.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/graph9952015766821615391.bin, -l, -1, -v, -w, /tmp/graph9952015766821615391.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:47:04] [INFO ] Decomposing Gal with order
[2022-06-12 22:47:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:47:04] [INFO ] Removed a total of 52 redundant transitions.
[2022-06-12 22:47:04] [INFO ] Flatten gal took : 35 ms
[2022-06-12 22:47:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 4 ms.
[2022-06-12 22:47:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14599409006580661202.gal : 4 ms
[2022-06-12 22:47:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13344917501439781926.prop : 9 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality14599409006580661202.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13344917501439781926.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality14599409006580661202.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13344917501439781926.prop --nowitness
Loading property file /tmp/ReachabilityCardinality13344917501439781926.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :9 after 853
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :853 after 6043
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :6043 after 2.06873e+08
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :2.06873e+08 after 3.62796e+08
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :3.62796e+08 after 5.50115e+08
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :5.50115e+08 after 8.93146e+08
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :3.86334e+12 after 4.36151e+12
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11357304849380919209
[2022-06-12 22:47:19] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11357304849380919209
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/ltsmin11357304849380919209]
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/ltsmin11357304849380919209] 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/ltsmin11357304849380919209] 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)
Incomplete random walk after 1000000 steps, including 13173 resets, run finished after 2583 ms. (steps per millisecond=387 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2241 resets, run finished after 1114 ms. (steps per millisecond=897 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2306 resets, run finished after 1061 ms. (steps per millisecond=942 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2291 resets, run finished after 1032 ms. (steps per millisecond=968 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3042 resets, run finished after 1048 ms. (steps per millisecond=954 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2392 resets, run finished after 1695 ms. (steps per millisecond=589 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2215 resets, run finished after 1760 ms. (steps per millisecond=568 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 14207215 steps, run timeout after 30001 ms. (steps per millisecond=473 ) properties seen :{}
Probabilistic random walk after 14207215 steps, saw 1776882 distinct states, run finished after 30002 ms. (steps per millisecond=473 ) properties seen :{}
Running SMT prover for 6 properties.
// Phase 1: matrix 214 rows 272 cols
[2022-06-12 22:48:00] [INFO ] Computed 60 place invariants in 7 ms
[2022-06-12 22:48:00] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2022-06-12 22:48:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2022-06-12 22:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:00] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2022-06-12 22:48:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:48:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-06-12 22:48:01] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 196 ms returned sat
[2022-06-12 22:48:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:01] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2022-06-12 22:48:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-12 22:48:01] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-06-12 22:48:01] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2022-06-12 22:48:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-06-12 22:48:01] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 17 ms.
[2022-06-12 22:48:02] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2022-06-12 22:48:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2022-06-12 22:48:02] [INFO ] Added : 121 causal constraints over 25 iterations in 861 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 22:48:02] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-06-12 22:48:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 29 ms returned sat
[2022-06-12 22:48:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:02] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2022-06-12 22:48:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:48:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-06-12 22:48:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 195 ms returned sat
[2022-06-12 22:48:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:03] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2022-06-12 22:48:03] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-06-12 22:48:03] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2022-06-12 22:48:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2022-06-12 22:48:04] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 22 ms.
[2022-06-12 22:48:05] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2022-06-12 22:48:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2022-06-12 22:48:05] [INFO ] Added : 153 causal constraints over 32 iterations in 1504 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-12 22:48:05] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-06-12 22:48:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 28 ms returned sat
[2022-06-12 22:48:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:05] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2022-06-12 22:48:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:48:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-06-12 22:48:06] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 298 ms returned sat
[2022-06-12 22:48:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:06] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
[2022-06-12 22:48:06] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-06-12 22:48:06] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 19 ms.
[2022-06-12 22:48:07] [INFO ] Added : 160 causal constraints over 33 iterations in 806 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-12 22:48:07] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2022-06-12 22:48:07] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 25 ms returned sat
[2022-06-12 22:48:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:07] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2022-06-12 22:48:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:48:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2022-06-12 22:48:08] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 188 ms returned sat
[2022-06-12 22:48:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:08] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2022-06-12 22:48:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-06-12 22:48:08] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 15 ms to minimize.
[2022-06-12 22:48:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2022-06-12 22:48:08] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 19 ms.
[2022-06-12 22:48:09] [INFO ] Added : 122 causal constraints over 25 iterations in 929 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-12 22:48:09] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-06-12 22:48:09] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 28 ms returned sat
[2022-06-12 22:48:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:10] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2022-06-12 22:48:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:48:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2022-06-12 22:48:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 258 ms returned sat
[2022-06-12 22:48:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:10] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2022-06-12 22:48:10] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2022-06-12 22:48:11] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 22 ms.
[2022-06-12 22:48:12] [INFO ] Added : 172 causal constraints over 35 iterations in 1458 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 22:48:12] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2022-06-12 22:48:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 29 ms returned sat
[2022-06-12 22:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:12] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2022-06-12 22:48:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:48:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2022-06-12 22:48:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 181 ms returned sat
[2022-06-12 22:48:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:13] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2022-06-12 22:48:13] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-06-12 22:48:13] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 14 ms.
[2022-06-12 22:48:14] [INFO ] Added : 119 causal constraints over 25 iterations in 691 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
Incomplete Parikh walk after 130800 steps, including 1561 resets, run finished after 443 ms. (steps per millisecond=295 ) properties (out of 6) seen :1 could not realise parikh vector
FORMULA DES-PT-40a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 140800 steps, including 2326 resets, run finished after 430 ms. (steps per millisecond=327 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 139600 steps, including 2367 resets, run finished after 346 ms. (steps per millisecond=403 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 125000 steps, including 2050 resets, run finished after 310 ms. (steps per millisecond=403 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 163900 steps, including 2164 resets, run finished after 414 ms. (steps per millisecond=395 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 88900 steps, including 1633 resets, run finished after 221 ms. (steps per millisecond=402 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 25 out of 272 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 13 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 12 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 272 cols
[2022-06-12 22:48:16] [INFO ] Computed 60 place invariants in 3 ms
[2022-06-12 22:48:16] [INFO ] Implicit Places using invariants in 350 ms returned []
// Phase 1: matrix 214 rows 272 cols
[2022-06-12 22:48:16] [INFO ] Computed 60 place invariants in 5 ms
[2022-06-12 22:48:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-12 22:48:17] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
[2022-06-12 22:48:17] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 214 rows 272 cols
[2022-06-12 22:48:17] [INFO ] Computed 60 place invariants in 5 ms
[2022-06-12 22:48:18] [INFO ] Dead Transitions using invariants and state equation in 357 ms returned []
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 214/214 transitions.
Incomplete random walk after 100000 steps, including 1323 resets, run finished after 593 ms. (steps per millisecond=168 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 214 rows 272 cols
[2022-06-12 22:48:18] [INFO ] Computed 60 place invariants in 5 ms
[2022-06-12 22:48:18] [INFO ] [Real]Absence check using 36 positive place invariants in 54 ms returned sat
[2022-06-12 22:48:18] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 29 ms returned sat
[2022-06-12 22:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:19] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2022-06-12 22:48:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:48:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2022-06-12 22:48:19] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 275 ms returned sat
[2022-06-12 22:48:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:19] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2022-06-12 22:48:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-12 22:48:19] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-06-12 22:48:20] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2022-06-12 22:48:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2022-06-12 22:48:20] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 18 ms.
[2022-06-12 22:48:20] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2022-06-12 22:48:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-06-12 22:48:20] [INFO ] Added : 121 causal constraints over 25 iterations in 936 ms. Result :sat
[2022-06-12 22:48:21] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-06-12 22:48:21] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2022-06-12 22:48:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:21] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2022-06-12 22:48:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:48:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2022-06-12 22:48:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 118 ms returned sat
[2022-06-12 22:48:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:21] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2022-06-12 22:48:21] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-06-12 22:48:21] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2022-06-12 22:48:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-06-12 22:48:21] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 14 ms.
[2022-06-12 22:48:23] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2022-06-12 22:48:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2022-06-12 22:48:23] [INFO ] Added : 153 causal constraints over 32 iterations in 1258 ms. Result :sat
[2022-06-12 22:48:23] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-06-12 22:48:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 28 ms returned sat
[2022-06-12 22:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:23] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2022-06-12 22:48:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:48:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2022-06-12 22:48:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 298 ms returned sat
[2022-06-12 22:48:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:24] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2022-06-12 22:48:24] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-06-12 22:48:24] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 16 ms.
[2022-06-12 22:48:25] [INFO ] Added : 160 causal constraints over 33 iterations in 847 ms. Result :sat
[2022-06-12 22:48:25] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-06-12 22:48:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 28 ms returned sat
[2022-06-12 22:48:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:25] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2022-06-12 22:48:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:48:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-06-12 22:48:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 133 ms returned sat
[2022-06-12 22:48:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:26] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2022-06-12 22:48:26] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-06-12 22:48:26] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2022-06-12 22:48:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2022-06-12 22:48:26] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 21 ms.
[2022-06-12 22:48:27] [INFO ] Added : 122 causal constraints over 25 iterations in 747 ms. Result :sat
[2022-06-12 22:48:27] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2022-06-12 22:48:27] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 29 ms returned sat
[2022-06-12 22:48:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:27] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2022-06-12 22:48:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:48:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-06-12 22:48:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 259 ms returned sat
[2022-06-12 22:48:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:28] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2022-06-12 22:48:28] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-06-12 22:48:28] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 15 ms.
[2022-06-12 22:48:29] [INFO ] Added : 172 causal constraints over 35 iterations in 1072 ms. Result :sat
[2022-06-12 22:48:29] [INFO ] Flatten gal took : 15 ms
[2022-06-12 22:48:29] [INFO ] Flatten gal took : 13 ms
[2022-06-12 22:48:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality655426784325337183.gal : 2 ms
[2022-06-12 22:48:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12038365690699432295.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality655426784325337183.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12038365690699432295.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality655426784325337183.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12038365690699432295.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12038365690699432295.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :9 after 11
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :11 after 23
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :23 after 157
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :157 after 651
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :651 after 1227
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1227 after 2641
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :2641 after 183421
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :183421 after 682489
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :682489 after 5.97636e+06
Detected timeout of ITS tools.
[2022-06-12 22:48:49] [INFO ] Flatten gal took : 15 ms
[2022-06-12 22:48:49] [INFO ] Applying decomposition
[2022-06-12 22:48:49] [INFO ] Flatten gal took : 14 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/graph14725404860160392277.txt, -o, /tmp/graph14725404860160392277.bin, -w, /tmp/graph14725404860160392277.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/graph14725404860160392277.bin, -l, -1, -v, -w, /tmp/graph14725404860160392277.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:48:49] [INFO ] Decomposing Gal with order
[2022-06-12 22:48:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:48:49] [INFO ] Removed a total of 53 redundant transitions.
[2022-06-12 22:48:49] [INFO ] Flatten gal took : 29 ms
[2022-06-12 22:48:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 4 ms.
[2022-06-12 22:48:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6857064551003635692.gal : 4 ms
[2022-06-12 22:48:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17112525918815558914.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality6857064551003635692.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17112525918815558914.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality6857064551003635692.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17112525918815558914.prop --nowitness
Loading property file /tmp/ReachabilityCardinality17112525918815558914.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :9 after 853
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :853 after 6043
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :6043 after 5.93721e+08
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :5.93721e+08 after 1.0473e+09
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1.0473e+09 after 1.63067e+09
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1.63067e+09 after 2.62854e+09
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :3.86334e+12 after 4.36151e+12
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1977033121756901735
[2022-06-12 22:49:09] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1977033121756901735
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/ltsmin1977033121756901735]
Compilation finished in 1685 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1977033121756901735]
Link finished in 50 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, -i, DESPT40aReachabilityCardinality02==true], workingDir=/tmp/ltsmin1977033121756901735]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Applied a total of 0 rules in 13 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 214 rows 272 cols
[2022-06-12 22:49:29] [INFO ] Computed 60 place invariants in 4 ms
[2022-06-12 22:49:29] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-06-12 22:49:29] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2022-06-12 22:49:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:49:29] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2022-06-12 22:49:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:49:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-06-12 22:49:30] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 202 ms returned sat
[2022-06-12 22:49:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:49:30] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2022-06-12 22:49:30] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2022-06-12 22:49:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-06-12 22:49:30] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 16 ms.
[2022-06-12 22:49:31] [INFO ] Added : 144 causal constraints over 29 iterations in 794 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-12 22:49:31] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-06-12 22:49:31] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2022-06-12 22:49:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:49:31] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2022-06-12 22:49:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:49:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-06-12 22:49:31] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 131 ms returned sat
[2022-06-12 22:49:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:49:32] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2022-06-12 22:49:32] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 15 ms.
[2022-06-12 22:49:33] [INFO ] Added : 147 causal constraints over 30 iterations in 769 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-12 22:49:33] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-06-12 22:49:33] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2022-06-12 22:49:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:49:33] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2022-06-12 22:49:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:49:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-06-12 22:49:33] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 182 ms returned sat
[2022-06-12 22:49:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:49:33] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2022-06-12 22:49:34] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 15 ms.
[2022-06-12 22:49:34] [INFO ] Added : 161 causal constraints over 33 iterations in 791 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-12 22:49:34] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-06-12 22:49:34] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2022-06-12 22:49:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:49:35] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2022-06-12 22:49:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:49:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-06-12 22:49:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 134 ms returned sat
[2022-06-12 22:49:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:49:35] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2022-06-12 22:49:35] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2022-06-12 22:49:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2022-06-12 22:49:35] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 14 ms.
[2022-06-12 22:49:36] [INFO ] Added : 122 causal constraints over 25 iterations in 637 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-12 22:49:36] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-06-12 22:49:36] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2022-06-12 22:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:49:36] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2022-06-12 22:49:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:49:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-06-12 22:49:36] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 159 ms returned sat
[2022-06-12 22:49:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:49:37] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2022-06-12 22:49:37] [INFO ] Computed and/alt/rep : 204/629/204 causal constraints (skipped 9 transitions) in 21 ms.
[2022-06-12 22:49:38] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2022-06-12 22:49:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2022-06-12 22:49:38] [INFO ] Added : 162 causal constraints over 33 iterations in 1376 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 22:49:38] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4956233167419929738
[2022-06-12 22:49:38] [INFO ] Computing symmetric may disable matrix : 214 transitions.
[2022-06-12 22:49:38] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 22:49:38] [INFO ] Computing symmetric may enable matrix : 214 transitions.
[2022-06-12 22:49:38] [INFO ] Applying decomposition
[2022-06-12 22:49:38] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 22:49:38] [INFO ] Flatten gal took : 26 ms
[2022-06-12 22:49:38] [INFO ] Flatten gal took : 39 ms
[2022-06-12 22:49:38] [INFO ] Computing Do-Not-Accords matrix : 214 transitions.
[2022-06-12 22:49:38] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 22:49:38] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4956233167419929738
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/ltsmin4956233167419929738]
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/graph17060887642168983296.txt, -o, /tmp/graph17060887642168983296.bin, -w, /tmp/graph17060887642168983296.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/graph17060887642168983296.bin, -l, -1, -v, -w, /tmp/graph17060887642168983296.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:49:38] [INFO ] Input system was already deterministic with 214 transitions.
[2022-06-12 22:49:38] [INFO ] Decomposing Gal with order
[2022-06-12 22:49:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:49:38] [INFO ] Removed a total of 56 redundant transitions.
[2022-06-12 22:49:38] [INFO ] Flatten gal took : 41 ms
[2022-06-12 22:49:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 6 ms.
[2022-06-12 22:49:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15217119854421150927.gal : 5 ms
[2022-06-12 22:49:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13250069326648925922.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality15217119854421150927.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13250069326648925922.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality15217119854421150927.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13250069326648925922.prop --nowitness
Loading property file /tmp/ReachabilityCardinality13250069326648925922.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :9 after 861
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :861 after 6043
[2022-06-12 22:49:39] [INFO ] Ran tautology test, simplified 0 / 5 in 515 ms.
[2022-06-12 22:49:39] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-02(UNSAT) depth K=0 took 33 ms
[2022-06-12 22:49:39] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-04(UNSAT) depth K=0 took 1 ms
[2022-06-12 22:49:39] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-05(UNSAT) depth K=0 took 1 ms
[2022-06-12 22:49:39] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-08(UNSAT) depth K=0 took 1 ms
[2022-06-12 22:49:39] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-10(UNSAT) depth K=0 took 1 ms
[2022-06-12 22:49:39] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-02(UNSAT) depth K=1 took 8 ms
[2022-06-12 22:49:39] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-04(UNSAT) depth K=1 took 14 ms
[2022-06-12 22:49:39] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-05(UNSAT) depth K=1 took 2 ms
[2022-06-12 22:49:39] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-08(UNSAT) depth K=1 took 2 ms
[2022-06-12 22:49:39] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-10(UNSAT) depth K=1 took 13 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 214 rows 272 cols
[2022-06-12 22:49:39] [INFO ] Computed 60 place invariants in 5 ms
inv : p0 + p203 + p214 - p220 + p230 + p236 - p246 = 1
inv : 39*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 + 10*p11 + 11*p12 + 12*p13 + 13*p14 + 14*p15 + 15*p16 + 16*p17 + 17*p18 + 18*p19 + 19*p20 + 20*p21 + 21*p22 + 22*p23 + 23*p24 + 24*p25 + 25*p26 + 26*p27 + 27*p28 + 28*p29 + 29*p30 + 30*p31 + 31*p32 + 32*p33 + 33*p34 + 34*p35 + 35*p36 + 36*p37 + 37*p38 + 38*p39 - 40*p40 - p41 - 2*p42 - 3*p43 - 4*p44 - 5*p45 - 6*p46 - 7*p47 - 8*p48 - 9*p49 - 10*p50 - 11*p51 - 12*p52 - 13*p53 - 14*p54 - 15*p55 - 16*p56 - 17*p57 - 18*p58 - 19*p59 - 20*p60 - 21*p61 - 22*p62 - 23*p63 - 24*p64 - 25*p65 - 26*p66 - 27*p67 - 28*p68 - 29*p69 - 30*p70 - 31*p71 - 32*p72 - 33*p73 - 34*p74 - 35*p75 - 36*p76 - 37*p77 - 38*p78 - 39*p79 + p168 - p170 - p194 - p198 - p253 - p254 - p256 - p257 - p260 - p261 + p264 + p269 + p271 = 0
inv : p0 + p269 + p270 + p271 = 1
inv : p0 + p217 + p218 = 1
inv : p0 + p205 + p214 - p222 + p230 + p238 - p246 = 1
inv : p0 + p197 + p198 = 1
inv : p0 + p191 + p192 = 1
inv : p0 + p201 + p214 - p218 + p230 + p234 - p246 = 1
inv : p0 + p187 + p188 = 1
inv : p0 + p160 + p161 = 1
inv : p0 + p251 + p252 = 1
inv : p0 + 78*p1 + 2*p2 + 4*p3 + 6*p4 + 8*p5 + 10*p6 + 12*p7 + 14*p8 + 16*p9 + 18*p10 + 20*p11 + 22*p12 + 24*p13 + 26*p14 + 28*p15 + 30*p16 + 32*p17 + 34*p18 + 36*p19 + 38*p20 + 40*p21 + 42*p22 + 44*p23 + 46*p24 + 48*p25 + 50*p26 + 52*p27 + 54*p28 + 56*p29 + 58*p30 + 60*p31 + 62*p32 + 64*p33 + 66*p34 + 68*p35 + 70*p36 + 72*p37 + 74*p38 + 76*p39 - 80*p40 - 2*p41 - 4*p42 - 6*p43 - 8*p44 - 10*p45 - 12*p46 - 14*p47 - 16*p48 - 18*p49 - 20*p50 - 22*p51 - 24*p52 - 26*p53 - 28*p54 - 30*p55 - 32*p56 - 34*p57 - 36*p58 - 38*p59 - 40*p60 - 42*p61 - 44*p62 - 46*p63 - 48*p64 - 50*p65 - 52*p66 - 54*p67 - 56*p68 - 58*p69 - 60*p70 - 62*p71 - 64*p72 - 66*p73 - 68*p74 - 70*p75 - 72*p76 - 74*p77 - 76*p78 - 78*p79 - p192 - p194 - p198 - p254 - p256 - p257 + p259 - p260 - p261 + p263 + p264 + p268 + 2*p269 + p271 + p273 = 1
inv : p212 - p214 + p228 - p230 - p244 + p246 = 0
inv : p0 + p199 + p214 - p216 + p230 + p232 - p246 = 1
inv : p0 + p241 + p242 + p249 + p250 = 1
inv : p0 + p239 + p240 + p249 + p250 = 1
inv : p0 + p213 + p214 = 1
inv : p0 + p223 + p224 = 1
inv : p0 + p172 + p173 = 1
inv : 2*p0 + 39*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 + 10*p11 + 11*p12 + 12*p13 + 13*p14 + 14*p15 + 15*p16 + 16*p17 + 17*p18 + 18*p19 + 19*p20 + 20*p21 + 21*p22 + 22*p23 + 23*p24 + 24*p25 + 25*p26 + 26*p27 + 27*p28 + 28*p29 + 29*p30 + 30*p31 + 31*p32 + 32*p33 + 33*p34 + 34*p35 + 35*p36 + 36*p37 + 37*p38 + 38*p39 - 40*p40 - p41 - 2*p42 - 3*p43 - 4*p44 - 5*p45 - 6*p46 - 7*p47 - 8*p48 - 9*p49 - 10*p50 - 11*p51 - 12*p52 - 13*p53 - 14*p54 - 15*p55 - 16*p56 - 17*p57 - 18*p58 - 19*p59 - 20*p60 - 21*p61 - 22*p62 - 23*p63 - 24*p64 - 25*p65 - 26*p66 - 27*p67 - 28*p68 - 29*p69 - 30*p70 - 31*p71 - 32*p72 - 33*p73 - 34*p74 - 35*p75 - 36*p76 - 37*p77 - 38*p78 - 39*p79 - p192 + p195 - p214 - p230 + p246 + p249 - p252 - p254 - p256 - p260 + p269 + p271 = 2
inv : p0 + p233 + p234 + p249 + p250 = 1
inv : -p260 - p261 + p262 + p263 = 0
inv : p0 + p253 + p254 + p255 + p256 + p257 + p260 + p261 = 1
inv : p0 + p231 + p232 + p249 + p250 = 1
inv : p0 + p189 + p190 = 1
inv : p206 - p214 + p222 - p230 - p238 + p246 = 0
inv : p0 + p219 + p220 = 1
inv : p0 + p179 + p180 + p183 + p184 = 1
inv : p0 + p229 + p230 = 1
inv : p0 - 39*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 - 10*p11 - 11*p12 - 12*p13 - 13*p14 - 14*p15 - 15*p16 - 16*p17 - 17*p18 - 18*p19 - 19*p20 - 20*p21 - 21*p22 - 22*p23 - 23*p24 - 24*p25 - 25*p26 - 26*p27 - 27*p28 - 28*p29 - 29*p30 - 30*p31 - 31*p32 - 32*p33 - 33*p34 - 34*p35 - 35*p36 - 36*p37 - 37*p38 - 38*p39 + 40*p40 + p41 + 2*p42 + 3*p43 + 4*p44 + 5*p45 + 6*p46 + 7*p47 + 8*p48 + 9*p49 + 10*p50 + 11*p51 + 12*p52 + 13*p53 + 14*p54 + 15*p55 + 16*p56 + 17*p57 + 18*p58 + 19*p59 + 20*p60 + 21*p61 + 22*p62 + 23*p63 + 24*p64 + 25*p65 + 26*p66 + 27*p67 + 28*p68 + 29*p69 + 30*p70 + 31*p71 + 32*p72 + 33*p73 + 34*p74 + 35*p75 + 36*p76 + 37*p77 + 38*p78 + 39*p79 + p167 + p170 + p194 + p198 + p253 + p254 + p256 + p257 + p260 + p261 - p264 - p269 - p271 = 1
inv : -p0 - 39*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 - 10*p11 - 11*p12 - 12*p13 - 13*p14 - 14*p15 - 15*p16 - 16*p17 - 17*p18 - 18*p19 - 19*p20 - 20*p21 - 21*p22 - 22*p23 - 23*p24 - 24*p25 - 25*p26 - 26*p27 - 27*p28 - 28*p29 - 29*p30 - 30*p31 - 31*p32 - 32*p33 - 33*p34 - 34*p35 - 35*p36 - 36*p37 - 37*p38 - 38*p39 + 40*p40 + p41 + 2*p42 + 3*p43 + 4*p44 + 5*p45 + 6*p46 + 7*p47 + 8*p48 + 9*p49 + 10*p50 + 11*p51 + 12*p52 + 13*p53 + 14*p54 + 15*p55 + 16*p56 + 17*p57 + 18*p58 + 19*p59 + 20*p60 + 21*p61 + 22*p62 + 23*p63 + 24*p64 + 25*p65 + 26*p66 + 27*p67 + 28*p68 + 29*p69 + 30*p70 + 31*p71 + 32*p72 + 33*p73 + 34*p74 + 35*p75 + 36*p76 + 37*p77 + 38*p78 + 39*p79 + p192 + p196 + p214 + p230 - p246 - p249 + p252 + p254 + p256 + p260 - p269 - p271 = -1
inv : p0 + p235 + p236 + p249 + p250 = 1
inv : p210 - p214 + p226 - p230 - p242 + p246 = 0
inv : p0 + p225 + p226 = 1
inv : p0 + p245 + p246 + p249 + p250 = 1
inv : p0 - 78*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 - 20*p11 - 22*p12 - 24*p13 - 26*p14 - 28*p15 - 30*p16 - 32*p17 - 34*p18 - 36*p19 - 38*p20 - 40*p21 - 42*p22 - 44*p23 - 46*p24 - 48*p25 - 50*p26 - 52*p27 - 54*p28 - 56*p29 - 58*p30 - 60*p31 - 62*p32 - 64*p33 - 66*p34 - 68*p35 - 70*p36 - 72*p37 - 74*p38 - 76*p39 + 40*p40 + p41 + 2*p42 + 3*p43 + 4*p44 + 5*p45 + 6*p46 + 7*p47 + 8*p48 + 9*p49 + 10*p50 + 11*p51 + 12*p52 + 13*p53 + 14*p54 + 15*p55 + 16*p56 + 17*p57 + 18*p58 + 19*p59 + 20*p60 + 21*p61 + 22*p62 + 23*p63 + 24*p64 + 25*p65 + 26*p66 + 27*p67 + 28*p68 + 29*p69 + 30*p70 + 31*p71 + 32*p72 + 33*p73 + 34*p74 + 35*p75 + 36*p76 + 37*p77 + 38*p78 + 39*p79 + 40*p120 + p121 + 2*p122 + 3*p123 + 4*p124 + 5*p125 + 6*p126 + 7*p127 + 8*p128 + 9*p129 + 10*p130 + 11*p131 + 12*p132 + 13*p133 + 14*p134 + 15*p135 + 16*p136 + 17*p137 + 18*p138 + 19*p139 + 20*p140 + 21*p141 + 22*p142 + 23*p143 + 24*p144 + 25*p145 + 26*p146 + 27*p147 + 28*p148 + 29*p149 + 30*p150 + 31*p151 + 32*p152 + 33*p153 + 34*p154 + 35*p155 + 36*p156 + 37*p157 + 38*p158 + 39*p159 + p166 + p170 - p173 - p179 - p182 + p187 + p192 + p194 + p198 - p248 + p250 + p252 + p254 + p256 + p260 - p264 - p269 - p271 = 1
inv : p208 - p214 + p224 - p230 - p240 + p246 = 0
inv : p0 + p169 + p170 = 1
inv : p0 + p209 + p214 - p226 + p230 + p242 - p246 = 1
inv : p200 - p214 + p216 - p230 - p232 + p246 = 0
inv : p0 + p193 + p194 = 1
inv : p247 + p248 - p249 - p250 = 0
inv : p0 + p185 + p186 = 1
inv : p0 + p211 + p214 - p228 + p230 + p244 - p246 = 1
inv : p0 + p174 + p175 + p176 = 1
inv : p0 + p237 + p238 + p249 + p250 = 1
inv : p0 + p179 + p180 + p181 + p182 = 1
inv : p0 + p264 + p265 + p266 + p268 = 1
inv : p0 + p221 + p222 = 1
inv : -p0 - 78*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 - 20*p11 - 22*p12 - 24*p13 - 26*p14 - 28*p15 - 30*p16 - 32*p17 - 34*p18 - 36*p19 - 38*p20 - 40*p21 - 42*p22 - 44*p23 - 46*p24 - 48*p25 - 50*p26 - 52*p27 - 54*p28 - 56*p29 - 58*p30 - 60*p31 - 62*p32 - 64*p33 - 66*p34 - 68*p35 - 70*p36 - 72*p37 - 74*p38 - 76*p39 + 80*p40 + 2*p41 + 4*p42 + 6*p43 + 8*p44 + 10*p45 + 12*p46 + 14*p47 + 16*p48 + 18*p49 + 20*p50 + 22*p51 + 24*p52 + 26*p53 + 28*p54 + 30*p55 + 32*p56 + 34*p57 + 36*p58 + 38*p59 + 40*p60 + 42*p61 + 44*p62 + 46*p63 + 48*p64 + 50*p65 + 52*p66 + 54*p67 + 56*p68 + 58*p69 + 60*p70 + 62*p71 + 64*p72 + 66*p73 + 68*p74 + 70*p75 + 72*p76 + 74*p77 + 76*p78 + 78*p79 + p192 + p194 + p198 + p254 + p258 + p260 + p261 - p263 - p264 - p268 - 2*p269 - p271 - p273 = -1
inv : p204 - p214 + p220 - p230 - p236 + p246 = 0
inv : p0 + p164 + p165 + p166 = 1
inv : p177 + p178 - p179 - p180 = 0
inv : p0 + p162 + p163 = 1
inv : p202 - p214 + p218 - p230 - p234 + p246 = 0
inv : p0 + p215 + p216 = 1
inv : p0 + p227 + p228 = 1
inv : p0 + p243 + p244 + p249 + p250 = 1
inv : p0 + p269 + p272 + p273 = 1
inv : p0 + p207 + p214 - p224 + p230 + p240 - p246 = 1
Total of 60 invariants.
[2022-06-12 22:49:39] [INFO ] Computed 60 place invariants in 20 ms
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :6043 after 5.94319e+08
[2022-06-12 22:49:39] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-02(UNSAT) depth K=2 took 372 ms
[2022-06-12 22:49:39] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-04(UNSAT) depth K=2 took 2 ms
[2022-06-12 22:49:39] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-05(UNSAT) depth K=2 took 2 ms
[2022-06-12 22:49:39] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-08(UNSAT) depth K=2 took 2 ms
[2022-06-12 22:49:39] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-10(UNSAT) depth K=2 took 4 ms
[2022-06-12 22:49:39] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-02(UNSAT) depth K=3 took 99 ms
[2022-06-12 22:49:39] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-04(UNSAT) depth K=3 took 52 ms
[2022-06-12 22:49:39] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-05(UNSAT) depth K=3 took 72 ms
[2022-06-12 22:49:40] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-08(UNSAT) depth K=3 took 48 ms
[2022-06-12 22:49:40] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-10(UNSAT) depth K=3 took 78 ms
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :5.94319e+08 after 1.0479e+09
[2022-06-12 22:49:40] [INFO ] Proved 272 variables to be positive in 991 ms
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1.0479e+09 after 1.59227e+09
[2022-06-12 22:49:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40a-ReachabilityCardinality-02
[2022-06-12 22:49:40] [INFO ] KInduction solution for property DES-PT-40a-ReachabilityCardinality-02(SAT) depth K=0 took 138 ms
[2022-06-12 22:49:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40a-ReachabilityCardinality-04
[2022-06-12 22:49:40] [INFO ] KInduction solution for property DES-PT-40a-ReachabilityCardinality-04(SAT) depth K=0 took 22 ms
[2022-06-12 22:49:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40a-ReachabilityCardinality-05
[2022-06-12 22:49:40] [INFO ] KInduction solution for property DES-PT-40a-ReachabilityCardinality-05(SAT) depth K=0 took 16 ms
[2022-06-12 22:49:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40a-ReachabilityCardinality-08
[2022-06-12 22:49:40] [INFO ] KInduction solution for property DES-PT-40a-ReachabilityCardinality-08(SAT) depth K=0 took 18 ms
[2022-06-12 22:49:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40a-ReachabilityCardinality-10
[2022-06-12 22:49:40] [INFO ] KInduction solution for property DES-PT-40a-ReachabilityCardinality-10(SAT) depth K=0 took 74 ms
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1.59227e+09 after 2.59014e+09
[2022-06-12 22:49:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40a-ReachabilityCardinality-02
[2022-06-12 22:49:41] [INFO ] KInduction solution for property DES-PT-40a-ReachabilityCardinality-02(SAT) depth K=1 took 261 ms
[2022-06-12 22:49:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40a-ReachabilityCardinality-04
[2022-06-12 22:49:41] [INFO ] KInduction solution for property DES-PT-40a-ReachabilityCardinality-04(SAT) depth K=1 took 78 ms
[2022-06-12 22:49:41] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-02(UNSAT) depth K=4 took 1178 ms
[2022-06-12 22:49:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40a-ReachabilityCardinality-05
[2022-06-12 22:49:41] [INFO ] KInduction solution for property DES-PT-40a-ReachabilityCardinality-05(SAT) depth K=1 took 127 ms
Compilation finished in 2645 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4956233167419929738]
[2022-06-12 22:49:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40a-ReachabilityCardinality-08
[2022-06-12 22:49:41] [INFO ] KInduction solution for property DES-PT-40a-ReachabilityCardinality-08(SAT) depth K=1 took 120 ms
Link finished in 39 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, -p, --pins-guards, --when, -i, DESPT40aReachabilityCardinality02==true], workingDir=/tmp/ltsmin4956233167419929738]
[2022-06-12 22:49:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40a-ReachabilityCardinality-10
[2022-06-12 22:49:41] [INFO ] KInduction solution for property DES-PT-40a-ReachabilityCardinality-10(SAT) depth K=1 took 97 ms
[2022-06-12 22:49:42] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-04(UNSAT) depth K=4 took 1329 ms
[2022-06-12 22:49:47] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-05(UNSAT) depth K=4 took 5369 ms
[2022-06-12 22:49:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40a-ReachabilityCardinality-02
[2022-06-12 22:49:50] [INFO ] KInduction solution for property DES-PT-40a-ReachabilityCardinality-02(SAT) depth K=2 took 8905 ms
[2022-06-12 22:49:50] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-08(UNSAT) depth K=4 took 3000 ms
[2022-06-12 22:49:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40a-ReachabilityCardinality-04
[2022-06-12 22:49:53] [INFO ] KInduction solution for property DES-PT-40a-ReachabilityCardinality-04(SAT) depth K=2 took 2931 ms
[2022-06-12 22:49:56] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-10(UNSAT) depth K=4 took 5988 ms
[2022-06-12 22:50:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40a-ReachabilityCardinality-05
[2022-06-12 22:50:05] [INFO ] KInduction solution for property DES-PT-40a-ReachabilityCardinality-05(SAT) depth K=2 took 12315 ms
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :3.86334e+12 after 4.36151e+12
[2022-06-12 22:50:11] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-02(UNSAT) depth K=5 took 14375 ms
[2022-06-12 22:50:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40a-ReachabilityCardinality-08
[2022-06-12 22:50:19] [INFO ] KInduction solution for property DES-PT-40a-ReachabilityCardinality-08(SAT) depth K=2 took 13864 ms
[2022-06-12 22:50:21] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-04(UNSAT) depth K=5 took 9904 ms
[2022-06-12 22:50:48] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-05(UNSAT) depth K=5 took 26835 ms
[2022-06-12 22:50:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40a-ReachabilityCardinality-10
[2022-06-12 22:50:56] [INFO ] KInduction solution for property DES-PT-40a-ReachabilityCardinality-10(SAT) depth K=2 took 37005 ms
Invariant property DES-PT-40a-ReachabilityCardinality-10 does not hold.
FORMULA DES-PT-40a-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property DES-PT-40a-ReachabilityCardinality-08 does not hold.
FORMULA DES-PT-40a-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property DES-PT-40a-ReachabilityCardinality-05 does not hold.
FORMULA DES-PT-40a-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property DES-PT-40a-ReachabilityCardinality-04 does not hold.
FORMULA DES-PT-40a-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property DES-PT-40a-ReachabilityCardinality-02 is true.
FORMULA DES-PT-40a-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.33679e+13,32.2049,190356,16711,3247,410662,17981,327,626841,378,111787,0
Total reachable state count : 13367864136101
Verifying 5 reachability properties.
Reachability property DES-PT-40a-ReachabilityCardinality-02 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40a-ReachabilityCardinality-02,2.48445e+11,32.236,190356,2031,794,410662,17981,329,626841,381,111787,0
Invariant property DES-PT-40a-ReachabilityCardinality-04 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40a-ReachabilityCardinality-04,1.95897e+07,32.8343,190356,141,241,410662,17981,340,626841,387,111787,0
Invariant property DES-PT-40a-ReachabilityCardinality-05 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40a-ReachabilityCardinality-05,2.17436e+09,33.0755,190356,635,613,410662,17981,347,626841,389,111787,0
Invariant property DES-PT-40a-ReachabilityCardinality-08 does not hold.
[2022-06-12 22:51:18] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-08(UNSAT) depth K=5 took 30054 ms
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40a-ReachabilityCardinality-08,16512,33.1416,190356,122,215,410662,17981,354,626841,391,111787,0
Invariant property DES-PT-40a-ReachabilityCardinality-10 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40a-ReachabilityCardinality-10,6.8079e+09,43.3393,190356,1291,428,410662,17981,426,626841,415,111787,0
[2022-06-12 22:51:31] [WARNING] Interrupting SMT solver.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-12 22:51:31] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
[2022-06-12 22:51:31] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-40a-ReachabilityCardinality-02 K-induction depth 3
Exception in thread "Thread-27" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 3 more
[2022-06-12 22:51:31] [INFO ] SMT solved 0/ 5 properties. Interrupting SMT analysis.
BK_STOP 1655074293018
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="DES-PT-40a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is DES-PT-40a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r046-smll-165252115900188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;