MCC'2023- Execution of r165-tall-167838850700669

About the Execution of ITS-Tools for FunctionPointer-PT-b004

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15127.000	3600000.00	3651882.00	30086.20	0 ? ? ? 4 1 0 4 1 0 ? 0 ? ? 0 0	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r165-tall-167838850700669.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is FunctionPointer-PT-b004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850700669
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 876K
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 11:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 25 11:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 11:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 391K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679544412877

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b004
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-23 04:06:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 04:06:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 04:06:54] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-23 04:06:54] [INFO ] Transformed 306 places.
[2023-03-23 04:06:54] [INFO ] Transformed 840 transitions.
[2023-03-23 04:06:54] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Deduced a syphon composed of 84 places in 4 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b004-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 414 out of 648 initially.
// Phase 1: matrix 414 rows 222 cols
[2023-03-23 04:06:54] [INFO ] Computed 4 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :46
FORMULA FunctionPointer-PT-b004-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :13
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :42
[2023-03-23 04:06:54] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2023-03-23 04:06:54] [INFO ] Computed 4 place invariants in 13 ms
[2023-03-23 04:06:55] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 04:06:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 04:06:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:06:55] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-03-23 04:06:55] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-23 04:06:55] [INFO ] [Real]Added 65 Read/Feed constraints in 13 ms returned sat
[2023-03-23 04:06:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:06:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:06:55] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 04:06:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:06:55] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-23 04:06:55] [INFO ] [Nat]Added 65 Read/Feed constraints in 21 ms returned sat
[2023-03-23 04:06:55] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 3 ms to minimize.
[2023-03-23 04:06:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-23 04:06:55] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 53 ms.
[2023-03-23 04:06:55] [INFO ] Added : 1 causal constraints over 1 iterations in 109 ms. Result :sat
Minimization took 37 ms.
[2023-03-23 04:06:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:06:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 04:06:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:06:55] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-23 04:06:55] [INFO ] [Real]Added 65 Read/Feed constraints in 13 ms returned sat
[2023-03-23 04:06:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:06:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 04:06:56] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 04:06:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:06:56] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-23 04:06:56] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2023-03-23 04:06:56] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2023-03-23 04:06:56] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 0 ms to minimize.
[2023-03-23 04:06:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 234 ms
[2023-03-23 04:06:56] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 52 ms.
[2023-03-23 04:06:56] [INFO ] Added : 4 causal constraints over 2 iterations in 144 ms. Result :sat
Minimization took 30 ms.
[2023-03-23 04:06:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:06:56] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-23 04:06:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:06:56] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-23 04:06:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:06:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:06:56] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 04:06:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:06:56] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-23 04:06:56] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2023-03-23 04:06:56] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2023-03-23 04:06:57] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2023-03-23 04:06:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
[2023-03-23 04:06:57] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 34 ms.
[2023-03-23 04:06:57] [INFO ] Added : 2 causal constraints over 1 iterations in 93 ms. Result :sat
Minimization took 335 ms.
[2023-03-23 04:06:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:06:57] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 04:06:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:06:57] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-23 04:06:57] [INFO ] [Real]Added 65 Read/Feed constraints in 7 ms returned sat
[2023-03-23 04:06:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:06:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:06:57] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-23 04:06:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:06:57] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2023-03-23 04:06:57] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2023-03-23 04:06:57] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 0 ms to minimize.
[2023-03-23 04:06:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-23 04:06:57] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 33 ms.
[2023-03-23 04:06:57] [INFO ] Added : 1 causal constraints over 1 iterations in 80 ms. Result :sat
Minimization took 27 ms.
[2023-03-23 04:06:58] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:06:58] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 04:06:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:06:58] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2023-03-23 04:06:58] [INFO ] [Real]Added 65 Read/Feed constraints in 16 ms returned sat
[2023-03-23 04:06:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:06:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:06:58] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 04:06:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:06:58] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-23 04:06:58] [INFO ] [Nat]Added 65 Read/Feed constraints in 11 ms returned sat
[2023-03-23 04:06:58] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 1 ms to minimize.
[2023-03-23 04:06:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-23 04:06:58] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 29 ms.
[2023-03-23 04:06:58] [INFO ] Added : 2 causal constraints over 1 iterations in 86 ms. Result :sat
Minimization took 34 ms.
[2023-03-23 04:06:58] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 04:06:58] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 04:06:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:06:58] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-23 04:06:58] [INFO ] [Real]Added 65 Read/Feed constraints in 10 ms returned sat
[2023-03-23 04:06:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:06:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:06:58] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 04:06:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:06:58] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-23 04:06:58] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2023-03-23 04:06:58] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2023-03-23 04:06:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-23 04:06:59] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 26 ms.
[2023-03-23 04:06:59] [INFO ] Added : 1 causal constraints over 1 iterations in 99 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1] Max seen :[10, 23, 2, 2, 10, 37]
Support contains 6 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 192 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.2 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 192 transition count 605
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 70 place count 166 transition count 449
Iterating global reduction 1 with 26 rules applied. Total rules applied 96 place count 166 transition count 449
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 124 place count 166 transition count 421
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 137 place count 153 transition count 395
Iterating global reduction 2 with 13 rules applied. Total rules applied 150 place count 153 transition count 395
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 156 place count 147 transition count 383
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 147 transition count 383
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 168 place count 141 transition count 359
Iterating global reduction 2 with 6 rules applied. Total rules applied 174 place count 141 transition count 359
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 179 place count 136 transition count 349
Iterating global reduction 2 with 5 rules applied. Total rules applied 184 place count 136 transition count 349
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 189 place count 131 transition count 329
Iterating global reduction 2 with 5 rules applied. Total rules applied 194 place count 131 transition count 329
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 199 place count 126 transition count 309
Iterating global reduction 2 with 5 rules applied. Total rules applied 204 place count 126 transition count 309
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 209 place count 121 transition count 299
Iterating global reduction 2 with 5 rules applied. Total rules applied 214 place count 121 transition count 299
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 219 place count 116 transition count 289
Iterating global reduction 2 with 5 rules applied. Total rules applied 224 place count 116 transition count 289
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 229 place count 111 transition count 279
Iterating global reduction 2 with 5 rules applied. Total rules applied 234 place count 111 transition count 279
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 239 place count 106 transition count 269
Iterating global reduction 2 with 5 rules applied. Total rules applied 244 place count 106 transition count 269
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 249 place count 101 transition count 259
Iterating global reduction 2 with 5 rules applied. Total rules applied 254 place count 101 transition count 259
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 260 place count 101 transition count 253
Applied a total of 260 rules in 117 ms. Remains 101 /222 variables (removed 121) and now considering 253/648 (removed 395) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 101/222 places, 253/648 transitions.
Normalized transition count is 159 out of 253 initially.
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:06:59] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1222 ms. (steps per millisecond=818 ) properties (out of 6) seen :7880
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=2257 ) properties (out of 6) seen :886
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 466 ms. (steps per millisecond=2145 ) properties (out of 6) seen :266
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 431 ms. (steps per millisecond=2320 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 505 ms. (steps per millisecond=1980 ) properties (out of 6) seen :673
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 477 ms. (steps per millisecond=2096 ) properties (out of 6) seen :922
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=2336 ) properties (out of 6) seen :304
[2023-03-23 04:07:03] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:07:03] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 04:07:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:07:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:03] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-23 04:07:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:07:03] [INFO ] [Real]Added 25 Read/Feed constraints in 14 ms returned sat
[2023-03-23 04:07:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:07:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:07:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:03] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-23 04:07:03] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:07:03] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2023-03-23 04:07:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-23 04:07:03] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 7 ms.
[2023-03-23 04:07:03] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2023-03-23 04:07:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-23 04:07:03] [INFO ] Added : 9 causal constraints over 3 iterations in 115 ms. Result :sat
Minimization took 15 ms.
[2023-03-23 04:07:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:07:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:03] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-23 04:07:03] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:07:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:07:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:07:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:03] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-23 04:07:03] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:07:03] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 15 ms.
[2023-03-23 04:07:04] [INFO ] Added : 26 causal constraints over 6 iterations in 88 ms. Result :sat
Minimization took 19 ms.
[2023-03-23 04:07:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:07:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:04] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:07:04] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:07:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:07:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:07:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:04] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-23 04:07:04] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:07:04] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2023-03-23 04:07:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-23 04:07:04] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 9 ms.
[2023-03-23 04:07:04] [INFO ] Added : 7 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 14 ms.
[2023-03-23 04:07:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:07:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:04] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-23 04:07:04] [INFO ] [Real]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-23 04:07:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:07:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:07:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:04] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-23 04:07:04] [INFO ] [Nat]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-23 04:07:04] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2023-03-23 04:07:04] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 0 ms to minimize.
[2023-03-23 04:07:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2023-03-23 04:07:04] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 9 ms.
[2023-03-23 04:07:04] [INFO ] Added : 19 causal constraints over 5 iterations in 71 ms. Result :sat
Minimization took 19 ms.
[2023-03-23 04:07:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:07:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:04] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:07:04] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:07:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:07:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:07:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:04] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-23 04:07:04] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:07:04] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2023-03-23 04:07:04] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2023-03-23 04:07:05] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2023-03-23 04:07:05] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2023-03-23 04:07:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 203 ms
[2023-03-23 04:07:05] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 10 ms.
[2023-03-23 04:07:05] [INFO ] Added : 13 causal constraints over 3 iterations in 55 ms. Result :sat
Minimization took 15 ms.
[2023-03-23 04:07:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:07:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:05] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-23 04:07:05] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2023-03-23 04:07:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:07:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 04:07:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:05] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-23 04:07:05] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:07:05] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2023-03-23 04:07:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-23 04:07:05] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 11 ms.
[2023-03-23 04:07:05] [INFO ] Added : 8 causal constraints over 3 iterations in 47 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1] Max seen :[881, 7858, 4, 481, 696, 37]
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Applied a total of 0 rules in 14 ms. Remains 101 /101 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 101/101 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Applied a total of 0 rules in 8 ms. Remains 101 /101 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-23 04:07:25] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:07:25] [INFO ] Invariant cache hit.
[2023-03-23 04:07:25] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-23 04:07:25] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:07:25] [INFO ] Invariant cache hit.
[2023-03-23 04:07:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:07:25] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-23 04:07:25] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-23 04:07:25] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:07:25] [INFO ] Invariant cache hit.
[2023-03-23 04:07:25] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 101/101 places, 253/253 transitions.
Normalized transition count is 159 out of 253 initially.
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:07:25] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1146 ms. (steps per millisecond=872 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 425 ms. (steps per millisecond=2352 ) properties (out of 6) seen :1106
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 426 ms. (steps per millisecond=2347 ) properties (out of 6) seen :287
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 422 ms. (steps per millisecond=2369 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 451 ms. (steps per millisecond=2217 ) properties (out of 6) seen :1059
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 451 ms. (steps per millisecond=2217 ) properties (out of 6) seen :1047
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=2298 ) properties (out of 6) seen :3200
[2023-03-23 04:07:29] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:07:29] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-23 04:07:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:07:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:29] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-23 04:07:29] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:07:29] [INFO ] [Real]Added 25 Read/Feed constraints in 7 ms returned sat
[2023-03-23 04:07:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:07:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:07:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:29] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:07:29] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:07:29] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2023-03-23 04:07:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-23 04:07:29] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 9 ms.
[2023-03-23 04:07:29] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2023-03-23 04:07:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-23 04:07:29] [INFO ] Added : 9 causal constraints over 3 iterations in 114 ms. Result :sat
Minimization took 18 ms.
[2023-03-23 04:07:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:07:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:29] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-23 04:07:29] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:07:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:07:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:07:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:29] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-23 04:07:29] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:07:29] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 9 ms.
[2023-03-23 04:07:29] [INFO ] Added : 26 causal constraints over 6 iterations in 69 ms. Result :sat
Minimization took 19 ms.
[2023-03-23 04:07:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:07:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:29] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-23 04:07:29] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:07:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:07:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:07:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:29] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:07:29] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:07:29] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2023-03-23 04:07:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-23 04:07:29] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 9 ms.
[2023-03-23 04:07:29] [INFO ] Added : 7 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 14 ms.
[2023-03-23 04:07:30] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 04:07:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:30] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:07:30] [INFO ] [Real]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-23 04:07:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:07:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:07:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:30] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:07:30] [INFO ] [Nat]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-23 04:07:30] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2023-03-23 04:07:30] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2023-03-23 04:07:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2023-03-23 04:07:30] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:07:30] [INFO ] Added : 19 causal constraints over 5 iterations in 68 ms. Result :sat
Minimization took 21 ms.
[2023-03-23 04:07:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:07:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:30] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-23 04:07:30] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:07:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:07:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:07:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:30] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-23 04:07:30] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:07:30] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
[2023-03-23 04:07:30] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2023-03-23 04:07:30] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2023-03-23 04:07:30] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2023-03-23 04:07:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 206 ms
[2023-03-23 04:07:30] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:07:30] [INFO ] Added : 13 causal constraints over 3 iterations in 62 ms. Result :sat
Minimization took 14 ms.
[2023-03-23 04:07:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:07:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:30] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:07:30] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2023-03-23 04:07:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:07:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 04:07:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:07:30] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-23 04:07:30] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:07:30] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2023-03-23 04:07:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-23 04:07:30] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 9 ms.
[2023-03-23 04:07:31] [INFO ] Added : 8 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1] Max seen :[1089, 7858, 4, 818, 696, 2818]
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Applied a total of 0 rules in 12 ms. Remains 101 /101 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 101/101 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Applied a total of 0 rules in 6 ms. Remains 101 /101 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-23 04:07:57] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:07:57] [INFO ] Invariant cache hit.
[2023-03-23 04:07:58] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-23 04:07:58] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:07:58] [INFO ] Invariant cache hit.
[2023-03-23 04:07:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:07:58] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-23 04:07:58] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-23 04:07:58] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:07:58] [INFO ] Invariant cache hit.
[2023-03-23 04:07:58] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 324 ms. Remains : 101/101 places, 253/253 transitions.
Normalized transition count is 159 out of 253 initially.
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:07:58] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1121 ms. (steps per millisecond=892 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=2304 ) properties (out of 6) seen :734
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 425 ms. (steps per millisecond=2352 ) properties (out of 6) seen :20
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 449 ms. (steps per millisecond=2227 ) properties (out of 6) seen :216
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 426 ms. (steps per millisecond=2347 ) properties (out of 6) seen :792
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 429 ms. (steps per millisecond=2331 ) properties (out of 6) seen :1005
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 420 ms. (steps per millisecond=2380 ) properties (out of 6) seen :287
[2023-03-23 04:08:01] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:08:01] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-23 04:08:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:08:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:02] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-23 04:08:02] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:08:02] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:08:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:08:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:08:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:02] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:08:02] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:08:02] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2023-03-23 04:08:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-23 04:08:02] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:08:02] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2023-03-23 04:08:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-23 04:08:02] [INFO ] Added : 9 causal constraints over 3 iterations in 107 ms. Result :sat
Minimization took 13 ms.
[2023-03-23 04:08:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:02] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:08:02] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:08:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:08:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:08:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:02] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-23 04:08:02] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:08:02] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 9 ms.
[2023-03-23 04:08:02] [INFO ] Added : 26 causal constraints over 6 iterations in 71 ms. Result :sat
Minimization took 20 ms.
[2023-03-23 04:08:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:02] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-23 04:08:02] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:08:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:08:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:08:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:02] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-23 04:08:02] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:08:02] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2023-03-23 04:08:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-23 04:08:02] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:08:02] [INFO ] Added : 7 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 14 ms.
[2023-03-23 04:08:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:02] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-23 04:08:02] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2023-03-23 04:08:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:08:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:08:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:02] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-23 04:08:02] [INFO ] [Nat]Added 25 Read/Feed constraints in 7 ms returned sat
[2023-03-23 04:08:02] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2023-03-23 04:08:02] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2023-03-23 04:08:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2023-03-23 04:08:02] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:08:03] [INFO ] Added : 19 causal constraints over 5 iterations in 60 ms. Result :sat
Minimization took 18 ms.
[2023-03-23 04:08:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:08:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:03] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-23 04:08:03] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:08:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:08:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:08:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:03] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-23 04:08:03] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:08:03] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2023-03-23 04:08:03] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 3 ms to minimize.
[2023-03-23 04:08:03] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2023-03-23 04:08:03] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2023-03-23 04:08:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 217 ms
[2023-03-23 04:08:03] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 10 ms.
[2023-03-23 04:08:03] [INFO ] Added : 13 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 15 ms.
[2023-03-23 04:08:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:08:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:03] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:08:03] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2023-03-23 04:08:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:08:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:08:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:03] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-23 04:08:03] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:08:03] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2023-03-23 04:08:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-23 04:08:03] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:08:03] [INFO ] Added : 8 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1] Max seen :[1089, 9351, 4, 818, 766, 2818]
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Applied a total of 0 rules in 7 ms. Remains 101 /101 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 101/101 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Applied a total of 0 rules in 6 ms. Remains 101 /101 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-23 04:08:26] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:08:26] [INFO ] Invariant cache hit.
[2023-03-23 04:08:26] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-23 04:08:26] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:08:26] [INFO ] Invariant cache hit.
[2023-03-23 04:08:27] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:08:27] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-23 04:08:27] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-23 04:08:27] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:08:27] [INFO ] Invariant cache hit.
[2023-03-23 04:08:27] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 101/101 places, 253/253 transitions.
Normalized transition count is 159 out of 253 initially.
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:08:27] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1107 ms. (steps per millisecond=903 ) properties (out of 6) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 411 ms. (steps per millisecond=2433 ) properties (out of 6) seen :772
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 418 ms. (steps per millisecond=2392 ) properties (out of 6) seen :21
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 451 ms. (steps per millisecond=2217 ) properties (out of 6) seen :271
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 439 ms. (steps per millisecond=2277 ) properties (out of 6) seen :897
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 421 ms. (steps per millisecond=2375 ) properties (out of 6) seen :712
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=2500 ) properties (out of 6) seen :2133
[2023-03-23 04:08:30] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:08:30] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-23 04:08:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:08:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:30] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-23 04:08:30] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:08:30] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:08:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:08:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:08:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:30] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-23 04:08:30] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:08:31] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2023-03-23 04:08:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-23 04:08:31] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 11 ms.
[2023-03-23 04:08:31] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2023-03-23 04:08:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-23 04:08:31] [INFO ] Added : 9 causal constraints over 3 iterations in 111 ms. Result :sat
Minimization took 14 ms.
[2023-03-23 04:08:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:08:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:31] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-23 04:08:31] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:08:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:08:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:08:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:31] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:08:31] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:08:31] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 11 ms.
[2023-03-23 04:08:31] [INFO ] Added : 26 causal constraints over 6 iterations in 70 ms. Result :sat
Minimization took 18 ms.
[2023-03-23 04:08:31] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:08:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:31] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-23 04:08:31] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:08:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:08:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:08:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:31] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-23 04:08:31] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:08:31] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2023-03-23 04:08:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-23 04:08:31] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 10 ms.
[2023-03-23 04:08:31] [INFO ] Added : 7 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 14 ms.
[2023-03-23 04:08:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:08:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:31] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-23 04:08:31] [INFO ] [Real]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-23 04:08:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:08:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:08:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:31] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-23 04:08:31] [INFO ] [Nat]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-23 04:08:31] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2023-03-23 04:08:31] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2023-03-23 04:08:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2023-03-23 04:08:31] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 7 ms.
[2023-03-23 04:08:31] [INFO ] Added : 19 causal constraints over 5 iterations in 61 ms. Result :sat
Minimization took 18 ms.
[2023-03-23 04:08:31] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:08:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:32] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-23 04:08:32] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:08:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:08:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:08:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:32] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-23 04:08:32] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:08:32] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2023-03-23 04:08:32] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2023-03-23 04:08:32] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2023-03-23 04:08:32] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2023-03-23 04:08:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 202 ms
[2023-03-23 04:08:32] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 9 ms.
[2023-03-23 04:08:32] [INFO ] Added : 13 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 19 ms.
[2023-03-23 04:08:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:08:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:32] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:08:32] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2023-03-23 04:08:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:08:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:08:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:08:32] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:08:32] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:08:32] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2023-03-23 04:08:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-23 04:08:32] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 9 ms.
[2023-03-23 04:08:32] [INFO ] Added : 8 causal constraints over 3 iterations in 43 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1] Max seen :[1089, 9351, 4, 818, 766, 2818]
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 101/101 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-23 04:09:03] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:09:03] [INFO ] Invariant cache hit.
[2023-03-23 04:09:03] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-23 04:09:03] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:09:03] [INFO ] Invariant cache hit.
[2023-03-23 04:09:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:09:03] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-23 04:09:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 04:09:03] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:09:03] [INFO ] Invariant cache hit.
[2023-03-23 04:09:03] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 101/101 places, 253/253 transitions.
Normalized transition count is 159 out of 253 initially.
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:09:03] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1101 ms. (steps per millisecond=908 ) properties (out of 6) seen :15
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=2398 ) properties (out of 6) seen :510
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 432 ms. (steps per millisecond=2314 ) properties (out of 6) seen :174
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 445 ms. (steps per millisecond=2247 ) properties (out of 6) seen :270
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 436 ms. (steps per millisecond=2293 ) properties (out of 6) seen :725
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 436 ms. (steps per millisecond=2293 ) properties (out of 6) seen :958
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=2421 ) properties (out of 6) seen :246
[2023-03-23 04:09:07] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:09:07] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-23 04:09:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:07] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:09:07] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:09:07] [INFO ] [Real]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-23 04:09:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:09:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:07] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-23 04:09:07] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:09:07] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2023-03-23 04:09:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-23 04:09:07] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 13 ms.
[2023-03-23 04:09:07] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2023-03-23 04:09:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-23 04:09:07] [INFO ] Added : 9 causal constraints over 3 iterations in 116 ms. Result :sat
Minimization took 16 ms.
[2023-03-23 04:09:07] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:07] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-23 04:09:07] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:09:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:09:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:07] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-23 04:09:07] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:09:07] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 11 ms.
[2023-03-23 04:09:07] [INFO ] Added : 26 causal constraints over 6 iterations in 78 ms. Result :sat
Minimization took 19 ms.
[2023-03-23 04:09:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:08] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-23 04:09:08] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:09:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:09:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:08] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:09:08] [INFO ] [Nat]Added 25 Read/Feed constraints in 7 ms returned sat
[2023-03-23 04:09:08] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2023-03-23 04:09:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-23 04:09:08] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 9 ms.
[2023-03-23 04:09:08] [INFO ] Added : 12 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 17 ms.
[2023-03-23 04:09:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:08] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-23 04:09:08] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2023-03-23 04:09:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:09:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:08] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-23 04:09:08] [INFO ] [Nat]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-23 04:09:08] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2023-03-23 04:09:08] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2023-03-23 04:09:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2023-03-23 04:09:08] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:09:08] [INFO ] Added : 19 causal constraints over 5 iterations in 60 ms. Result :sat
Minimization took 17 ms.
[2023-03-23 04:09:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:08] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-23 04:09:08] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:09:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:09:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:08] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-23 04:09:08] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:09:08] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2023-03-23 04:09:08] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2023-03-23 04:09:08] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2023-03-23 04:09:08] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 8 ms to minimize.
[2023-03-23 04:09:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 201 ms
[2023-03-23 04:09:08] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:09:08] [INFO ] Added : 13 causal constraints over 3 iterations in 48 ms. Result :sat
Minimization took 14 ms.
[2023-03-23 04:09:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:08] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-23 04:09:09] [INFO ] [Real]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-23 04:09:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:09:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:09:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:09] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:09:09] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:09:09] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2023-03-23 04:09:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-23 04:09:09] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:09:09] [INFO ] Added : 8 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1] Max seen :[1089, 9351, 6, 818, 766, 2818]
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 101/101 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-23 04:09:34] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:09:34] [INFO ] Invariant cache hit.
[2023-03-23 04:09:34] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-23 04:09:34] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:09:34] [INFO ] Invariant cache hit.
[2023-03-23 04:09:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:09:34] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-23 04:09:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 04:09:34] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:09:34] [INFO ] Invariant cache hit.
[2023-03-23 04:09:34] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 101/101 places, 253/253 transitions.
Normalized transition count is 159 out of 253 initially.
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:09:34] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1156 ms. (steps per millisecond=865 ) properties (out of 6) seen :5469
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 408 ms. (steps per millisecond=2450 ) properties (out of 6) seen :1743
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 451 ms. (steps per millisecond=2217 ) properties (out of 6) seen :193
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 436 ms. (steps per millisecond=2293 ) properties (out of 6) seen :367
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 450 ms. (steps per millisecond=2222 ) properties (out of 6) seen :809
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 421 ms. (steps per millisecond=2375 ) properties (out of 6) seen :998
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 406 ms. (steps per millisecond=2463 ) properties (out of 6) seen :2810
[2023-03-23 04:09:38] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:09:38] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-23 04:09:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:09:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:38] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-23 04:09:38] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:09:38] [INFO ] [Real]Added 25 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:09:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:09:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:09:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:38] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-23 04:09:38] [INFO ] [Nat]Added 25 Read/Feed constraints in 5 ms returned sat
[2023-03-23 04:09:38] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2023-03-23 04:09:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-23 04:09:38] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:09:38] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2023-03-23 04:09:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-23 04:09:38] [INFO ] Added : 9 causal constraints over 3 iterations in 110 ms. Result :sat
Minimization took 15 ms.
[2023-03-23 04:09:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:09:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:38] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-23 04:09:38] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:09:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:09:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:09:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:38] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:09:38] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:09:38] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:09:38] [INFO ] Added : 26 causal constraints over 6 iterations in 68 ms. Result :sat
Minimization took 19 ms.
[2023-03-23 04:09:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:09:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:38] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:09:38] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2023-03-23 04:09:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:09:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:09:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:38] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-23 04:09:38] [INFO ] [Nat]Added 25 Read/Feed constraints in 5 ms returned sat
[2023-03-23 04:09:38] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
[2023-03-23 04:09:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-23 04:09:38] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 13 ms.
[2023-03-23 04:09:39] [INFO ] Added : 12 causal constraints over 4 iterations in 61 ms. Result :sat
Minimization took 23 ms.
[2023-03-23 04:09:39] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 04:09:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:39] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-23 04:09:39] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2023-03-23 04:09:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:09:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:09:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:39] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-23 04:09:39] [INFO ] [Nat]Added 25 Read/Feed constraints in 7 ms returned sat
[2023-03-23 04:09:39] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
[2023-03-23 04:09:39] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2023-03-23 04:09:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2023-03-23 04:09:39] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:09:39] [INFO ] Added : 19 causal constraints over 5 iterations in 63 ms. Result :sat
Minimization took 17 ms.
[2023-03-23 04:09:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:09:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:39] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-23 04:09:39] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:09:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:09:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:09:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:39] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-23 04:09:39] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:09:39] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2023-03-23 04:09:39] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2023-03-23 04:09:39] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
[2023-03-23 04:09:39] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2023-03-23 04:09:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 200 ms
[2023-03-23 04:09:39] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:09:39] [INFO ] Added : 13 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 15 ms.
[2023-03-23 04:09:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:09:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:39] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-23 04:09:39] [INFO ] [Real]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-23 04:09:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:09:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 04:09:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:09:39] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-23 04:09:39] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:09:39] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2023-03-23 04:09:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-23 04:09:39] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 9 ms.
[2023-03-23 04:09:39] [INFO ] Added : 8 causal constraints over 3 iterations in 43 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1] Max seen :[1729, 14459, 6, 818, 766, 2819]
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 101/101 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-23 04:10:15] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:10:15] [INFO ] Invariant cache hit.
[2023-03-23 04:10:15] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-23 04:10:15] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:10:15] [INFO ] Invariant cache hit.
[2023-03-23 04:10:15] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:10:15] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-23 04:10:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 04:10:15] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:10:15] [INFO ] Invariant cache hit.
[2023-03-23 04:10:15] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 101/101 places, 253/253 transitions.
Normalized transition count is 159 out of 253 initially.
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:10:15] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1086 ms. (steps per millisecond=920 ) properties (out of 6) seen :7872
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 409 ms. (steps per millisecond=2444 ) properties (out of 6) seen :691
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 450 ms. (steps per millisecond=2222 ) properties (out of 6) seen :224
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 430 ms. (steps per millisecond=2325 ) properties (out of 6) seen :279
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 426 ms. (steps per millisecond=2347 ) properties (out of 6) seen :810
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=2304 ) properties (out of 6) seen :976
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=2267 ) properties (out of 6) seen :1399
[2023-03-23 04:10:18] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:10:18] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-23 04:10:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:10:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:10:19] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-23 04:10:19] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:10:19] [INFO ] [Real]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-23 04:10:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:10:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:10:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:10:19] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-23 04:10:19] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:10:19] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 3 ms to minimize.
[2023-03-23 04:10:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-23 04:10:19] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:10:19] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2023-03-23 04:10:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-23 04:10:19] [INFO ] Added : 9 causal constraints over 3 iterations in 98 ms. Result :sat
Minimization took 13 ms.
[2023-03-23 04:10:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:10:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:10:19] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-23 04:10:19] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:10:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:10:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:10:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:10:19] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-23 04:10:19] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:10:19] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 9 ms.
[2023-03-23 04:10:19] [INFO ] Added : 26 causal constraints over 6 iterations in 76 ms. Result :sat
Minimization took 19 ms.
[2023-03-23 04:10:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:10:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:10:19] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-23 04:10:19] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:10:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:10:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:10:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:10:19] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-23 04:10:19] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:10:19] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2023-03-23 04:10:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-23 04:10:19] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:10:19] [INFO ] Added : 12 causal constraints over 4 iterations in 44 ms. Result :sat
Minimization took 13 ms.
[2023-03-23 04:10:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:10:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:10:19] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-23 04:10:19] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2023-03-23 04:10:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:10:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:10:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:10:19] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:10:19] [INFO ] [Nat]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-23 04:10:19] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2023-03-23 04:10:20] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2023-03-23 04:10:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2023-03-23 04:10:20] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:10:20] [INFO ] Added : 19 causal constraints over 5 iterations in 68 ms. Result :sat
Minimization took 25 ms.
[2023-03-23 04:10:20] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:10:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:10:20] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:10:20] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:10:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:10:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:10:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:10:20] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-23 04:10:20] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:10:20] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
[2023-03-23 04:10:20] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2023-03-23 04:10:20] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2023-03-23 04:10:20] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2023-03-23 04:10:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 204 ms
[2023-03-23 04:10:20] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 10 ms.
[2023-03-23 04:10:20] [INFO ] Added : 13 causal constraints over 3 iterations in 54 ms. Result :sat
Minimization took 17 ms.
[2023-03-23 04:10:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:10:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:10:20] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:10:20] [INFO ] [Real]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-23 04:10:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:10:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:10:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:10:20] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-23 04:10:20] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:10:20] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2023-03-23 04:10:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-23 04:10:20] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 12 ms.
[2023-03-23 04:10:20] [INFO ] Added : 8 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1] Max seen :[1729, 20219, 6, 818, 766, 2819]
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 101/101 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-23 04:10:57] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:10:57] [INFO ] Invariant cache hit.
[2023-03-23 04:10:57] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-23 04:10:57] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:10:57] [INFO ] Invariant cache hit.
[2023-03-23 04:10:57] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:10:57] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-23 04:10:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 04:10:57] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
[2023-03-23 04:10:57] [INFO ] Invariant cache hit.
[2023-03-23 04:10:57] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 330 ms. Remains : 101/101 places, 253/253 transitions.
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-01
Normalized transition count is 159 out of 253 initially.
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:10:57] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :8
[2023-03-23 04:10:58] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:10:58] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 04:10:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:10:58] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:10:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:10:58] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:10:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:10:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:10:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:10:58] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:10:58] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:10:58] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2023-03-23 04:10:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-23 04:10:58] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:10:58] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2023-03-23 04:10:58] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2023-03-23 04:10:58] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2023-03-23 04:10:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 154 ms
[2023-03-23 04:10:58] [INFO ] Added : 9 causal constraints over 3 iterations in 198 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[8]
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Graph (complete) has 428 edges and 101 vertex of which 97 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 97 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 94 transition count 242
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 94 transition count 242
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 94 transition count 240
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 90 transition count 230
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 90 transition count 230
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 90 transition count 226
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 88 transition count 222
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 88 transition count 222
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 86 transition count 216
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 86 transition count 216
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 36 place count 84 transition count 212
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 84 transition count 212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 40 place count 82 transition count 206
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 82 transition count 206
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 80 transition count 202
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 80 transition count 202
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 48 place count 78 transition count 198
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 78 transition count 198
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 77 transition count 196
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 77 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 76 transition count 194
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 76 transition count 194
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 75 transition count 192
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 75 transition count 192
Applied a total of 56 rules in 25 ms. Remains 75 /101 variables (removed 26) and now considering 192/253 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 75/101 places, 192/253 transitions.
Normalized transition count is 117 out of 192 initially.
// Phase 1: matrix 117 rows 75 cols
[2023-03-23 04:10:58] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 914 ms. (steps per millisecond=1094 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=2604 ) properties (out of 1) seen :1437
[2023-03-23 04:10:59] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2023-03-23 04:10:59] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-23 04:10:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:10:59] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-23 04:10:59] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-23 04:10:59] [INFO ] [Real]Added 17 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:10:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:10:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:10:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:10:59] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-23 04:10:59] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:10:59] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2023-03-23 04:10:59] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2023-03-23 04:10:59] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2023-03-23 04:10:59] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2023-03-23 04:11:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 157 ms
[2023-03-23 04:11:00] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 5 ms.
[2023-03-23 04:11:00] [INFO ] Added : 6 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1437]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 10 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-23 04:11:01] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2023-03-23 04:11:01] [INFO ] Invariant cache hit.
[2023-03-23 04:11:01] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-23 04:11:01] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2023-03-23 04:11:01] [INFO ] Invariant cache hit.
[2023-03-23 04:11:01] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-23 04:11:01] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-23 04:11:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 04:11:01] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2023-03-23 04:11:01] [INFO ] Invariant cache hit.
[2023-03-23 04:11:01] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 75/75 places, 192/192 transitions.
Normalized transition count is 117 out of 192 initially.
// Phase 1: matrix 117 rows 75 cols
[2023-03-23 04:11:01] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000004 steps, including 2 resets, run finished after 872 ms. (steps per millisecond=1146 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=2673 ) properties (out of 1) seen :1445
[2023-03-23 04:11:02] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2023-03-23 04:11:02] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-23 04:11:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:02] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-23 04:11:02] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-23 04:11:02] [INFO ] [Real]Added 17 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:11:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:11:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:02] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-23 04:11:02] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:11:02] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2023-03-23 04:11:02] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2023-03-23 04:11:02] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2023-03-23 04:11:02] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2023-03-23 04:11:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 175 ms
[2023-03-23 04:11:02] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 6 ms.
[2023-03-23 04:11:02] [INFO ] Added : 6 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1445]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-23 04:11:04] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2023-03-23 04:11:04] [INFO ] Invariant cache hit.
[2023-03-23 04:11:04] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-23 04:11:04] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2023-03-23 04:11:04] [INFO ] Invariant cache hit.
[2023-03-23 04:11:04] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-23 04:11:04] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-23 04:11:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 04:11:04] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2023-03-23 04:11:04] [INFO ] Invariant cache hit.
[2023-03-23 04:11:04] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 75/75 places, 192/192 transitions.
Normalized transition count is 117 out of 192 initially.
// Phase 1: matrix 117 rows 75 cols
[2023-03-23 04:11:04] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 873 ms. (steps per millisecond=1145 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 372 ms. (steps per millisecond=2688 ) properties (out of 1) seen :1413
[2023-03-23 04:11:05] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2023-03-23 04:11:05] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-23 04:11:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:11:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:05] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-23 04:11:05] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-23 04:11:05] [INFO ] [Real]Added 17 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:11:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:11:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:05] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-23 04:11:05] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:11:05] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2023-03-23 04:11:05] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2023-03-23 04:11:05] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2023-03-23 04:11:05] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2023-03-23 04:11:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 166 ms
[2023-03-23 04:11:05] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 6 ms.
[2023-03-23 04:11:05] [INFO ] Added : 6 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1445]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 8 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-23 04:11:07] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2023-03-23 04:11:07] [INFO ] Invariant cache hit.
[2023-03-23 04:11:07] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-23 04:11:07] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2023-03-23 04:11:07] [INFO ] Invariant cache hit.
[2023-03-23 04:11:07] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-23 04:11:07] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-23 04:11:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 04:11:07] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2023-03-23 04:11:07] [INFO ] Invariant cache hit.
[2023-03-23 04:11:07] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 75/75 places, 192/192 transitions.
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-01 in 9329 ms.
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-02
Normalized transition count is 159 out of 253 initially.
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:11:07] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 10004 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :3
[2023-03-23 04:11:07] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:11:07] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 04:11:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:07] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-23 04:11:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:11:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:07] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-23 04:11:07] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:11:07] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:11:07] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 10 ms.
[2023-03-23 04:11:07] [INFO ] Added : 26 causal constraints over 6 iterations in 80 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Graph (complete) has 428 edges and 101 vertex of which 98 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 98 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 95 transition count 242
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 95 transition count 242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 16 place count 95 transition count 238
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 92 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 92 transition count 230
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 92 transition count 226
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 91 transition count 224
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 91 transition count 224
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 90 transition count 222
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 90 transition count 222
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 89 transition count 220
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 89 transition count 220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 88 transition count 218
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 88 transition count 218
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 87 transition count 216
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 87 transition count 216
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 86 transition count 214
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 86 transition count 214
Applied a total of 38 rules in 26 ms. Remains 86 /101 variables (removed 15) and now considering 214/253 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 86/101 places, 214/253 transitions.
Normalized transition count is 133 out of 214 initially.
// Phase 1: matrix 133 rows 86 cols
[2023-03-23 04:11:07] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 916 ms. (steps per millisecond=1091 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=2564 ) properties (out of 1) seen :249
[2023-03-23 04:11:08] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
// Phase 1: matrix 133 rows 86 cols
[2023-03-23 04:11:08] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 04:11:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:08] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-23 04:11:08] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-23 04:11:08] [INFO ] [Real]Added 19 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:11:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:11:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:09] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-23 04:11:09] [INFO ] [Nat]Added 19 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:11:09] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2023-03-23 04:11:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-23 04:11:09] [INFO ] Computed and/alt/rep : 63/212/57 causal constraints (skipped 74 transitions) in 11 ms.
[2023-03-23 04:11:09] [INFO ] Added : 14 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[249]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 86/86 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-23 04:11:09] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
[2023-03-23 04:11:09] [INFO ] Invariant cache hit.
[2023-03-23 04:11:09] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-23 04:11:09] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
[2023-03-23 04:11:09] [INFO ] Invariant cache hit.
[2023-03-23 04:11:09] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-23 04:11:09] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-23 04:11:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 04:11:09] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
[2023-03-23 04:11:09] [INFO ] Invariant cache hit.
[2023-03-23 04:11:09] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 86/86 places, 214/214 transitions.
Normalized transition count is 133 out of 214 initially.
// Phase 1: matrix 133 rows 86 cols
[2023-03-23 04:11:09] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 956 ms. (steps per millisecond=1046 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 382 ms. (steps per millisecond=2617 ) properties (out of 1) seen :547
[2023-03-23 04:11:11] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
// Phase 1: matrix 133 rows 86 cols
[2023-03-23 04:11:11] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 04:11:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:11] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-23 04:11:11] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-23 04:11:11] [INFO ] [Real]Added 19 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:11:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:11:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:11] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:11:11] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:11:11] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2023-03-23 04:11:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-23 04:11:11] [INFO ] Computed and/alt/rep : 63/212/57 causal constraints (skipped 74 transitions) in 10 ms.
[2023-03-23 04:11:11] [INFO ] Added : 14 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[547]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 86/86 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-23 04:11:12] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
[2023-03-23 04:11:12] [INFO ] Invariant cache hit.
[2023-03-23 04:11:12] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-23 04:11:12] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
[2023-03-23 04:11:12] [INFO ] Invariant cache hit.
[2023-03-23 04:11:12] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-23 04:11:12] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-23 04:11:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 04:11:12] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
[2023-03-23 04:11:12] [INFO ] Invariant cache hit.
[2023-03-23 04:11:12] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 86/86 places, 214/214 transitions.
Normalized transition count is 133 out of 214 initially.
// Phase 1: matrix 133 rows 86 cols
[2023-03-23 04:11:12] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 934 ms. (steps per millisecond=1070 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 388 ms. (steps per millisecond=2577 ) properties (out of 1) seen :215
[2023-03-23 04:11:14] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
// Phase 1: matrix 133 rows 86 cols
[2023-03-23 04:11:14] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-23 04:11:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:14] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-23 04:11:14] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-23 04:11:14] [INFO ] [Real]Added 19 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:11:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:11:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:14] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-23 04:11:14] [INFO ] [Nat]Added 19 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:11:14] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2023-03-23 04:11:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-23 04:11:14] [INFO ] Computed and/alt/rep : 63/212/57 causal constraints (skipped 74 transitions) in 7 ms.
[2023-03-23 04:11:14] [INFO ] Added : 14 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[547]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 86/86 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-23 04:11:15] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
[2023-03-23 04:11:15] [INFO ] Invariant cache hit.
[2023-03-23 04:11:15] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-23 04:11:15] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
[2023-03-23 04:11:15] [INFO ] Invariant cache hit.
[2023-03-23 04:11:15] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-23 04:11:15] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-23 04:11:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 04:11:15] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
[2023-03-23 04:11:15] [INFO ] Invariant cache hit.
[2023-03-23 04:11:15] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 86/86 places, 214/214 transitions.
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-02 in 8558 ms.
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-03
Normalized transition count is 159 out of 253 initially.
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:11:15] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :4
[2023-03-23 04:11:15] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:11:15] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 04:11:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:15] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-23 04:11:15] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:11:15] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:11:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:11:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:16] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-23 04:11:16] [INFO ] [Nat]Added 25 Read/Feed constraints in 5 ms returned sat
[2023-03-23 04:11:16] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2023-03-23 04:11:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-23 04:11:16] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:11:16] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2023-03-23 04:11:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-23 04:11:16] [INFO ] Added : 12 causal constraints over 4 iterations in 113 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Graph (complete) has 428 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 96 transition count 245
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 96 transition count 245
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 13 place count 96 transition count 241
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 92 transition count 231
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 92 transition count 231
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 92 transition count 227
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 90 transition count 223
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 90 transition count 223
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 88 transition count 217
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 88 transition count 217
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 86 transition count 213
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 86 transition count 213
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 84 transition count 207
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 84 transition count 207
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 82 transition count 203
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 82 transition count 203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 80 transition count 199
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 80 transition count 199
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 79 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 79 transition count 197
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 78 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 78 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 77 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 77 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 76 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 76 transition count 191
Applied a total of 57 rules in 16 ms. Remains 76 /101 variables (removed 25) and now considering 191/253 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 76/101 places, 191/253 transitions.
Normalized transition count is 117 out of 191 initially.
// Phase 1: matrix 117 rows 76 cols
[2023-03-23 04:11:16] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 861 ms. (steps per millisecond=1161 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=2673 ) properties (out of 1) seen :1
[2023-03-23 04:11:17] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2023-03-23 04:11:17] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-23 04:11:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:17] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-23 04:11:17] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-23 04:11:17] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:11:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:11:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:11:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:17] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-23 04:11:17] [INFO ] [Nat]Added 18 Read/Feed constraints in 8 ms returned sat
[2023-03-23 04:11:17] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2023-03-23 04:11:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-23 04:11:17] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 6 ms.
[2023-03-23 04:11:17] [INFO ] Added : 6 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2023-03-23 04:11:17] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2023-03-23 04:11:17] [INFO ] Invariant cache hit.
[2023-03-23 04:11:17] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-23 04:11:17] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2023-03-23 04:11:17] [INFO ] Invariant cache hit.
[2023-03-23 04:11:17] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-23 04:11:17] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-23 04:11:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 04:11:17] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2023-03-23 04:11:17] [INFO ] Invariant cache hit.
[2023-03-23 04:11:17] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 76/76 places, 191/191 transitions.
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-03 in 2068 ms.
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-10
Normalized transition count is 159 out of 253 initially.
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:11:17] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :13
[2023-03-23 04:11:17] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:11:17] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 04:11:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:18] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-23 04:11:18] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:11:18] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2023-03-23 04:11:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:11:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:11:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:18] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-23 04:11:18] [INFO ] [Nat]Added 25 Read/Feed constraints in 9 ms returned sat
[2023-03-23 04:11:18] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2023-03-23 04:11:18] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2023-03-23 04:11:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2023-03-23 04:11:18] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 7 ms.
[2023-03-23 04:11:18] [INFO ] Added : 19 causal constraints over 5 iterations in 62 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[13]
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Graph (complete) has 428 edges and 101 vertex of which 97 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 97 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 94 transition count 242
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 94 transition count 242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 16 place count 94 transition count 238
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 91 transition count 232
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 91 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 91 transition count 228
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 90 transition count 226
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 90 transition count 226
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 89 transition count 222
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 89 transition count 222
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 88 transition count 220
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 88 transition count 220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 87 transition count 216
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 87 transition count 216
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 86 transition count 214
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 86 transition count 214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 85 transition count 212
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 85 transition count 212
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 84 transition count 210
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 84 transition count 210
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 83 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 83 transition count 208
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 82 transition count 206
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 82 transition count 206
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 81 transition count 204
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 81 transition count 204
Applied a total of 46 rules in 23 ms. Remains 81 /101 variables (removed 20) and now considering 204/253 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 81/101 places, 204/253 transitions.
Normalized transition count is 125 out of 204 initially.
// Phase 1: matrix 125 rows 81 cols
[2023-03-23 04:11:18] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 932 ms. (steps per millisecond=1072 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=2518 ) properties (out of 1) seen :1011
[2023-03-23 04:11:19] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
// Phase 1: matrix 125 rows 81 cols
[2023-03-23 04:11:19] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-23 04:11:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:19] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-23 04:11:19] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-23 04:11:19] [INFO ] [Real]Added 18 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:11:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:11:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:19] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-23 04:11:19] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:11:19] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2023-03-23 04:11:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-23 04:11:19] [INFO ] Computed and/alt/rep : 59/193/53 causal constraints (skipped 70 transitions) in 6 ms.
[2023-03-23 04:11:19] [INFO ] Added : 25 causal constraints over 7 iterations in 61 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1011]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-23 04:11:21] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2023-03-23 04:11:21] [INFO ] Invariant cache hit.
[2023-03-23 04:11:21] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-23 04:11:21] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2023-03-23 04:11:21] [INFO ] Invariant cache hit.
[2023-03-23 04:11:21] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-23 04:11:21] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-23 04:11:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 04:11:21] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2023-03-23 04:11:21] [INFO ] Invariant cache hit.
[2023-03-23 04:11:21] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 81/81 places, 204/204 transitions.
Normalized transition count is 125 out of 204 initially.
// Phase 1: matrix 125 rows 81 cols
[2023-03-23 04:11:21] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 935 ms. (steps per millisecond=1069 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=2475 ) properties (out of 1) seen :1022
[2023-03-23 04:11:23] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
// Phase 1: matrix 125 rows 81 cols
[2023-03-23 04:11:23] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-23 04:11:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:23] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-23 04:11:23] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-23 04:11:23] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:11:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:11:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:23] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-23 04:11:23] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:11:23] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2023-03-23 04:11:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-23 04:11:23] [INFO ] Computed and/alt/rep : 59/193/53 causal constraints (skipped 70 transitions) in 6 ms.
[2023-03-23 04:11:23] [INFO ] Added : 25 causal constraints over 7 iterations in 62 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1022]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-23 04:11:24] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2023-03-23 04:11:24] [INFO ] Invariant cache hit.
[2023-03-23 04:11:24] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-23 04:11:24] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2023-03-23 04:11:24] [INFO ] Invariant cache hit.
[2023-03-23 04:11:24] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-23 04:11:24] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-23 04:11:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 04:11:25] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2023-03-23 04:11:25] [INFO ] Invariant cache hit.
[2023-03-23 04:11:25] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 81/81 places, 204/204 transitions.
Normalized transition count is 125 out of 204 initially.
// Phase 1: matrix 125 rows 81 cols
[2023-03-23 04:11:25] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 924 ms. (steps per millisecond=1082 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=2610 ) properties (out of 1) seen :0
[2023-03-23 04:11:26] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
// Phase 1: matrix 125 rows 81 cols
[2023-03-23 04:11:26] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-23 04:11:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 04:11:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:26] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-23 04:11:26] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-23 04:11:26] [INFO ] [Real]Added 18 Read/Feed constraints in 8 ms returned sat
[2023-03-23 04:11:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:11:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:26] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-23 04:11:26] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:11:26] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2023-03-23 04:11:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-23 04:11:26] [INFO ] Computed and/alt/rep : 59/193/53 causal constraints (skipped 70 transitions) in 7 ms.
[2023-03-23 04:11:26] [INFO ] Added : 25 causal constraints over 7 iterations in 72 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1022]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 9 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 81/81 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-23 04:11:28] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2023-03-23 04:11:28] [INFO ] Invariant cache hit.
[2023-03-23 04:11:28] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-23 04:11:28] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2023-03-23 04:11:28] [INFO ] Invariant cache hit.
[2023-03-23 04:11:28] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-23 04:11:28] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-23 04:11:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 04:11:28] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2023-03-23 04:11:28] [INFO ] Invariant cache hit.
[2023-03-23 04:11:28] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 81/81 places, 204/204 transitions.
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-10 in 10538 ms.
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-12
Normalized transition count is 159 out of 253 initially.
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:11:28] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :9
[2023-03-23 04:11:28] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:11:28] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 04:11:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:28] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-23 04:11:28] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:11:28] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:11:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:11:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:28] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:11:28] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-23 04:11:28] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2023-03-23 04:11:28] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2023-03-23 04:11:28] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2023-03-23 04:11:28] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2023-03-23 04:11:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 200 ms
[2023-03-23 04:11:28] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:11:28] [INFO ] Added : 13 causal constraints over 3 iterations in 53 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[9]
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Graph (complete) has 428 edges and 101 vertex of which 97 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 97 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 94 transition count 242
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 94 transition count 242
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 94 transition count 240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 92 transition count 234
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 92 transition count 234
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 90 transition count 230
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 90 transition count 230
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 88 transition count 224
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 88 transition count 224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 86 transition count 220
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 86 transition count 220
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 84 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 84 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 82 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 82 transition count 210
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 80 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 80 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 79 transition count 204
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 79 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 78 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 78 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 77 transition count 200
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 77 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 76 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 76 transition count 198
Applied a total of 50 rules in 12 ms. Remains 76 /101 variables (removed 25) and now considering 198/253 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 76/101 places, 198/253 transitions.
Normalized transition count is 118 out of 198 initially.
// Phase 1: matrix 118 rows 76 cols
[2023-03-23 04:11:28] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 960 ms. (steps per millisecond=1041 ) properties (out of 1) seen :15
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 379 ms. (steps per millisecond=2638 ) properties (out of 1) seen :735
[2023-03-23 04:11:30] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
// Phase 1: matrix 118 rows 76 cols
[2023-03-23 04:11:30] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-23 04:11:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:30] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-23 04:11:30] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-23 04:11:30] [INFO ] [Real]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:11:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:11:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:30] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-23 04:11:30] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:11:30] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2023-03-23 04:11:30] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2023-03-23 04:11:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2023-03-23 04:11:30] [INFO ] Computed and/alt/rep : 60/163/51 causal constraints (skipped 65 transitions) in 6 ms.
[2023-03-23 04:11:30] [INFO ] Added : 19 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[735]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 198/198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2023-03-23 04:11:31] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
[2023-03-23 04:11:31] [INFO ] Invariant cache hit.
[2023-03-23 04:11:31] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-23 04:11:31] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
[2023-03-23 04:11:31] [INFO ] Invariant cache hit.
[2023-03-23 04:11:31] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-23 04:11:31] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-23 04:11:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 04:11:31] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
[2023-03-23 04:11:31] [INFO ] Invariant cache hit.
[2023-03-23 04:11:31] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 76/76 places, 198/198 transitions.
Normalized transition count is 118 out of 198 initially.
// Phase 1: matrix 118 rows 76 cols
[2023-03-23 04:11:31] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 909 ms. (steps per millisecond=1100 ) properties (out of 1) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=2724 ) properties (out of 1) seen :751
[2023-03-23 04:11:33] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
// Phase 1: matrix 118 rows 76 cols
[2023-03-23 04:11:33] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 04:11:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:33] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-23 04:11:33] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-23 04:11:33] [INFO ] [Real]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:11:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:11:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:33] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-23 04:11:33] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:11:33] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2023-03-23 04:11:33] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2023-03-23 04:11:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2023-03-23 04:11:33] [INFO ] Computed and/alt/rep : 60/163/51 causal constraints (skipped 65 transitions) in 7 ms.
[2023-03-23 04:11:33] [INFO ] Added : 19 causal constraints over 4 iterations in 39 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[751]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 76/76 places, 198/198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2023-03-23 04:11:34] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
[2023-03-23 04:11:34] [INFO ] Invariant cache hit.
[2023-03-23 04:11:34] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-23 04:11:34] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
[2023-03-23 04:11:34] [INFO ] Invariant cache hit.
[2023-03-23 04:11:34] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-23 04:11:35] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2023-03-23 04:11:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 04:11:35] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
[2023-03-23 04:11:35] [INFO ] Invariant cache hit.
[2023-03-23 04:11:35] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 76/76 places, 198/198 transitions.
Normalized transition count is 118 out of 198 initially.
// Phase 1: matrix 118 rows 76 cols
[2023-03-23 04:11:35] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 934 ms. (steps per millisecond=1070 ) properties (out of 1) seen :15
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 372 ms. (steps per millisecond=2688 ) properties (out of 1) seen :738
[2023-03-23 04:11:36] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
// Phase 1: matrix 118 rows 76 cols
[2023-03-23 04:11:36] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-23 04:11:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:36] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-23 04:11:36] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-23 04:11:36] [INFO ] [Real]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:11:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:11:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:36] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-23 04:11:36] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:11:36] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2023-03-23 04:11:36] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2023-03-23 04:11:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2023-03-23 04:11:36] [INFO ] Computed and/alt/rep : 60/163/51 causal constraints (skipped 65 transitions) in 6 ms.
[2023-03-23 04:11:36] [INFO ] Added : 19 causal constraints over 4 iterations in 38 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[751]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 76/76 places, 198/198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 198/198 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2023-03-23 04:11:38] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
[2023-03-23 04:11:38] [INFO ] Invariant cache hit.
[2023-03-23 04:11:38] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-23 04:11:38] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
[2023-03-23 04:11:38] [INFO ] Invariant cache hit.
[2023-03-23 04:11:38] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-23 04:11:38] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2023-03-23 04:11:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 04:11:38] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
[2023-03-23 04:11:38] [INFO ] Invariant cache hit.
[2023-03-23 04:11:38] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 76/76 places, 198/198 transitions.
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-12 in 9937 ms.
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-13
Normalized transition count is 159 out of 253 initially.
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:11:38] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :29
[2023-03-23 04:11:38] [INFO ] Flow matrix only has 159 transitions (discarded 94 similar events)
// Phase 1: matrix 159 rows 101 cols
[2023-03-23 04:11:38] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-23 04:11:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:38] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-23 04:11:38] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 04:11:38] [INFO ] [Real]Added 25 Read/Feed constraints in 9 ms returned sat
[2023-03-23 04:11:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:11:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:38] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-23 04:11:38] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:11:38] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2023-03-23 04:11:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-23 04:11:38] [INFO ] Computed and/alt/rep : 67/301/62 causal constraints (skipped 95 transitions) in 8 ms.
[2023-03-23 04:11:38] [INFO ] Added : 8 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[29]
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 253/253 transitions.
Graph (complete) has 428 edges and 101 vertex of which 97 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 97 transition count 248
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 93 transition count 240
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 93 transition count 240
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 18 place count 93 transition count 236
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 22 place count 89 transition count 226
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 89 transition count 226
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 89 transition count 222
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 87 transition count 218
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 87 transition count 218
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 36 place count 85 transition count 212
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 85 transition count 212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 40 place count 83 transition count 208
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 83 transition count 208
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 81 transition count 202
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 81 transition count 202
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 48 place count 79 transition count 198
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 79 transition count 198
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 78 transition count 196
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 78 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 77 transition count 194
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 77 transition count 194
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 76 transition count 192
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 76 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 75 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 75 transition count 190
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 74 transition count 188
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 74 transition count 188
Applied a total of 60 rules in 12 ms. Remains 74 /101 variables (removed 27) and now considering 188/253 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 74/101 places, 188/253 transitions.
Normalized transition count is 115 out of 188 initially.
// Phase 1: matrix 115 rows 74 cols
[2023-03-23 04:11:38] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 935 ms. (steps per millisecond=1069 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=2717 ) properties (out of 1) seen :5684
[2023-03-23 04:11:40] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
// Phase 1: matrix 115 rows 74 cols
[2023-03-23 04:11:40] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 04:11:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:40] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-23 04:11:40] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-23 04:11:40] [INFO ] [Real]Added 17 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:11:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:11:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:40] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-23 04:11:40] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:11:40] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2023-03-23 04:11:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-23 04:11:40] [INFO ] Computed and/alt/rep : 60/195/52 causal constraints (skipped 61 transitions) in 6 ms.
[2023-03-23 04:11:40] [INFO ] Added : 8 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5684]
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 74/74 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2023-03-23 04:11:43] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2023-03-23 04:11:43] [INFO ] Invariant cache hit.
[2023-03-23 04:11:43] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-23 04:11:43] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2023-03-23 04:11:43] [INFO ] Invariant cache hit.
[2023-03-23 04:11:43] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-23 04:11:43] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-23 04:11:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 04:11:43] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2023-03-23 04:11:43] [INFO ] Invariant cache hit.
[2023-03-23 04:11:43] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 74/74 places, 188/188 transitions.
Normalized transition count is 115 out of 188 initially.
// Phase 1: matrix 115 rows 74 cols
[2023-03-23 04:11:43] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 880 ms. (steps per millisecond=1136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=2717 ) properties (out of 1) seen :0
[2023-03-23 04:11:44] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
// Phase 1: matrix 115 rows 74 cols
[2023-03-23 04:11:44] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 04:11:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:44] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-23 04:11:44] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-23 04:11:44] [INFO ] [Real]Added 17 Read/Feed constraints in 3 ms returned sat
[2023-03-23 04:11:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:11:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 04:11:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:11:44] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-23 04:11:44] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2023-03-23 04:11:44] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2023-03-23 04:11:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-23 04:11:44] [INFO ] Computed and/alt/rep : 60/195/52 causal constraints (skipped 61 transitions) in 7 ms.
[2023-03-23 04:11:44] [INFO ] Added : 8 causal constraints over 4 iterations in 37 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5684]
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 74/74 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2023-03-23 04:11:47] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2023-03-23 04:11:47] [INFO ] Invariant cache hit.
[2023-03-23 04:11:47] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-23 04:11:47] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2023-03-23 04:11:47] [INFO ] Invariant cache hit.
[2023-03-23 04:11:47] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-23 04:11:47] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-23 04:11:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 04:11:47] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2023-03-23 04:11:47] [INFO ] Invariant cache hit.
[2023-03-23 04:11:47] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 74/74 places, 188/188 transitions.
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-13 in 9184 ms.
[2023-03-23 04:11:47] [INFO ] Flatten gal took : 50 ms
[2023-03-23 04:11:47] [INFO ] Applying decomposition
[2023-03-23 04:11:47] [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.202303021504/bin/convert-linux64' '-i' '/tmp/graph4213940176923256619.txt' '-o' '/tmp/graph4213940176923256619.bin' '-w' '/tmp/graph4213940176923256619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4213940176923256619.bin' '-l' '-1' '-v' '-w' '/tmp/graph4213940176923256619.weights' '-q' '0' '-e' '0.001'
[2023-03-23 04:11:47] [INFO ] Decomposing Gal with order
[2023-03-23 04:11:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 04:11:48] [INFO ] Removed a total of 433 redundant transitions.
[2023-03-23 04:11:48] [INFO ] Flatten gal took : 74 ms
[2023-03-23 04:11:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 139 labels/synchronizations in 15 ms.
[2023-03-23 04:11:48] [INFO ] Time to serialize gal into /tmp/UpperBounds4844005303841294919.gal : 8 ms
[2023-03-23 04:11:48] [INFO ] Time to serialize properties into /tmp/UpperBounds522885875750675872.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4844005303841294919.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds522885875750675872.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...282
Loading property file /tmp/UpperBounds522885875750675872.prop.
Detected timeout of ITS tools.
[2023-03-23 04:33:25] [INFO ] Flatten gal took : 13 ms
[2023-03-23 04:33:25] [INFO ] Time to serialize gal into /tmp/UpperBounds5314310164462509800.gal : 2 ms
[2023-03-23 04:33:25] [INFO ] Time to serialize properties into /tmp/UpperBounds9310224429611181093.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5314310164462509800.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9310224429611181093.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.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds9310224429611181093.prop.
Detected timeout of ITS tools.
[2023-03-23 04:55:03] [INFO ] Flatten gal took : 13 ms
[2023-03-23 04:55:03] [INFO ] Input system was already deterministic with 253 transitions.
[2023-03-23 04:55:03] [INFO ] Transformed 101 places.
[2023-03-23 04:55:03] [INFO ] Transformed 253 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-23 04:55:03] [INFO ] Time to serialize gal into /tmp/UpperBounds17614803139842153773.gal : 6 ms
[2023-03-23 04:55:03] [INFO ] Time to serialize properties into /tmp/UpperBounds2224090700714945067.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17614803139842153773.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2224090700714945067.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds2224090700714945067.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7556948 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098712 kB

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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="FunctionPointer-PT-b004"
export BK_EXAMINATION="UpperBounds"
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-5348"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-b004, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r165-tall-167838850700669"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b004.tgz
mv FunctionPointer-PT-b004 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;