About the Execution of ITS-Tools for DoubleExponent-PT-010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2047.588 | 3600000.00 | 8429122.00 | 5061.60 | ??F?????????FF?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r136-tall-171631132900558.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DoubleExponent-PT-010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132900558
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 169K May 18 16:42 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 DoubleExponent-PT-010-ReachabilityCardinality-2024-00
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-01
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-02
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-03
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-04
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-05
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2023-06
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2023-07
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2023-08
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-09
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-10
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-11
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-12
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-13
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2023-14
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716391490194
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-22 15:24:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 15:24:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 15:24:51] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-22 15:24:51] [INFO ] Transformed 534 places.
[2024-05-22 15:24:51] [INFO ] Transformed 498 transitions.
[2024-05-22 15:24:51] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-22 15:24:52] [INFO ] Flatten gal took : 160 ms
[2024-05-22 15:24:52] [INFO ] Flatten gal took : 63 ms
RANDOM walk for 40000 steps (1322 resets) in 1902 ms. (21 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 109 ms. (36 steps per ms) remains 16/16 properties
[2024-05-22 15:24:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10832071052034653305.gal : 57 ms
BEST_FIRST walk for 4000 steps (115 resets) in 61 ms. (64 steps per ms) remains 16/16 properties
[2024-05-22 15:24:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality732806427480557113.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10832071052034653305.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality732806427480557113.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4001 steps (112 resets) in 94 ms. (42 steps per ms) remains 16/16 properties
its-reach command run as :
BEST_FIRST walk for 4001 steps (112 resets) in 92 ms. (43 steps per ms) remains 16/16 properties
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 4000 steps (110 resets) in 93 ms. (42 steps per ms) remains 16/16 properties
Loading property file /tmp/ReachabilityCardinality732806427480557113.prop.
BEST_FIRST walk for 4002 steps (111 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (113 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (108 resets) in 51 ms. (76 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (107 resets) in 51 ms. (76 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (115 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 54 ms. (72 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (111 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (114 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4 after 7
BEST_FIRST walk for 4000 steps (115 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :7 after 11
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :11 after 12
BEST_FIRST walk for 4000 steps (115 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :12 after 25
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :25 after 32
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :32 after 68
BEST_FIRST walk for 4002 steps (116 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :68 after 138
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :138 after 514
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :514 after 2692
Invariant property DoubleExponent-PT-010-ReachabilityCardinality-2024-15 does not hold.
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :2692 after 28726
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :28726 after 142892
Interrupted probabilistic random walk after 195436 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :1 out of 16
Probabilistic random walk after 195436 steps, saw 97735 distinct states, run finished after 3005 ms. (steps per millisecond=65 ) properties seen :1
// Phase 1: matrix 498 rows 534 cols
[2024-05-22 15:24:55] [INFO ] Computed 54 invariants in 82 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem DoubleExponent-PT-010-ReachabilityCardinality-2024-12 is UNSAT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 278/415 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 119/534 variables, 51/54 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 14 unsolved
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :142892 after 424838
At refinement iteration 5 (OVERLAPS) 498/1032 variables, 534/588 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1032 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/1032 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1032/1032 variables, and 588 constraints, problems are : Problem set: 1 solved, 14 unsolved in 2262 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 534/534 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 300/407 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 127/534 variables, 51/54 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-22 15:24:59] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 31 ms to minimize.
[2024-05-22 15:24:59] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 4 ms to minimize.
[2024-05-22 15:24:59] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 3 ms to minimize.
[2024-05-22 15:24:59] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 3 ms to minimize.
[2024-05-22 15:24:59] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 3 ms to minimize.
[2024-05-22 15:24:59] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 3 ms to minimize.
[2024-05-22 15:24:59] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 2 ms to minimize.
[2024-05-22 15:25:00] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 3 ms to minimize.
[2024-05-22 15:25:00] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 2 ms to minimize.
[2024-05-22 15:25:00] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 2 ms to minimize.
[2024-05-22 15:25:00] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-05-22 15:25:00] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
[2024-05-22 15:25:00] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 3 ms to minimize.
[2024-05-22 15:25:00] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 3 ms to minimize.
[2024-05-22 15:25:01] [INFO ] Deduced a trap composed of 108 places in 110 ms of which 3 ms to minimize.
[2024-05-22 15:25:01] [INFO ] Deduced a trap composed of 121 places in 108 ms of which 3 ms to minimize.
[2024-05-22 15:25:01] [INFO ] Deduced a trap composed of 115 places in 110 ms of which 2 ms to minimize.
[2024-05-22 15:25:01] [INFO ] Deduced a trap composed of 113 places in 109 ms of which 2 ms to minimize.
[2024-05-22 15:25:01] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 2 ms to minimize.
[2024-05-22 15:25:01] [INFO ] Deduced a trap composed of 124 places in 115 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 20/74 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-22 15:25:01] [INFO ] Deduced a trap composed of 231 places in 136 ms of which 3 ms to minimize.
[2024-05-22 15:25:01] [INFO ] Deduced a trap composed of 253 places in 133 ms of which 3 ms to minimize.
[2024-05-22 15:25:02] [INFO ] Deduced a trap composed of 55 places in 133 ms of which 3 ms to minimize.
[2024-05-22 15:25:02] [INFO ] Deduced a trap composed of 228 places in 130 ms of which 3 ms to minimize.
[2024-05-22 15:25:02] [INFO ] Deduced a trap composed of 199 places in 138 ms of which 3 ms to minimize.
[2024-05-22 15:25:02] [INFO ] Deduced a trap composed of 196 places in 138 ms of which 3 ms to minimize.
[2024-05-22 15:25:02] [INFO ] Deduced a trap composed of 223 places in 132 ms of which 3 ms to minimize.
[2024-05-22 15:25:02] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 2 ms to minimize.
[2024-05-22 15:25:03] [INFO ] Deduced a trap composed of 242 places in 128 ms of which 3 ms to minimize.
[2024-05-22 15:25:03] [INFO ] Deduced a trap composed of 256 places in 136 ms of which 4 ms to minimize.
[2024-05-22 15:25:03] [INFO ] Deduced a trap composed of 133 places in 179 ms of which 3 ms to minimize.
SMT process timed out in 7520ms, After SMT, problems are : Problem set: 1 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 107 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 529 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 528 transition count 454
Reduce places removed 43 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 70 rules applied. Total rules applied 116 place count 485 transition count 427
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 143 place count 458 transition count 427
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 143 place count 458 transition count 406
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 185 place count 437 transition count 406
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :424838 after 998378
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 5 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 273 place count 393 transition count 362
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 295 place count 382 transition count 362
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 298 place count 382 transition count 359
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 301 place count 379 transition count 359
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 4 with 26 rules applied. Total rules applied 327 place count 379 transition count 333
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 353 place count 353 transition count 333
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 379 place count 353 transition count 333
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 380 place count 353 transition count 333
Applied a total of 380 rules in 170 ms. Remains 353 /534 variables (removed 181) and now considering 333/498 (removed 165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 353/534 places, 333/498 transitions.
RANDOM walk for 40000 steps (2553 resets) in 984 ms. (40 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1916 resets) in 722 ms. (55 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1918 resets) in 440 ms. (90 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1903 resets) in 267 ms. (149 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1927 resets) in 270 ms. (147 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1919 resets) in 180 ms. (221 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1917 resets) in 270 ms. (147 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1931 resets) in 186 ms. (213 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1938 resets) in 197 ms. (202 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1916 resets) in 201 ms. (198 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1913 resets) in 199 ms. (200 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1918 resets) in 188 ms. (211 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1896 resets) in 269 ms. (148 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1892 resets) in 165 ms. (240 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1910 resets) in 246 ms. (161 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 169537 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 14
Probabilistic random walk after 169537 steps, saw 84818 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
// Phase 1: matrix 333 rows 353 cols
[2024-05-22 15:25:08] [INFO ] Computed 50 invariants in 18 ms
[2024-05-22 15:25:08] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 6/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 207/320 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 11/331 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 333/664 variables, 331/381 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 15/396 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 22/686 variables, 22/418 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/686 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 686/686 variables, and 418 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2810 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 353/353 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 6/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 207/320 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 11/331 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 333/664 variables, 331/381 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 15/396 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 6/402 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 15:25:11] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/664 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 22/686 variables, 22/425 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SDD proceeding with computation,15 properties remain. new max is 32768
SDD size :998378 after 2.24464e+06
At refinement iteration 13 (INCLUDED_ONLY) 0/686 variables, 8/433 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Invariant property DoubleExponent-PT-010-ReachabilityCardinality-2024-13 does not hold.
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
[2024-05-22 15:25:20] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-22 15:25:20] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 5 ms to minimize.
[2024-05-22 15:25:20] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-22 15:25:20] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:25:20] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:25:20] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:25:20] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:25:21] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
[2024-05-22 15:25:21] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 2 ms to minimize.
[2024-05-22 15:25:21] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:25:21] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:25:21] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:25:21] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:25:21] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:25:21] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 1 ms to minimize.
[2024-05-22 15:25:21] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:25:22] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/686 variables, 17/450 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-22 15:25:26] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 4 ms to minimize.
[2024-05-22 15:25:26] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-05-22 15:25:26] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 2 ms to minimize.
[2024-05-22 15:25:26] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/686 variables, 4/454 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/686 variables, 0/454 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 0/686 variables, 0/454 constraints. Problems are: Problem set: 1 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 686/686 variables, and 454 constraints, problems are : Problem set: 1 solved, 13 unsolved in 21622 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 353/353 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 22/22 constraints]
After SMT, in 24505ms problems are : Problem set: 1 solved, 13 unsolved
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 30002 ms.
Support contains 106 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 333/333 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 353 transition count 332
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 352 transition count 332
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 352 transition count 331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 351 transition count 331
Applied a total of 4 rules in 61 ms. Remains 351 /353 variables (removed 2) and now considering 331/333 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 351/353 places, 331/333 transitions.
RANDOM walk for 40000 steps (2531 resets) in 266 ms. (149 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1897 resets) in 301 ms. (132 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1922 resets) in 284 ms. (140 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1916 resets) in 259 ms. (153 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1932 resets) in 262 ms. (152 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1920 resets) in 206 ms. (193 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1925 resets) in 260 ms. (153 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1931 resets) in 295 ms. (135 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1936 resets) in 255 ms. (156 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1948 resets) in 279 ms. (142 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1901 resets) in 253 ms. (157 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1924 resets) in 238 ms. (167 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1911 resets) in 282 ms. (141 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1922 resets) in 262 ms. (152 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 180546 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 13
Probabilistic random walk after 180546 steps, saw 90324 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
// Phase 1: matrix 331 rows 351 cols
[2024-05-22 15:26:07] [INFO ] Computed 50 invariants in 15 ms
[2024-05-22 15:26:07] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 6/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 207/319 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 11/330 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 331/661 variables, 330/380 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 15/395 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 21/682 variables, 21/416 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/682 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/682 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 682/682 variables, and 416 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2245 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 351/351 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 6/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 207/319 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 15:26:10] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-22 15:26:10] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 11/330 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 331/661 variables, 330/382 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 15/397 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/661 variables, 6/403 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/661 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 21/682 variables, 21/424 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/682 variables, 7/431 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 15:26:20] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 11 ms to minimize.
[2024-05-22 15:26:20] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
[2024-05-22 15:26:20] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-05-22 15:26:20] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:26:20] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2024-05-22 15:26:20] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-22 15:26:21] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:26:21] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:26:21] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:26:21] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
[2024-05-22 15:26:21] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:26:21] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:26:21] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:26:22] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/682 variables, 14/445 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 15:26:25] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:26:25] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:26:25] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:26:26] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:26:26] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 0 ms to minimize.
[2024-05-22 15:26:26] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:26:26] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:26:26] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/682 variables, 8/453 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/682 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 15:26:30] [INFO ] Deduced a trap composed of 69 places in 44 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/682 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 15:26:32] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/682 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/682 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 0/682 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 682/682 variables, and 455 constraints, problems are : Problem set: 0 solved, 13 unsolved in 26284 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 351/351 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 26/26 constraints]
After SMT, in 28581ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 30005 ms.
Support contains 106 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 331/331 transitions.
Applied a total of 0 rules in 21 ms. Remains 351 /351 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 351/351 places, 331/331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 331/331 transitions.
Applied a total of 0 rules in 21 ms. Remains 351 /351 variables (removed 0) and now considering 331/331 (removed 0) transitions.
[2024-05-22 15:27:06] [INFO ] Invariant cache hit.
[2024-05-22 15:27:06] [INFO ] Implicit Places using invariants in 155 ms returned [295]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 166 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 350/351 places, 331/331 transitions.
Applied a total of 0 rules in 10 ms. Remains 350 /350 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 198 ms. Remains : 350/351 places, 331/331 transitions.
RANDOM walk for 40000 steps (2535 resets) in 255 ms. (156 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1947 resets) in 232 ms. (171 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1944 resets) in 251 ms. (158 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1919 resets) in 249 ms. (160 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1923 resets) in 256 ms. (155 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1932 resets) in 204 ms. (195 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1929 resets) in 259 ms. (153 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1933 resets) in 261 ms. (152 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1953 resets) in 243 ms. (163 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1934 resets) in 307 ms. (129 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1891 resets) in 262 ms. (152 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1922 resets) in 295 ms. (135 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1937 resets) in 297 ms. (134 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1928 resets) in 176 ms. (225 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 179469 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 13
Probabilistic random walk after 179469 steps, saw 89786 distinct states, run finished after 3002 ms. (steps per millisecond=59 ) properties seen :0
// Phase 1: matrix 331 rows 350 cols
[2024-05-22 15:27:10] [INFO ] Computed 49 invariants in 15 ms
[2024-05-22 15:27:11] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 6/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 203/315 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 12/327 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 331/658 variables, 327/376 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/658 variables, 15/391 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/658 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 23/681 variables, 23/414 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/681 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/681 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 681/681 variables, and 414 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2556 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 350/350 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 6/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 203/315 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 15:27:13] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 12/327 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 331/658 variables, 327/377 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/658 variables, 15/392 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/658 variables, 6/398 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 15:27:14] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/658 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/658 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 23/681 variables, 23/422 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/681 variables, 7/429 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 15:27:23] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:27:23] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-22 15:27:23] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:27:23] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:27:24] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:27:24] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:27:24] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:27:24] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:27:24] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 0 ms to minimize.
[2024-05-22 15:27:24] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:27:26] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:27:26] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:27:26] [INFO ] Deduced a trap composed of 69 places in 48 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/681 variables, 13/442 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 15:27:29] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 0 ms to minimize.
[2024-05-22 15:27:29] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/681 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/681 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 0/681 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 681/681 variables, and 444 constraints, problems are : Problem set: 0 solved, 13 unsolved in 23871 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 350/350 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 17/17 constraints]
After SMT, in 26470ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 106 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 331/331 transitions.
Applied a total of 0 rules in 8 ms. Remains 350 /350 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 350/350 places, 331/331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 331/331 transitions.
Applied a total of 0 rules in 8 ms. Remains 350 /350 variables (removed 0) and now considering 331/331 (removed 0) transitions.
[2024-05-22 15:28:07] [INFO ] Invariant cache hit.
[2024-05-22 15:28:07] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-22 15:28:07] [INFO ] Invariant cache hit.
[2024-05-22 15:28:07] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-22 15:28:08] [INFO ] Implicit Places using invariants and state equation in 1229 ms returned [194, 228, 266, 339, 346]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 1366 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 345/350 places, 331/331 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 345 transition count 331
Applied a total of 2 rules in 18 ms. Remains 345 /345 variables (removed 0) and now considering 331/331 (removed 0) transitions.
// Phase 1: matrix 331 rows 345 cols
[2024-05-22 15:28:08] [INFO ] Computed 44 invariants in 13 ms
[2024-05-22 15:28:08] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-22 15:28:08] [INFO ] Invariant cache hit.
[2024-05-22 15:28:09] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-22 15:28:09] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 345/350 places, 331/331 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2385 ms. Remains : 345/350 places, 331/331 transitions.
RANDOM walk for 40000 steps (2567 resets) in 249 ms. (160 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1934 resets) in 226 ms. (176 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1930 resets) in 230 ms. (173 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1922 resets) in 240 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1899 resets) in 257 ms. (155 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1899 resets) in 260 ms. (153 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1929 resets) in 250 ms. (159 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1930 resets) in 257 ms. (155 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1927 resets) in 258 ms. (154 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1910 resets) in 204 ms. (195 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1928 resets) in 190 ms. (209 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1923 resets) in 290 ms. (137 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1922 resets) in 277 ms. (143 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1919 resets) in 217 ms. (183 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 215121 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 13
Probabilistic random walk after 215121 steps, saw 107616 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2024-05-22 15:28:14] [INFO ] Invariant cache hit.
[2024-05-22 15:28:14] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 6/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 198/310 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 12/322 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 331/653 variables, 322/366 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/653 variables, 15/381 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 23/676 variables, 23/404 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/676 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/676 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 676/676 variables, and 404 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2184 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 345/345 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 6/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 198/310 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 15:28:16] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 12/322 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 331/653 variables, 322/367 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 15/382 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 6/388 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/653 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 23/676 variables, 23/411 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/676 variables, 7/418 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 15:28:28] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
[2024-05-22 15:28:28] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-22 15:28:28] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-22 15:28:28] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-05-22 15:28:28] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-05-22 15:28:28] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:28:28] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:28:28] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:28:29] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:28:29] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:28:29] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:28:29] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:28:29] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:28:29] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:28:30] [INFO ] Deduced a trap composed of 70 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:28:32] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:28:32] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 2 ms to minimize.
[2024-05-22 15:28:32] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 2 ms to minimize.
[2024-05-22 15:28:32] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
[2024-05-22 15:28:33] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/676 variables, 20/438 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 15:28:34] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:28:35] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/676 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/676 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 0/676 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 676/676 variables, and 440 constraints, problems are : Problem set: 0 solved, 13 unsolved in 23868 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 345/345 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 23/23 constraints]
After SMT, in 26075ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 0 properties in 30000 ms.
Support contains 106 out of 345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 345/345 places, 331/331 transitions.
Applied a total of 0 rules in 12 ms. Remains 345 /345 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 345/345 places, 331/331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 345/345 places, 331/331 transitions.
Applied a total of 0 rules in 7 ms. Remains 345 /345 variables (removed 0) and now considering 331/331 (removed 0) transitions.
[2024-05-22 15:29:10] [INFO ] Invariant cache hit.
[2024-05-22 15:29:10] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-22 15:29:10] [INFO ] Invariant cache hit.
[2024-05-22 15:29:10] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-22 15:29:11] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
[2024-05-22 15:29:11] [INFO ] Redundant transitions in 22 ms returned []
Running 330 sub problems to find dead transitions.
[2024-05-22 15:29:11] [INFO ] Invariant cache hit.
[2024-05-22 15:29:11] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 1/345 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/345 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (OVERLAPS) 331/676 variables, 345/389 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/676 variables, 15/404 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-05-22 15:29:37] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:29:38] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:29:40] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/676 variables, 3/407 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 676/676 variables, and 407 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 345/345 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 1/345 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/345 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (OVERLAPS) 331/676 variables, 345/392 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 15/407 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 330/737 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-05-22 15:30:04] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-22 15:30:04] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:30:05] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 13 ms to minimize.
[2024-05-22 15:30:05] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:30:07] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:30:07] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:30:08] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:30:08] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:30:08] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/676 variables, and 746 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 345/345 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 12/12 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61186 ms. Remains : 345/345 places, 331/331 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 345 transition count 328
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 342 transition count 328
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 342 transition count 324
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 338 transition count 324
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 338 transition count 323
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 337 transition count 323
Applied a total of 16 rules in 32 ms. Remains 337 /345 variables (removed 8) and now considering 323/331 (removed 8) transitions.
Running SMT prover for 13 properties.
// Phase 1: matrix 323 rows 337 cols
[2024-05-22 15:30:11] [INFO ] Computed 44 invariants in 14 ms
[2024-05-22 15:30:11] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-22 15:30:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 15:30:11] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 25 ms returned sat
[2024-05-22 15:30:14] [INFO ] After 2602ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
TRAPS : Iteration 0
[2024-05-22 15:30:14] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:30:15] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-22 15:30:15] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-22 15:30:15] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:30:15] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:30:15] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:30:15] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:30:15] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:30:15] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:30:15] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:30:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 931 ms
[2024-05-22 15:30:16] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:30:16] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 2 ms to minimize.
[2024-05-22 15:30:16] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:30:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 326 ms
[2024-05-22 15:30:16] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 0 ms to minimize.
[2024-05-22 15:30:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-05-22 15:30:17] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:30:17] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:30:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2024-05-22 15:30:17] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:30:17] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:30:17] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-22 15:30:17] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:30:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 390 ms
[2024-05-22 15:30:19] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:30:19] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-05-22 15:30:19] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:30:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 444 ms
[2024-05-22 15:30:19] [INFO ] Deduced a trap composed of 68 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:30:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
TRAPS : Iteration 1
[2024-05-22 15:30:21] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 2 ms to minimize.
[2024-05-22 15:30:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2024-05-22 15:30:21] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:30:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
TRAPS : Iteration 2
[2024-05-22 15:30:24] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 0 ms to minimize.
[2024-05-22 15:30:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
TRAPS : Iteration 3
[2024-05-22 15:30:28] [INFO ] Deduced a trap composed of 70 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:30:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
TRAPS : Iteration 4
[2024-05-22 15:30:30] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:30:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
TRAPS : Iteration 5
[2024-05-22 15:30:35] [INFO ] After 23096ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
[2024-05-22 15:30:37] [INFO ] After 25874ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
[2024-05-22 15:30:37] [INFO ] Flatten gal took : 22 ms
[2024-05-22 15:30:37] [INFO ] Flatten gal took : 19 ms
[2024-05-22 15:30:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6459938136919373378.gal : 5 ms
[2024-05-22 15:30:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12708593454832121834.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6459938136919373378.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12708593454832121834.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12708593454832121834.prop.
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :8 after 12
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :12 after 18
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :18 after 40
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :40 after 79
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :79 after 293
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :293 after 1493
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :1493 after 21794
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :21794 after 164462
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :164462 after 413089
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :413089 after 934681
Detected timeout of ITS tools.
[2024-05-22 15:30:52] [INFO ] Flatten gal took : 18 ms
[2024-05-22 15:30:52] [INFO ] Applying decomposition
[2024-05-22 15:30:52] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4051811322485972647.txt' '-o' '/tmp/graph4051811322485972647.bin' '-w' '/tmp/graph4051811322485972647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4051811322485972647.bin' '-l' '-1' '-v' '-w' '/tmp/graph4051811322485972647.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:30:52] [INFO ] Decomposing Gal with order
[2024-05-22 15:30:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:30:53] [INFO ] Removed a total of 163 redundant transitions.
[2024-05-22 15:30:53] [INFO ] Flatten gal took : 70 ms
[2024-05-22 15:30:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 15 ms.
[2024-05-22 15:30:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7784491418853852699.gal : 10 ms
[2024-05-22 15:30:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12976159218387402563.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7784491418853852699.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12976159218387402563.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12976159218387402563.prop.
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :9 after 19
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :19 after 42
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :42 after 75
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :75 after 289
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :289 after 1516
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :1516 after 21812
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :21812 after 164602
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :164602 after 410561
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :410561 after 914796
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 56611 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 15:31:08] [INFO ] Flatten gal took : 23 ms
[2024-05-22 15:31:08] [INFO ] Applying decomposition
[2024-05-22 15:31:08] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15215888856545116156.txt' '-o' '/tmp/graph15215888856545116156.bin' '-w' '/tmp/graph15215888856545116156.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15215888856545116156.bin' '-l' '-1' '-v' '-w' '/tmp/graph15215888856545116156.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:31:08] [INFO ] Decomposing Gal with order
[2024-05-22 15:31:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:31:08] [INFO ] Removed a total of 154 redundant transitions.
[2024-05-22 15:31:08] [INFO ] Flatten gal took : 40 ms
[2024-05-22 15:31:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 13 ms.
[2024-05-22 15:31:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17616650288916482404.gal : 7 ms
[2024-05-22 15:31:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12966729212652480307.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17616650288916482404.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12966729212652480307.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12966729212652480307.prop.
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :6 after 10
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :10 after 11
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :11 after 20
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :20 after 31
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :31 after 67
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :67 after 119
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :119 after 314
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :314 after 2689
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :2689 after 23269
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :23269 after 161260
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :161260 after 461808
SDD proceeding with computation,13 properties remain. new max is 32768
SDD size :461808 after 1.08661e+06
SDD proceeding with computation,13 properties remain. new max is 65536
SDD size :1.08661e+06 after 2.36002e+06
Detected timeout of ITS tools.
[2024-05-22 16:01:08] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
[2024-05-22 16:01:08] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin11236905981544247633
[2024-05-22 16:01:08] [INFO ] Computing symmetric may disable matrix : 331 transitions.
[2024-05-22 16:01:08] [INFO ] Flatten gal took : 12 ms
[2024-05-22 16:01:08] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 16:01:08] [INFO ] Computing symmetric may enable matrix : 331 transitions.
[2024-05-22 16:01:08] [INFO ] Computation of Complete enable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12450624885029779416.txt' '-o' '/tmp/graph12450624885029779416.bin' '-w' '/tmp/graph12450624885029779416.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12450624885029779416.bin' '-l' '-1' '-v' '-w' '/tmp/graph12450624885029779416.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:01:08] [INFO ] Decomposing Gal with order
[2024-05-22 16:01:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:01:08] [INFO ] Computing Do-Not-Accords matrix : 331 transitions.
[2024-05-22 16:01:08] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 16:01:08] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11236905981544247633
[2024-05-22 16:01:08] [INFO ] Removed a total of 160 redundant transitions.
Running compilation step : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '55' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 16:01:08] [INFO ] Flatten gal took : 25 ms
[2024-05-22 16:01:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 11 ms.
[2024-05-22 16:01:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14294374790366730027.gal : 5 ms
[2024-05-22 16:01:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17258296385029740262.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14294374790366730027.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17258296385029740262.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17258296385029740262.prop.
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :8 after 13
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :13 after 19
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :19 after 43
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :43 after 85
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :85 after 481
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :481 after 1585
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :1585 after 27361
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :27361 after 164933
Compilation finished in 972 ms.
Running link step : cd /tmp/ltsmin11236905981544247633;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202400==true'
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :164933 after 411390
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :411390 after 916627
WARNING : LTSmin timed out (>21 s) on command cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202400==true'
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202401==true'
WARNING : LTSmin timed out (>21 s) on command cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202401==true'
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202402==true'
WARNING : LTSmin timed out (>21 s) on command cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202402==true'
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202403==true'
WARNING : LTSmin timed out (>21 s) on command cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202403==true'
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202404==true'
WARNING : LTSmin timed out (>21 s) on command cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202404==true'
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202405==true'
WARNING : LTSmin timed out (>21 s) on command cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202405==true'
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202306==true'
WARNING : LTSmin timed out (>21 s) on command cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202306==true'
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202307==true'
WARNING : LTSmin timed out (>21 s) on command cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202307==true'
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202308==true'
WARNING : LTSmin timed out (>21 s) on command cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202308==true'
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202409==true'
WARNING : LTSmin timed out (>21 s) on command cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202409==true'
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202410==true'
WARNING : LTSmin timed out (>21 s) on command cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202410==true'
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202411==true'
WARNING : LTSmin timed out (>21 s) on command cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202411==true'
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202314==true'
WARNING : LTSmin timed out (>21 s) on command cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202314==true'
Retrying LTSmin with larger timeout 2208 s
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202400==true'
WARNING : LTSmin timed out (>169 s) on command cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202400==true'
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202401==true'
WARNING : LTSmin timed out (>169 s) on command cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202401==true'
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202402==true'
LTSmin run took 25060 ms.
Found Violation
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202403==true'
WARNING : LTSmin timed out (>169 s) on command cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202403==true'
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202404==true'
Invariant property DoubleExponent-PT-010-ReachabilityCardinality-2024-02 does not hold.
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :916627 after 1.64992e+08
WARNING : LTSmin timed out (>169 s) on command cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202404==true'
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202405==true'
WARNING : LTSmin timed out (>169 s) on command cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202405==true'
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202306==true'
WARNING : LTSmin timed out (>169 s) on command cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202306==true'
Running LTSmin : cd /tmp/ltsmin11236905981544247633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202307==true'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-010"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-010, 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 r136-tall-171631132900558"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-010.tgz
mv DoubleExponent-PT-010 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 ;