MCC'2024- Execution of r004-smll-171620117800085

About the Execution of ITS-Tools for ASLink-PT-05b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
807.867	342814.00	411688.00	1304.00	1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r004-smll-171620117800085.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ASLink-PT-05b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620117800085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 795K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716283090802

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 09:18:13] [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]
[2024-05-21 09:18:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:18:14] [INFO ] Load time of PNML (sax parser for PT used): 558 ms
[2024-05-21 09:18:14] [INFO ] Transformed 2430 places.
[2024-05-21 09:18:14] [INFO ] Transformed 3040 transitions.
[2024-05-21 09:18:14] [INFO ] Found NUPN structural information;
[2024-05-21 09:18:14] [INFO ] Parsed PT model containing 2430 places and 3040 transitions and 9292 arcs in 873 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 3040 rows 2430 cols
[2024-05-21 09:18:14] [INFO ] Computed 238 invariants in 224 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (15 resets) in 104 ms. (95 steps per ms)
FORMULA ASLink-PT-05b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (18 resets) in 151 ms. (460 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-05-21 09:18:14] [INFO ] Invariant cache hit.
[2024-05-21 09:18:16] [INFO ] [Real]Absence check using 56 positive place invariants in 105 ms returned sat
[2024-05-21 09:18:16] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 147 ms returned sat
[2024-05-21 09:18:19] [INFO ] [Real]Absence check using state equation in 2700 ms returned sat
[2024-05-21 09:18:22] [INFO ] Deduced a trap composed of 126 places in 2731 ms of which 284 ms to minimize.
[2024-05-21 09:18:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 09:18:23] [INFO ] [Real]Absence check using 56 positive place invariants in 86 ms returned sat
[2024-05-21 09:18:23] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 116 ms returned sat
[2024-05-21 09:18:26] [INFO ] [Real]Absence check using state equation in 3150 ms returned sat
[2024-05-21 09:18:28] [INFO ] Deduced a trap composed of 112 places in 2007 ms of which 30 ms to minimize.
[2024-05-21 09:18:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 09:18:29] [INFO ] [Real]Absence check using 56 positive place invariants in 79 ms returned sat
[2024-05-21 09:18:29] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 95 ms returned sat
[2024-05-21 09:18:31] [INFO ] [Real]Absence check using state equation in 2200 ms returned sat
[2024-05-21 09:18:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:18:32] [INFO ] [Nat]Absence check using 56 positive place invariants in 82 ms returned sat
[2024-05-21 09:18:32] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 111 ms returned sat
[2024-05-21 09:18:35] [INFO ] [Nat]Absence check using state equation in 2625 ms returned sat
[2024-05-21 09:18:37] [INFO ] Deduced a trap composed of 85 places in 2332 ms of which 35 ms to minimize.
[2024-05-21 09:18:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 09:18:38] [INFO ] [Real]Absence check using 56 positive place invariants in 129 ms returned sat
[2024-05-21 09:18:39] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 154 ms returned sat
[2024-05-21 09:18:41] [INFO ] [Real]Absence check using state equation in 2326 ms returned sat
[2024-05-21 09:18:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:18:42] [INFO ] [Nat]Absence check using 56 positive place invariants in 87 ms returned sat
[2024-05-21 09:18:42] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 103 ms returned sat
[2024-05-21 09:18:44] [INFO ] [Nat]Absence check using state equation in 1935 ms returned sat
[2024-05-21 09:18:46] [INFO ] Deduced a trap composed of 51 places in 2149 ms of which 17 ms to minimize.
[2024-05-21 09:18:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 09:18:47] [INFO ] [Real]Absence check using 56 positive place invariants in 73 ms returned sat
[2024-05-21 09:18:47] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 103 ms returned sat
[2024-05-21 09:18:49] [INFO ] [Real]Absence check using state equation in 2056 ms returned sat
[2024-05-21 09:18:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:18:50] [INFO ] [Nat]Absence check using 56 positive place invariants in 88 ms returned sat
[2024-05-21 09:18:50] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 110 ms returned sat
[2024-05-21 09:18:52] [INFO ] [Nat]Absence check using state equation in 2368 ms returned sat
[2024-05-21 09:18:55] [INFO ] Deduced a trap composed of 45 places in 2018 ms of which 23 ms to minimize.
[2024-05-21 09:18:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 09:18:55] [INFO ] [Real]Absence check using 56 positive place invariants in 75 ms returned sat
[2024-05-21 09:18:56] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 86 ms returned sat
[2024-05-21 09:18:57] [INFO ] [Real]Absence check using state equation in 1621 ms returned sat
[2024-05-21 09:19:00] [INFO ] Deduced a trap composed of 59 places in 2749 ms of which 25 ms to minimize.
[2024-05-21 09:19:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 09:19:01] [INFO ] [Real]Absence check using 56 positive place invariants in 74 ms returned sat
[2024-05-21 09:19:01] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 105 ms returned sat
[2024-05-21 09:19:03] [INFO ] [Real]Absence check using state equation in 2171 ms returned sat
[2024-05-21 09:19:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:19:04] [INFO ] [Nat]Absence check using 56 positive place invariants in 78 ms returned sat
[2024-05-21 09:19:04] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 110 ms returned sat
[2024-05-21 09:19:06] [INFO ] [Nat]Absence check using state equation in 1823 ms returned sat
[2024-05-21 09:19:08] [INFO ] Deduced a trap composed of 74 places in 1717 ms of which 20 ms to minimize.
[2024-05-21 09:19:09] [INFO ] Deduced a trap composed of 58 places in 1562 ms of which 19 ms to minimize.
[2024-05-21 09:19:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 2430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2430/2430 places, 3040/3040 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 557 place count 2430 transition count 2483
Reduce places removed 557 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 583 rules applied. Total rules applied 1140 place count 1873 transition count 2457
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 1149 place count 1866 transition count 2455
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1151 place count 1864 transition count 2455
Performed 559 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 559 Pre rules applied. Total rules applied 1151 place count 1864 transition count 1896
Deduced a syphon composed of 559 places in 7 ms
Ensure Unique test removed 53 places
Reduce places removed 612 places and 0 transitions.
Iterating global reduction 4 with 1171 rules applied. Total rules applied 2322 place count 1252 transition count 1896
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 4 with 41 rules applied. Total rules applied 2363 place count 1246 transition count 1861
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 5 with 35 rules applied. Total rules applied 2398 place count 1211 transition count 1861
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2398 place count 1211 transition count 1841
Deduced a syphon composed of 20 places in 19 ms
Ensure Unique test removed 19 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 59 rules applied. Total rules applied 2457 place count 1172 transition count 1841
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2457 place count 1172 transition count 1822
Deduced a syphon composed of 19 places in 19 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2495 place count 1153 transition count 1822
Discarding 77 places :
Symmetric choice reduction at 6 with 77 rule applications. Total rules 2572 place count 1076 transition count 1745
Iterating global reduction 6 with 77 rules applied. Total rules applied 2649 place count 1076 transition count 1745
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2650 place count 1076 transition count 1744
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 26 Pre rules applied. Total rules applied 2650 place count 1076 transition count 1718
Deduced a syphon composed of 26 places in 21 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 53 rules applied. Total rules applied 2703 place count 1049 transition count 1718
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2703 place count 1049 transition count 1717
Deduced a syphon composed of 1 places in 15 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 2706 place count 1047 transition count 1717
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2711 place count 1042 transition count 1684
Iterating global reduction 7 with 5 rules applied. Total rules applied 2716 place count 1042 transition count 1684
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 2716 place count 1042 transition count 1680
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 2724 place count 1038 transition count 1680
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2725 place count 1037 transition count 1672
Iterating global reduction 7 with 1 rules applied. Total rules applied 2726 place count 1037 transition count 1672
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2727 place count 1036 transition count 1664
Iterating global reduction 7 with 1 rules applied. Total rules applied 2728 place count 1036 transition count 1664
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2729 place count 1035 transition count 1656
Iterating global reduction 7 with 1 rules applied. Total rules applied 2730 place count 1035 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2731 place count 1034 transition count 1648
Iterating global reduction 7 with 1 rules applied. Total rules applied 2732 place count 1034 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2733 place count 1033 transition count 1640
Iterating global reduction 7 with 1 rules applied. Total rules applied 2734 place count 1033 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2735 place count 1032 transition count 1632
Iterating global reduction 7 with 1 rules applied. Total rules applied 2736 place count 1032 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2737 place count 1031 transition count 1624
Iterating global reduction 7 with 1 rules applied. Total rules applied 2738 place count 1031 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2739 place count 1030 transition count 1616
Iterating global reduction 7 with 1 rules applied. Total rules applied 2740 place count 1030 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2741 place count 1029 transition count 1608
Iterating global reduction 7 with 1 rules applied. Total rules applied 2742 place count 1029 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2743 place count 1028 transition count 1600
Iterating global reduction 7 with 1 rules applied. Total rules applied 2744 place count 1028 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2745 place count 1027 transition count 1592
Iterating global reduction 7 with 1 rules applied. Total rules applied 2746 place count 1027 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2747 place count 1026 transition count 1584
Iterating global reduction 7 with 1 rules applied. Total rules applied 2748 place count 1026 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2749 place count 1025 transition count 1576
Iterating global reduction 7 with 1 rules applied. Total rules applied 2750 place count 1025 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2751 place count 1024 transition count 1568
Iterating global reduction 7 with 1 rules applied. Total rules applied 2752 place count 1024 transition count 1568
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2753 place count 1023 transition count 1560
Iterating global reduction 7 with 1 rules applied. Total rules applied 2754 place count 1023 transition count 1560
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2755 place count 1022 transition count 1552
Iterating global reduction 7 with 1 rules applied. Total rules applied 2756 place count 1022 transition count 1552
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 8 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 7 with 276 rules applied. Total rules applied 3032 place count 884 transition count 1414
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3033 place count 883 transition count 1413
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 3035 place count 882 transition count 1413
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3036 place count 881 transition count 1412
Iterating global reduction 7 with 1 rules applied. Total rules applied 3037 place count 881 transition count 1412
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 3039 place count 881 transition count 1410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3040 place count 880 transition count 1410
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3042 place count 879 transition count 1419
Free-agglomeration rule applied 6 times.
Iterating global reduction 9 with 6 rules applied. Total rules applied 3048 place count 879 transition count 1413
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 3054 place count 873 transition count 1413
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 3058 place count 873 transition count 1409
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 3062 place count 869 transition count 1409
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 3063 place count 868 transition count 1408
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 11 with 15 rules applied. Total rules applied 3078 place count 858 transition count 1403
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 3083 place count 853 transition count 1403
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 15 Pre rules applied. Total rules applied 3083 place count 853 transition count 1388
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 13 with 31 rules applied. Total rules applied 3114 place count 837 transition count 1388
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 13 with 6 rules applied. Total rules applied 3120 place count 831 transition count 1388
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 3120 place count 831 transition count 1387
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 3122 place count 830 transition count 1387
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 14 with 22 rules applied. Total rules applied 3144 place count 819 transition count 1376
Discarding 5 places :
Symmetric choice reduction at 14 with 5 rule applications. Total rules 3149 place count 814 transition count 1371
Iterating global reduction 14 with 5 rules applied. Total rules applied 3154 place count 814 transition count 1371
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 3155 place count 813 transition count 1370
Iterating global reduction 14 with 1 rules applied. Total rules applied 3156 place count 813 transition count 1370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 3157 place count 813 transition count 1369
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 3161 place count 813 transition count 1365
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 3165 place count 809 transition count 1365
Applied a total of 3165 rules in 2562 ms. Remains 809 /2430 variables (removed 1621) and now considering 1365/3040 (removed 1675) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2581 ms. Remains : 809/2430 places, 1365/3040 transitions.
// Phase 1: matrix 1365 rows 809 cols
[2024-05-21 09:19:12] [INFO ] Computed 140 invariants in 36 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (12220 resets) in 3375 ms. (296 steps per ms)
FORMULA ASLink-PT-05b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000004 steps (9407 resets) in 5439 ms. (735 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-21 09:19:21] [INFO ] Invariant cache hit.
[2024-05-21 09:19:21] [INFO ] [Real]Absence check using 36 positive place invariants in 30 ms returned sat
[2024-05-21 09:19:21] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 58 ms returned sat
[2024-05-21 09:19:22] [INFO ] [Real]Absence check using state equation in 871 ms returned sat
[2024-05-21 09:19:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:19:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 32 ms returned sat
[2024-05-21 09:19:22] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 49 ms returned sat
[2024-05-21 09:19:23] [INFO ] [Nat]Absence check using state equation in 888 ms returned sat
[2024-05-21 09:19:24] [INFO ] Deduced a trap composed of 103 places in 523 ms of which 7 ms to minimize.
[2024-05-21 09:19:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 674 ms
[2024-05-21 09:19:24] [INFO ] Computed and/alt/rep : 544/2067/544 causal constraints (skipped 791 transitions) in 211 ms.
[2024-05-21 09:19:35] [INFO ] Added : 382 causal constraints over 77 iterations in 11286 ms. Result :sat
Minimization took 1161 ms.
[2024-05-21 09:19:37] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2024-05-21 09:19:37] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 30 ms returned sat
[2024-05-21 09:19:38] [INFO ] [Real]Absence check using state equation in 848 ms returned sat
[2024-05-21 09:19:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:19:38] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2024-05-21 09:19:38] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 37 ms returned sat
[2024-05-21 09:19:38] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2024-05-21 09:19:38] [INFO ] Computed and/alt/rep : 544/2067/544 causal constraints (skipped 791 transitions) in 113 ms.
[2024-05-21 09:19:48] [INFO ] Added : 400 causal constraints over 80 iterations in 10032 ms. Result :sat
Minimization took 1318 ms.
[2024-05-21 09:19:50] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2024-05-21 09:19:50] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 39 ms returned sat
[2024-05-21 09:19:51] [INFO ] [Real]Absence check using state equation in 853 ms returned sat
[2024-05-21 09:19:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:19:51] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2024-05-21 09:19:51] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 37 ms returned sat
[2024-05-21 09:19:52] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2024-05-21 09:19:52] [INFO ] Deduced a trap composed of 100 places in 322 ms of which 4 ms to minimize.
[2024-05-21 09:19:53] [INFO ] Deduced a trap composed of 84 places in 411 ms of which 7 ms to minimize.
[2024-05-21 09:19:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 903 ms
[2024-05-21 09:19:53] [INFO ] Computed and/alt/rep : 544/2067/544 causal constraints (skipped 791 transitions) in 128 ms.
[2024-05-21 09:20:04] [INFO ] Added : 404 causal constraints over 81 iterations in 11634 ms. Result :sat
Minimization took 1201 ms.
[2024-05-21 09:20:06] [INFO ] [Real]Absence check using 36 positive place invariants in 33 ms returned sat
[2024-05-21 09:20:06] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 62 ms returned sat
[2024-05-21 09:20:07] [INFO ] [Real]Absence check using state equation in 1016 ms returned sat
[2024-05-21 09:20:07] [INFO ] Computed and/alt/rep : 544/2067/544 causal constraints (skipped 791 transitions) in 169 ms.
[2024-05-21 09:20:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:20:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 33 ms returned sat
[2024-05-21 09:20:08] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 62 ms returned sat
[2024-05-21 09:20:09] [INFO ] [Nat]Absence check using state equation in 936 ms returned sat
[2024-05-21 09:20:09] [INFO ] Computed and/alt/rep : 544/2067/544 causal constraints (skipped 791 transitions) in 107 ms.
[2024-05-21 09:20:23] [INFO ] Added : 407 causal constraints over 82 iterations in 13801 ms. Result :sat
Minimization took 1197 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 809 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 809/809 places, 1365/1365 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 809 transition count 1364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 808 transition count 1364
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 808 transition count 1362
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 806 transition count 1362
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 804 transition count 1360
Applied a total of 10 rules in 69 ms. Remains 804 /809 variables (removed 5) and now considering 1360/1365 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 804/809 places, 1360/1365 transitions.
// Phase 1: matrix 1360 rows 804 cols
[2024-05-21 09:20:29] [INFO ] Computed 140 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (12146 resets) in 2945 ms. (339 steps per ms)
BEST_FIRST walk for 4000004 steps (9388 resets) in 5754 ms. (695 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-21 09:20:38] [INFO ] Invariant cache hit.
[2024-05-21 09:20:38] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2024-05-21 09:20:38] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 36 ms returned sat
[2024-05-21 09:20:39] [INFO ] [Real]Absence check using state equation in 904 ms returned sat
[2024-05-21 09:20:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:20:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2024-05-21 09:20:39] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 38 ms returned sat
[2024-05-21 09:20:40] [INFO ] [Nat]Absence check using state equation in 822 ms returned sat
[2024-05-21 09:20:40] [INFO ] Computed and/alt/rep : 539/2062/539 causal constraints (skipped 791 transitions) in 139 ms.
[2024-05-21 09:20:52] [INFO ] Added : 388 causal constraints over 78 iterations in 11275 ms. Result :sat
Minimization took 1698 ms.
[2024-05-21 09:20:53] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2024-05-21 09:20:54] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 30 ms returned sat
[2024-05-21 09:20:54] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2024-05-21 09:20:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:20:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 28 ms returned sat
[2024-05-21 09:20:55] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 46 ms returned sat
[2024-05-21 09:20:55] [INFO ] [Nat]Absence check using state equation in 797 ms returned sat
[2024-05-21 09:20:56] [INFO ] Computed and/alt/rep : 539/2062/539 causal constraints (skipped 791 transitions) in 93 ms.
[2024-05-21 09:21:08] [INFO ] Added : 417 causal constraints over 84 iterations in 12346 ms. Result :sat
Minimization took 1563 ms.
[2024-05-21 09:21:10] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2024-05-21 09:21:10] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 38 ms returned sat
[2024-05-21 09:21:10] [INFO ] [Real]Absence check using state equation in 769 ms returned sat
[2024-05-21 09:21:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:21:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2024-05-21 09:21:11] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 38 ms returned sat
[2024-05-21 09:21:11] [INFO ] [Nat]Absence check using state equation in 827 ms returned sat
[2024-05-21 09:21:12] [INFO ] Computed and/alt/rep : 539/2062/539 causal constraints (skipped 791 transitions) in 97 ms.
[2024-05-21 09:21:21] [INFO ] Added : 316 causal constraints over 64 iterations in 9228 ms. Result :sat
Minimization took 1297 ms.
[2024-05-21 09:21:22] [INFO ] [Real]Absence check using 36 positive place invariants in 28 ms returned sat
[2024-05-21 09:21:22] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 57 ms returned sat
[2024-05-21 09:21:23] [INFO ] [Real]Absence check using state equation in 901 ms returned sat
[2024-05-21 09:21:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:21:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2024-05-21 09:21:23] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 38 ms returned sat
[2024-05-21 09:21:24] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
[2024-05-21 09:21:24] [INFO ] Computed and/alt/rep : 539/2062/539 causal constraints (skipped 791 transitions) in 96 ms.
[2024-05-21 09:21:29] [INFO ] Added : 152 causal constraints over 31 iterations in 4407 ms. Result :sat
Minimization took 1179 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1360/1360 transitions.
Applied a total of 0 rules in 29 ms. Remains 804 /804 variables (removed 0) and now considering 1360/1360 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 804/804 places, 1360/1360 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1360/1360 transitions.
Applied a total of 0 rules in 29 ms. Remains 804 /804 variables (removed 0) and now considering 1360/1360 (removed 0) transitions.
[2024-05-21 09:21:34] [INFO ] Invariant cache hit.
[2024-05-21 09:21:36] [INFO ] Implicit Places using invariants in 1537 ms returned [1, 18, 19, 50, 68, 87, 136, 141, 150, 151, 153, 170, 188, 258, 262, 263, 274, 275, 277, 294, 312, 381, 385, 386, 397, 398, 400, 417, 435, 507, 511, 512, 523, 524, 526, 543, 561, 630, 634, 635, 638, 649, 650, 651, 669, 671, 675, 693, 694, 695, 696, 708, 714, 720, 726, 732, 738, 744, 750, 756, 762, 768]
[2024-05-21 09:21:36] [INFO ] Actually due to overlaps returned [669, 651, 50, 170, 294, 417, 543, 675, 153, 277, 400, 526, 150, 274, 397, 523, 649, 693, 151, 275, 398, 524, 650, 671, 694, 1, 18, 262, 263, 385, 386, 511, 512, 634, 635, 188, 312, 435, 561, 695, 738, 756, 768, 19, 68, 87, 136, 638, 696, 708, 714, 720, 726, 732, 744, 750, 762]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 1543 ms to find 57 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 747/804 places, 1360/1360 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 743 transition count 1259
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 107 rules applied. Total rules applied 212 place count 642 transition count 1253
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 214 place count 640 transition count 1253
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 214 place count 640 transition count 1224
Deduced a syphon composed of 29 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 59 rules applied. Total rules applied 273 place count 610 transition count 1224
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 285 place count 606 transition count 1216
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 293 place count 598 transition count 1216
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 308 place count 583 transition count 1201
Iterating global reduction 5 with 15 rules applied. Total rules applied 323 place count 583 transition count 1201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 326 place count 583 transition count 1198
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 326 place count 583 transition count 1197
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 328 place count 582 transition count 1197
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 331 place count 579 transition count 1191
Iterating global reduction 6 with 3 rules applied. Total rules applied 334 place count 579 transition count 1191
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 335 place count 578 transition count 1190
Iterating global reduction 6 with 1 rules applied. Total rules applied 336 place count 578 transition count 1190
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 337 place count 577 transition count 1188
Iterating global reduction 6 with 1 rules applied. Total rules applied 338 place count 577 transition count 1188
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 418 place count 537 transition count 1148
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 423 place count 532 transition count 1142
Iterating global reduction 6 with 5 rules applied. Total rules applied 428 place count 532 transition count 1142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 432 place count 532 transition count 1138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 436 place count 530 transition count 1139
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 437 place count 530 transition count 1138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 438 place count 529 transition count 1138
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 449 place count 529 transition count 1127
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 461 place count 517 transition count 1127
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 476 place count 517 transition count 1127
Applied a total of 476 rules in 405 ms. Remains 517 /747 variables (removed 230) and now considering 1127/1360 (removed 233) transitions.
// Phase 1: matrix 1127 rows 517 cols
[2024-05-21 09:21:36] [INFO ] Computed 73 invariants in 18 ms
[2024-05-21 09:21:37] [INFO ] Implicit Places using invariants in 685 ms returned [95, 101, 104, 106, 107, 110, 111, 163, 182, 188, 191, 193, 198, 199, 251, 268, 274, 277, 279, 284, 285, 337, 356, 362, 365, 367, 372, 373, 425, 442, 448, 451, 453]
[2024-05-21 09:21:37] [INFO ] Actually due to overlaps returned [110, 198, 284, 372, 111, 199, 285, 373, 95, 101, 106, 182, 188, 193, 268, 274, 279, 356, 362, 367, 442, 448, 453, 107, 163, 251, 337, 425]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 688 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 489/804 places, 1127/1360 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 469 transition count 1107
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 469 transition count 1107
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 464 transition count 1102
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 464 transition count 1102
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 68 place count 455 transition count 1093
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 83 place count 455 transition count 1078
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 98 place count 440 transition count 1078
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 440 transition count 1074
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 106 place count 436 transition count 1074
Applied a total of 106 rules in 142 ms. Remains 436 /489 variables (removed 53) and now considering 1074/1127 (removed 53) transitions.
// Phase 1: matrix 1074 rows 436 cols
[2024-05-21 09:21:37] [INFO ] Computed 45 invariants in 23 ms
[2024-05-21 09:21:38] [INFO ] Implicit Places using invariants in 744 ms returned []
[2024-05-21 09:21:38] [INFO ] Invariant cache hit.
[2024-05-21 09:21:39] [INFO ] Implicit Places using invariants and state equation in 1850 ms returned []
Implicit Place search using SMT with State Equation took 2597 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 436/804 places, 1074/1360 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5409 ms. Remains : 436/804 places, 1074/1360 transitions.
[2024-05-21 09:21:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (18576 resets) in 2563 ms. (390 steps per ms)
BEST_FIRST walk for 4000004 steps (17913 resets) in 4289 ms. (932 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-21 09:21:46] [INFO ] Invariant cache hit.
[2024-05-21 09:21:46] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2024-05-21 09:21:46] [INFO ] [Real]Absence check using 12 positive and 33 generalized place invariants in 24 ms returned sat
[2024-05-21 09:21:47] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2024-05-21 09:21:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:21:47] [INFO ] [Nat]Absence check using 12 positive place invariants in 13 ms returned sat
[2024-05-21 09:21:47] [INFO ] [Nat]Absence check using 12 positive and 33 generalized place invariants in 26 ms returned sat
[2024-05-21 09:21:48] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2024-05-21 09:21:48] [INFO ] Computed and/alt/rep : 243/1147/243 causal constraints (skipped 802 transitions) in 132 ms.
[2024-05-21 09:21:48] [INFO ] Added : 11 causal constraints over 3 iterations in 494 ms. Result :sat
Minimization took 702 ms.
[2024-05-21 09:21:49] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-21 09:21:49] [INFO ] [Real]Absence check using 12 positive and 33 generalized place invariants in 21 ms returned sat
[2024-05-21 09:21:50] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2024-05-21 09:21:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:21:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 12 ms returned sat
[2024-05-21 09:21:50] [INFO ] [Nat]Absence check using 12 positive and 33 generalized place invariants in 37 ms returned sat
[2024-05-21 09:21:50] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2024-05-21 09:21:51] [INFO ] Computed and/alt/rep : 243/1147/243 causal constraints (skipped 802 transitions) in 117 ms.
[2024-05-21 09:21:51] [INFO ] Added : 30 causal constraints over 7 iterations in 926 ms. Result :sat
Minimization took 921 ms.
[2024-05-21 09:21:52] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-05-21 09:21:52] [INFO ] [Real]Absence check using 12 positive and 33 generalized place invariants in 19 ms returned sat
[2024-05-21 09:21:53] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2024-05-21 09:21:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:21:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-21 09:21:53] [INFO ] [Nat]Absence check using 12 positive and 33 generalized place invariants in 25 ms returned sat
[2024-05-21 09:21:54] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2024-05-21 09:21:54] [INFO ] Computed and/alt/rep : 243/1147/243 causal constraints (skipped 802 transitions) in 110 ms.
[2024-05-21 09:21:54] [INFO ] Added : 18 causal constraints over 4 iterations in 515 ms. Result :sat
Minimization took 766 ms.
[2024-05-21 09:21:55] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-21 09:21:55] [INFO ] [Real]Absence check using 12 positive and 33 generalized place invariants in 16 ms returned sat
[2024-05-21 09:21:55] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2024-05-21 09:21:56] [INFO ] Computed and/alt/rep : 243/1147/243 causal constraints (skipped 802 transitions) in 115 ms.
[2024-05-21 09:21:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:21:56] [INFO ] [Nat]Absence check using 12 positive place invariants in 13 ms returned sat
[2024-05-21 09:21:56] [INFO ] [Nat]Absence check using 12 positive and 33 generalized place invariants in 25 ms returned sat
[2024-05-21 09:21:57] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2024-05-21 09:21:57] [INFO ] Computed and/alt/rep : 243/1147/243 causal constraints (skipped 802 transitions) in 125 ms.
[2024-05-21 09:21:57] [INFO ] Added : 20 causal constraints over 5 iterations in 745 ms. Result :sat
Minimization took 969 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA ASLink-PT-05b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 1074/1074 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 436 transition count 1073
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 435 transition count 1073
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 434 transition count 1068
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 434 transition count 1068
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 434 transition count 1067
Applied a total of 5 rules in 36 ms. Remains 434 /436 variables (removed 2) and now considering 1067/1074 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 434/436 places, 1067/1074 transitions.
// Phase 1: matrix 1067 rows 434 cols
[2024-05-21 09:21:59] [INFO ] Computed 45 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (18558 resets) in 2582 ms. (387 steps per ms)
BEST_FIRST walk for 3000001 steps (13436 resets) in 2644 ms. (1134 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-21 09:22:04] [INFO ] Invariant cache hit.
[2024-05-21 09:22:04] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-21 09:22:04] [INFO ] [Real]Absence check using 12 positive and 33 generalized place invariants in 21 ms returned sat
[2024-05-21 09:22:05] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2024-05-21 09:22:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:22:05] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-21 09:22:05] [INFO ] [Nat]Absence check using 12 positive and 33 generalized place invariants in 24 ms returned sat
[2024-05-21 09:22:06] [INFO ] [Nat]Absence check using state equation in 673 ms returned sat
[2024-05-21 09:22:06] [INFO ] Computed and/alt/rep : 240/1159/240 causal constraints (skipped 798 transitions) in 121 ms.
[2024-05-21 09:22:06] [INFO ] Added : 18 causal constraints over 4 iterations in 594 ms. Result :sat
Minimization took 973 ms.
[2024-05-21 09:22:08] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-21 09:22:08] [INFO ] [Real]Absence check using 12 positive and 33 generalized place invariants in 17 ms returned sat
[2024-05-21 09:22:08] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2024-05-21 09:22:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:22:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-21 09:22:08] [INFO ] [Nat]Absence check using 12 positive and 33 generalized place invariants in 25 ms returned sat
[2024-05-21 09:22:09] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2024-05-21 09:22:09] [INFO ] Computed and/alt/rep : 240/1159/240 causal constraints (skipped 798 transitions) in 77 ms.
[2024-05-21 09:22:09] [INFO ] Added : 8 causal constraints over 2 iterations in 264 ms. Result :sat
Minimization took 814 ms.
[2024-05-21 09:22:10] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-21 09:22:10] [INFO ] [Real]Absence check using 12 positive and 33 generalized place invariants in 16 ms returned sat
[2024-05-21 09:22:11] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2024-05-21 09:22:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:22:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 12 ms returned sat
[2024-05-21 09:22:11] [INFO ] [Nat]Absence check using 12 positive and 33 generalized place invariants in 23 ms returned sat
[2024-05-21 09:22:11] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2024-05-21 09:22:12] [INFO ] Computed and/alt/rep : 240/1159/240 causal constraints (skipped 798 transitions) in 108 ms.
[2024-05-21 09:22:12] [INFO ] Added : 12 causal constraints over 3 iterations in 475 ms. Result :sat
Minimization took 1236 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1067/1067 transitions.
Applied a total of 0 rules in 20 ms. Remains 434 /434 variables (removed 0) and now considering 1067/1067 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 434/434 places, 1067/1067 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1067/1067 transitions.
Applied a total of 0 rules in 21 ms. Remains 434 /434 variables (removed 0) and now considering 1067/1067 (removed 0) transitions.
[2024-05-21 09:22:14] [INFO ] Invariant cache hit.
[2024-05-21 09:22:14] [INFO ] Implicit Places using invariants in 688 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 702 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 433/434 places, 1067/1067 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 433 transition count 1063
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 429 transition count 1063
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 428 transition count 1062
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 428 transition count 1061
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 427 transition count 1061
Applied a total of 12 rules in 48 ms. Remains 427 /433 variables (removed 6) and now considering 1061/1067 (removed 6) transitions.
// Phase 1: matrix 1061 rows 427 cols
[2024-05-21 09:22:14] [INFO ] Computed 44 invariants in 10 ms
[2024-05-21 09:22:15] [INFO ] Implicit Places using invariants in 567 ms returned []
[2024-05-21 09:22:15] [INFO ] Invariant cache hit.
[2024-05-21 09:22:17] [INFO ] Implicit Places using invariants and state equation in 2091 ms returned []
Implicit Place search using SMT with State Equation took 2659 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 427/434 places, 1061/1067 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3431 ms. Remains : 427/434 places, 1061/1067 transitions.
[2024-05-21 09:22:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (18668 resets) in 2871 ms. (348 steps per ms)
BEST_FIRST walk for 3000003 steps (13436 resets) in 2872 ms. (1044 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-21 09:22:23] [INFO ] Invariant cache hit.
[2024-05-21 09:22:23] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-05-21 09:22:23] [INFO ] [Real]Absence check using 10 positive and 34 generalized place invariants in 24 ms returned sat
[2024-05-21 09:22:23] [INFO ] [Real]Absence check using state equation in 565 ms returned sat
[2024-05-21 09:22:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:22:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-05-21 09:22:24] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 27 ms returned sat
[2024-05-21 09:22:24] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2024-05-21 09:22:24] [INFO ] Computed and/alt/rep : 228/1067/228 causal constraints (skipped 804 transitions) in 118 ms.
[2024-05-21 09:22:25] [INFO ] Added : 12 causal constraints over 3 iterations in 600 ms. Result :sat
Minimization took 1146 ms.
[2024-05-21 09:22:26] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-21 09:22:26] [INFO ] [Real]Absence check using 10 positive and 34 generalized place invariants in 25 ms returned sat
[2024-05-21 09:22:27] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2024-05-21 09:22:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:22:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-21 09:22:27] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 25 ms returned sat
[2024-05-21 09:22:27] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2024-05-21 09:22:28] [INFO ] Computed and/alt/rep : 228/1067/228 causal constraints (skipped 804 transitions) in 113 ms.
[2024-05-21 09:22:28] [INFO ] Added : 23 causal constraints over 5 iterations in 742 ms. Result :sat
Minimization took 1038 ms.
[2024-05-21 09:22:29] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-21 09:22:29] [INFO ] [Real]Absence check using 10 positive and 34 generalized place invariants in 23 ms returned sat
[2024-05-21 09:22:30] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2024-05-21 09:22:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:22:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-21 09:22:30] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 17 ms returned sat
[2024-05-21 09:22:30] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2024-05-21 09:22:30] [INFO ] Computed and/alt/rep : 228/1067/228 causal constraints (skipped 804 transitions) in 76 ms.
[2024-05-21 09:22:31] [INFO ] Added : 21 causal constraints over 5 iterations in 501 ms. Result :sat
Minimization took 1098 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA ASLink-PT-05b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 1061/1061 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 427 transition count 1060
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 426 transition count 1060
Applied a total of 2 rules in 29 ms. Remains 426 /427 variables (removed 1) and now considering 1060/1061 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 426/427 places, 1060/1061 transitions.
// Phase 1: matrix 1060 rows 426 cols
[2024-05-21 09:22:34] [INFO ] Computed 44 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (18461 resets) in 2579 ms. (387 steps per ms)
BEST_FIRST walk for 2000002 steps (8917 resets) in 1906 ms. (1048 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-21 09:22:38] [INFO ] Invariant cache hit.
[2024-05-21 09:22:38] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-21 09:22:38] [INFO ] [Real]Absence check using 12 positive and 32 generalized place invariants in 15 ms returned sat
[2024-05-21 09:22:39] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2024-05-21 09:22:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:22:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 12 ms returned sat
[2024-05-21 09:22:39] [INFO ] [Nat]Absence check using 12 positive and 32 generalized place invariants in 25 ms returned sat
[2024-05-21 09:22:39] [INFO ] [Nat]Absence check using state equation in 610 ms returned sat
[2024-05-21 09:22:40] [INFO ] Computed and/alt/rep : 227/1066/227 causal constraints (skipped 804 transitions) in 108 ms.
[2024-05-21 09:22:41] [INFO ] Added : 65 causal constraints over 13 iterations in 1438 ms. Result :sat
Minimization took 864 ms.
[2024-05-21 09:22:42] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-21 09:22:42] [INFO ] [Real]Absence check using 12 positive and 32 generalized place invariants in 15 ms returned sat
[2024-05-21 09:22:42] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2024-05-21 09:22:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:22:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-21 09:22:42] [INFO ] [Nat]Absence check using 12 positive and 32 generalized place invariants in 12 ms returned sat
[2024-05-21 09:22:43] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2024-05-21 09:22:43] [INFO ] Deduced a trap composed of 62 places in 231 ms of which 3 ms to minimize.
[2024-05-21 09:22:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
[2024-05-21 09:22:43] [INFO ] Computed and/alt/rep : 227/1066/227 causal constraints (skipped 804 transitions) in 129 ms.
[2024-05-21 09:22:44] [INFO ] Added : 16 causal constraints over 4 iterations in 660 ms. Result :sat
Minimization took 863 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 1060/1060 transitions.
Applied a total of 0 rules in 16 ms. Remains 426 /426 variables (removed 0) and now considering 1060/1060 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 426/426 places, 1060/1060 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 1060/1060 transitions.
Applied a total of 0 rules in 17 ms. Remains 426 /426 variables (removed 0) and now considering 1060/1060 (removed 0) transitions.
[2024-05-21 09:22:45] [INFO ] Invariant cache hit.
[2024-05-21 09:22:46] [INFO ] Implicit Places using invariants in 622 ms returned []
[2024-05-21 09:22:46] [INFO ] Invariant cache hit.
[2024-05-21 09:22:47] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned []
Implicit Place search using SMT with State Equation took 2296 ms to find 0 implicit places.
[2024-05-21 09:22:47] [INFO ] Redundant transitions in 86 ms returned []
Running 1031 sub problems to find dead transitions.
[2024-05-21 09:22:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1031 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 1031 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/1486 variables, and 40 constraints, problems are : Problem set: 0 solved, 1031 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/426 constraints, PredecessorRefiner: 1031/1031 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1031 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1031 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 1031 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1031 unsolved
At refinement iteration 3 (OVERLAPS) 1/426 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1031 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1031 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/1486 variables, and 44 constraints, problems are : Problem set: 0 solved, 1031 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/426 constraints, PredecessorRefiner: 0/1031 constraints, Known Traps: 0/0 constraints]
After SMT, in 61261ms problems are : Problem set: 0 solved, 1031 unsolved
Search for dead transitions found 0 dead transitions in 61297ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63723 ms. Remains : 426/426 places, 1060/1060 transitions.
RANDOM walk for 40000 steps (747 resets) in 2660 ms. (15 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (169 resets) in 504 ms. (79 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (174 resets) in 323 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (173 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (183 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
[2024-05-21 09:23:50] [INFO ] Flatten gal took : 512 ms
[2024-05-21 09:23:50] [INFO ] Flatten gal took : 156 ms
[2024-05-21 09:23:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality362789543748859418.gal : 50 ms
[2024-05-21 09:23:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7746156792820062113.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality362789543748859418.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7746156792820062113.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality7746156792820062113.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 44
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :44 after 328
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :328 after 14688
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :14688 after 146600
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :146600 after 153688
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :153688 after 154429
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :154429 after 3.1308e+06
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :3.1308e+06 after 2.38132e+07
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.57083e+08,1.82516,39468,2,25500,18,83895,6,0,2767,71894,0
Total reachable state count : 357083480

Verifying 4 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,328,1.83128,39468,2,959,18,83895,7,0,2770,71894,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,328,1.83486,39728,2,959,18,83895,8,0,2771,71894,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,6,1.84195,39728,2,537,18,83895,9,0,2773,71894,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,6,1.84928,39728,2,537,18,83895,10,0,2774,71894,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 147724 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 4
Probabilistic random walk after 147724 steps, saw 68680 distinct states, run finished after 3006 ms. (steps per millisecond=49 ) properties seen :0
FORMULA ASLink-PT-05b-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-05b-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 340304 ms.

BK_STOP 1716283433616

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="ASLink-PT-05b"
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-5568"
echo " Executing tool itstools"
echo " Input is ASLink-PT-05b, 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 r004-smll-171620117800085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-05b.tgz
mv ASLink-PT-05b 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 ;