MCC'2022- Execution of r132-tall-165271821200675

About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C05

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
8095.000	657380.00	1869874.00	7250.70	TTFFFFTFTTFFFFTT	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.9M
-rw-r--r-- 1 mcc users 11K Apr 29 16:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 16:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 29 16:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 29 16:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K May 9 08:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 9 08:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 4.6M May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652827431417

Running Version 202205111006
[2022-05-17 22:43:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 22:43:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 22:43:53] [INFO ] Load time of PNML (sax parser for PT used): 373 ms
[2022-05-17 22:43:53] [INFO ] Transformed 4914 places.
[2022-05-17 22:43:53] [INFO ] Transformed 6913 transitions.
[2022-05-17 22:43:53] [INFO ] Parsed PT model containing 4914 places and 6913 transitions in 509 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 4914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 4884 transition count 6913
Discarding 1341 places :
Symmetric choice reduction at 1 with 1341 rule applications. Total rules 1371 place count 3543 transition count 5572
Iterating global reduction 1 with 1341 rules applied. Total rules applied 2712 place count 3543 transition count 5572
Discarding 1179 places :
Symmetric choice reduction at 1 with 1179 rule applications. Total rules 3891 place count 2364 transition count 4393
Iterating global reduction 1 with 1179 rules applied. Total rules applied 5070 place count 2364 transition count 4393
Discarding 226 places :
Symmetric choice reduction at 1 with 226 rule applications. Total rules 5296 place count 2138 transition count 3263
Iterating global reduction 1 with 226 rules applied. Total rules applied 5522 place count 2138 transition count 3263
Applied a total of 5522 rules in 1149 ms. Remains 2138 /4914 variables (removed 2776) and now considering 3263/6913 (removed 3650) transitions.
[2022-05-17 22:43:54] [INFO ] Flow matrix only has 2991 transitions (discarded 272 similar events)
// Phase 1: matrix 2991 rows 2138 cols
[2022-05-17 22:43:54] [INFO ] Computed 505 place invariants in 157 ms
[2022-05-17 22:43:57] [INFO ] Implicit Places using invariants in 2791 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 27, 34, 43, 54, 67, 82, 98, 114, 116, 118, 120, 122, 124, 137, 148, 157, 164, 169, 172, 195, 202, 206, 207, 208, 209, 210, 216, 221, 228, 237, 248, 261, 275, 289, 290, 291, 292, 293, 294, 305, 314, 321, 326, 329, 331, 354, 361, 364, 365, 366, 367, 368, 369, 371, 374, 379, 386, 395, 406, 418, 430, 431, 432, 433, 434, 435, 444, 451, 456, 459, 461, 463, 486, 493, 496, 497, 498, 499, 500, 501, 503, 505, 508, 513, 520, 529, 539, 549, 552, 553, 554, 561, 566, 569, 571, 576, 578, 603, 610, 613, 615, 616, 617, 618, 620, 622, 624, 630, 635, 642, 650, 658, 659, 660, 661, 662, 663, 668, 671, 673, 675, 677, 679, 702, 709, 712, 713, 714, 715, 716, 717, 719, 721, 723, 725, 728, 733, 739, 745, 746, 747, 748, 749, 750, 753, 755, 757, 759, 761, 786, 793, 796, 797, 798, 799, 800, 801, 803, 805, 807, 809, 811, 814, 818, 822, 823, 824, 825, 826, 827, 829, 831, 833, 835, 837, 839, 862, 869, 872, 873, 874, 875, 876, 877, 879, 881, 883, 885, 887, 889, 891, 894, 895, 896, 897, 898, 899, 901, 903, 905, 907, 909, 911, 934, 936, 940, 943, 944, 945, 946, 947, 948, 950, 952, 954, 956, 958, 960, 962, 967, 968, 970, 971, 975, 980, 985, 987, 989, 991, 1014, 1021, 1024, 1025, 1026, 1027, 1028, 1029, 1031, 1033, 1035, 1037, 1039, 1041, 1043, 1046, 1047, 1048, 1049, 1050, 1051, 1053, 1055, 1057, 1059, 1061, 1063, 1086, 1093, 1096, 1097, 1098, 1099, 1100, 1101, 1103, 1105, 1107, 1109, 1111, 1113, 1116, 1121, 1122, 1123, 1124, 1125, 1126, 1129, 1131, 1133, 1135, 1137, 1139, 1162, 1169, 1172, 1173, 1174, 1175, 1176, 1177, 1179, 1181, 1183, 1185, 1187, 1190, 1195, 1202, 1203, 1204, 1205, 1206, 1207, 1212, 1215, 1217, 1219, 1221, 1223, 1246, 1253, 1256, 1257, 1258, 1259, 1260, 1261, 1263, 1265, 1267, 1269, 1272, 1277, 1284, 1293, 1294, 1295, 1296, 1297, 1298, 1305, 1310, 1313, 1315, 1317, 1319, 1342, 1349, 1353, 1354, 1355, 1356, 1357, 1359, 1361, 1363, 1366, 1371, 1378, 1390, 1401, 1402, 1403, 1405, 1406, 1417, 1424, 1429, 1432, 1434, 1436, 1466, 1469, 1470, 1471, 1472, 1473, 1474, 1476, 1478, 1481, 1486, 1493, 1502, 1513, 1526, 1527, 1528, 1529, 1530, 1542, 1551, 1558, 1563, 1566, 1568, 1591, 1598, 1601, 1602, 1604, 1605, 1606, 1608, 1611, 1616, 1623, 1635, 1646, 1659, 1674, 1675, 1676, 1677, 1678, 1679, 1692, 1703, 1712, 1719, 1724, 1727, 1750, 1752, 1756, 1759, 1760, 1761, 1762, 1763, 1764, 1767, 1772, 1779, 1788, 1799, 1812, 1827, 1844, 1845, 1846, 1848, 1849, 1864, 1878, 1889, 1901, 1908, 1913, 1937]
Discarding 449 places :
Implicit Place search using SMT only with invariants took 2844 ms to find 449 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1689/4914 places, 3263/6913 transitions.
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 148 place count 1541 transition count 3115
Iterating global reduction 0 with 148 rules applied. Total rules applied 296 place count 1541 transition count 3115
Discarding 147 places :
Symmetric choice reduction at 0 with 147 rule applications. Total rules 443 place count 1394 transition count 2968
Iterating global reduction 0 with 147 rules applied. Total rules applied 590 place count 1394 transition count 2968
Discarding 147 places :
Symmetric choice reduction at 0 with 147 rule applications. Total rules 737 place count 1247 transition count 2821
Iterating global reduction 0 with 147 rules applied. Total rules applied 884 place count 1247 transition count 2821
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 905 place count 1226 transition count 2716
Iterating global reduction 0 with 21 rules applied. Total rules applied 926 place count 1226 transition count 2716
Applied a total of 926 rules in 611 ms. Remains 1226 /1689 variables (removed 463) and now considering 2716/3263 (removed 547) transitions.
[2022-05-17 22:43:57] [INFO ] Flow matrix only has 2444 transitions (discarded 272 similar events)
// Phase 1: matrix 2444 rows 1226 cols
[2022-05-17 22:43:57] [INFO ] Computed 56 place invariants in 36 ms
[2022-05-17 22:43:58] [INFO ] Implicit Places using invariants in 965 ms returned []
[2022-05-17 22:43:58] [INFO ] Flow matrix only has 2444 transitions (discarded 272 similar events)
// Phase 1: matrix 2444 rows 1226 cols
[2022-05-17 22:43:58] [INFO ] Computed 56 place invariants in 30 ms
[2022-05-17 22:43:59] [INFO ] State equation strengthened by 918 read => feed constraints.
[2022-05-17 22:44:10] [INFO ] Implicit Places using invariants and state equation in 11198 ms returned []
Implicit Place search using SMT with State Equation took 12165 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1226/4914 places, 2716/6913 transitions.
Finished structural reductions, in 2 iterations. Remains : 1226/4914 places, 2716/6913 transitions.
Support contains 26 out of 1226 places after structural reductions.
[2022-05-17 22:44:10] [INFO ] Flatten gal took : 195 ms
[2022-05-17 22:44:10] [INFO ] Flatten gal took : 136 ms
[2022-05-17 22:44:10] [INFO ] Input system was already deterministic with 2716 transitions.
Support contains 23 out of 1226 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2022-05-17 22:44:11] [INFO ] Flow matrix only has 2444 transitions (discarded 272 similar events)
// Phase 1: matrix 2444 rows 1226 cols
[2022-05-17 22:44:11] [INFO ] Computed 56 place invariants in 26 ms
[2022-05-17 22:44:12] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2022-05-17 22:44:12] [INFO ] [Real]Absence check using 31 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-17 22:44:12] [INFO ] After 414ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:4
[2022-05-17 22:44:12] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2022-05-17 22:44:12] [INFO ] [Nat]Absence check using 31 positive and 25 generalized place invariants in 20 ms returned sat
[2022-05-17 22:44:13] [INFO ] After 1049ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :3
[2022-05-17 22:44:13] [INFO ] State equation strengthened by 918 read => feed constraints.
[2022-05-17 22:44:14] [INFO ] After 592ms SMT Verify possible using 918 Read/Feed constraints in natural domain returned unsat :6 sat :3
[2022-05-17 22:44:14] [INFO ] Deduced a trap composed of 432 places in 531 ms of which 5 ms to minimize.
[2022-05-17 22:44:15] [INFO ] Deduced a trap composed of 400 places in 520 ms of which 2 ms to minimize.
[2022-05-17 22:44:16] [INFO ] Deduced a trap composed of 467 places in 475 ms of which 1 ms to minimize.
[2022-05-17 22:44:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1823 ms
[2022-05-17 22:44:16] [INFO ] Deduced a trap composed of 417 places in 454 ms of which 1 ms to minimize.
[2022-05-17 22:44:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 623 ms
[2022-05-17 22:44:17] [INFO ] After 3381ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :3
Attempting to minimize the solution found.
Minimization took 284 ms.
[2022-05-17 22:44:17] [INFO ] After 5059ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :3
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 6 out of 1226 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1226/1226 places, 2716/2716 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 1226 transition count 2696
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 1206 transition count 2696
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 40 place count 1206 transition count 2681
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 70 place count 1191 transition count 2681
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 76 place count 1185 transition count 2671
Iterating global reduction 2 with 6 rules applied. Total rules applied 82 place count 1185 transition count 2671
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 82 place count 1185 transition count 2670
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 1184 transition count 2670
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 1179 transition count 2657
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 1179 transition count 2657
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 97 place count 1176 transition count 2642
Iterating global reduction 2 with 3 rules applied. Total rules applied 100 place count 1176 transition count 2642
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 158 place count 1147 transition count 2613
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 163 place count 1142 transition count 2608
Iterating global reduction 2 with 5 rules applied. Total rules applied 168 place count 1142 transition count 2608
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 1137 transition count 2583
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 1137 transition count 2583
Free-agglomeration rule (complex) applied 143 times.
Iterating global reduction 2 with 143 rules applied. Total rules applied 321 place count 1137 transition count 3472
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 2 with 143 rules applied. Total rules applied 464 place count 994 transition count 3472
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 473 place count 994 transition count 3472
Applied a total of 473 rules in 753 ms. Remains 994 /1226 variables (removed 232) and now considering 3472/2716 (removed -756) transitions.
Finished structural reductions, in 1 iterations. Remains : 994/1226 places, 3472/2716 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 65323 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 65323 steps, saw 27502 distinct states, run finished after 3002 ms. (steps per millisecond=21 ) properties seen :2
Running SMT prover for 1 properties.
[2022-05-17 22:44:21] [INFO ] Flow matrix only has 3074 transitions (discarded 398 similar events)
// Phase 1: matrix 3074 rows 994 cols
[2022-05-17 22:44:21] [INFO ] Computed 56 place invariants in 30 ms
[2022-05-17 22:44:21] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 22:44:21] [INFO ] [Nat]Absence check using 32 positive place invariants in 21 ms returned sat
[2022-05-17 22:44:21] [INFO ] [Nat]Absence check using 32 positive and 24 generalized place invariants in 4 ms returned sat
[2022-05-17 22:44:22] [INFO ] After 880ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 22:44:22] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2022-05-17 22:44:23] [INFO ] After 335ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 22:44:23] [INFO ] Deduced a trap composed of 259 places in 426 ms of which 1 ms to minimize.
[2022-05-17 22:44:24] [INFO ] Deduced a trap composed of 100 places in 475 ms of which 1 ms to minimize.
[2022-05-17 22:44:24] [INFO ] Deduced a trap composed of 88 places in 473 ms of which 1 ms to minimize.
[2022-05-17 22:44:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1685 ms
[2022-05-17 22:44:24] [INFO ] After 2093ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2022-05-17 22:44:25] [INFO ] After 3255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 994 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 994/994 places, 3472/3472 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 994 transition count 3470
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 992 transition count 3470
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 992 transition count 3470
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 10 place count 989 transition count 3467
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 989 transition count 3467
Applied a total of 13 rules in 231 ms. Remains 989 /994 variables (removed 5) and now considering 3467/3472 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 989/994 places, 3467/3472 transitions.
Incomplete random walk after 10000 steps, including 339 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 72196 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72196 steps, saw 30349 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 22:44:28] [INFO ] Flow matrix only has 3069 transitions (discarded 398 similar events)
// Phase 1: matrix 3069 rows 989 cols
[2022-05-17 22:44:28] [INFO ] Computed 56 place invariants in 28 ms
[2022-05-17 22:44:28] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 22:44:28] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2022-05-17 22:44:28] [INFO ] [Nat]Absence check using 31 positive and 25 generalized place invariants in 6 ms returned sat
[2022-05-17 22:44:29] [INFO ] After 669ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 22:44:29] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2022-05-17 22:44:29] [INFO ] After 377ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 22:44:30] [INFO ] Deduced a trap composed of 158 places in 416 ms of which 1 ms to minimize.
[2022-05-17 22:44:30] [INFO ] Deduced a trap composed of 97 places in 475 ms of which 1 ms to minimize.
[2022-05-17 22:44:31] [INFO ] Deduced a trap composed of 86 places in 475 ms of which 1 ms to minimize.
[2022-05-17 22:44:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1686 ms
[2022-05-17 22:44:31] [INFO ] After 2132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-05-17 22:44:31] [INFO ] After 3053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 989 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 989/989 places, 3467/3467 transitions.
Applied a total of 0 rules in 95 ms. Remains 989 /989 variables (removed 0) and now considering 3467/3467 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 989/989 places, 3467/3467 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 989/989 places, 3467/3467 transitions.
Applied a total of 0 rules in 82 ms. Remains 989 /989 variables (removed 0) and now considering 3467/3467 (removed 0) transitions.
[2022-05-17 22:44:31] [INFO ] Flow matrix only has 3069 transitions (discarded 398 similar events)
// Phase 1: matrix 3069 rows 989 cols
[2022-05-17 22:44:31] [INFO ] Computed 56 place invariants in 26 ms
[2022-05-17 22:44:32] [INFO ] Implicit Places using invariants in 1067 ms returned [135, 334, 335, 358, 420, 480, 481, 640, 663, 707, 742, 898]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1071 ms to find 12 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 977/989 places, 3467/3467 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 974 transition count 3464
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 974 transition count 3464
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 971 transition count 3461
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 971 transition count 3461
Applied a total of 12 rules in 133 ms. Remains 971 /977 variables (removed 6) and now considering 3461/3467 (removed 6) transitions.
[2022-05-17 22:44:33] [INFO ] Flow matrix only has 3063 transitions (discarded 398 similar events)
// Phase 1: matrix 3063 rows 971 cols
[2022-05-17 22:44:33] [INFO ] Computed 44 place invariants in 26 ms
[2022-05-17 22:44:34] [INFO ] Implicit Places using invariants in 983 ms returned []
[2022-05-17 22:44:34] [INFO ] Flow matrix only has 3063 transitions (discarded 398 similar events)
// Phase 1: matrix 3063 rows 971 cols
[2022-05-17 22:44:34] [INFO ] Computed 44 place invariants in 29 ms
[2022-05-17 22:44:34] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2022-05-17 22:44:50] [INFO ] Implicit Places using invariants and state equation in 16038 ms returned []
Implicit Place search using SMT with State Equation took 17022 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 971/989 places, 3461/3467 transitions.
Finished structural reductions, in 2 iterations. Remains : 971/989 places, 3461/3467 transitions.
Incomplete random walk after 10000 steps, including 341 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 73330 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73330 steps, saw 30733 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 22:44:53] [INFO ] Flow matrix only has 3063 transitions (discarded 398 similar events)
// Phase 1: matrix 3063 rows 971 cols
[2022-05-17 22:44:53] [INFO ] Computed 44 place invariants in 42 ms
[2022-05-17 22:44:53] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 22:44:53] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-17 22:44:53] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 2 ms returned sat
[2022-05-17 22:44:54] [INFO ] After 1239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 22:44:54] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2022-05-17 22:44:55] [INFO ] After 495ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 22:44:55] [INFO ] Deduced a trap composed of 278 places in 387 ms of which 0 ms to minimize.
[2022-05-17 22:44:56] [INFO ] Deduced a trap composed of 90 places in 472 ms of which 0 ms to minimize.
[2022-05-17 22:44:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1077 ms
[2022-05-17 22:44:56] [INFO ] After 1645ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2022-05-17 22:44:56] [INFO ] After 3136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 971 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 971/971 places, 3461/3461 transitions.
Applied a total of 0 rules in 89 ms. Remains 971 /971 variables (removed 0) and now considering 3461/3461 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 971/971 places, 3461/3461 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 971/971 places, 3461/3461 transitions.
Applied a total of 0 rules in 93 ms. Remains 971 /971 variables (removed 0) and now considering 3461/3461 (removed 0) transitions.
[2022-05-17 22:44:56] [INFO ] Flow matrix only has 3063 transitions (discarded 398 similar events)
// Phase 1: matrix 3063 rows 971 cols
[2022-05-17 22:44:56] [INFO ] Computed 44 place invariants in 23 ms
[2022-05-17 22:44:57] [INFO ] Implicit Places using invariants in 989 ms returned []
[2022-05-17 22:44:57] [INFO ] Flow matrix only has 3063 transitions (discarded 398 similar events)
// Phase 1: matrix 3063 rows 971 cols
[2022-05-17 22:44:57] [INFO ] Computed 44 place invariants in 21 ms
[2022-05-17 22:44:58] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2022-05-17 22:45:14] [INFO ] Implicit Places using invariants and state equation in 17246 ms returned []
Implicit Place search using SMT with State Equation took 18238 ms to find 0 implicit places.
[2022-05-17 22:45:15] [INFO ] Redundant transitions in 254 ms returned []
[2022-05-17 22:45:15] [INFO ] Flow matrix only has 3063 transitions (discarded 398 similar events)
// Phase 1: matrix 3063 rows 971 cols
[2022-05-17 22:45:15] [INFO ] Computed 44 place invariants in 21 ms
[2022-05-17 22:45:16] [INFO ] Dead Transitions using invariants and state equation in 1165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 971/971 places, 3461/3461 transitions.
Graph (trivial) has 1053 edges and 971 vertex of which 17 / 971 are part of one of the 1 SCC in 9 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4016 edges and 955 vertex of which 941 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.4 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1195.t1403 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 98 rules applied. Total rules applied 100 place count 924 transition count 2693
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 287 rules applied. Total rules applied 387 place count 828 transition count 2502
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 23 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 262 rules applied. Total rules applied 649 place count 733 transition count 2335
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 863 place count 661 transition count 2193
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1053 place count 591 transition count 2073
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1201 place count 541 transition count 1975
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1329 place count 493 transition count 1895
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1423 place count 461 transition count 1833
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1501 place count 431 transition count 1785
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1553 place count 413 transition count 1751
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1593 place count 397 transition count 1727
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1615 place count 389 transition count 1713
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1629 place count 383 transition count 1705
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1634 place count 381 transition count 1702
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1636 place count 380 transition count 1701
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 16 Pre rules applied. Total rules applied 1636 place count 380 transition count 1685
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 15 with 32 rules applied. Total rules applied 1668 place count 364 transition count 1685
Discarding 282 places :
Symmetric choice reduction at 15 with 282 rule applications. Total rules 1950 place count 82 transition count 359
Iterating global reduction 15 with 282 rules applied. Total rules applied 2232 place count 82 transition count 359
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 15 with 196 rules applied. Total rules applied 2428 place count 82 transition count 163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2428 place count 82 transition count 162
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2430 place count 81 transition count 162
Discarding 13 places :
Symmetric choice reduction at 16 with 13 rule applications. Total rules 2443 place count 68 transition count 102
Iterating global reduction 16 with 13 rules applied. Total rules applied 2456 place count 68 transition count 102
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 16 with 21 rules applied. Total rules applied 2477 place count 68 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2478 place count 67 transition count 81
Discarding 9 places :
Symmetric choice reduction at 18 with 9 rule applications. Total rules 2487 place count 58 transition count 70
Iterating global reduction 18 with 9 rules applied. Total rules applied 2496 place count 58 transition count 70
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 18 with 1 rules applied. Total rules applied 2497 place count 58 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 2498 place count 57 transition count 69
Discarding 2 places :
Symmetric choice reduction at 20 with 2 rule applications. Total rules 2500 place count 55 transition count 67
Iterating global reduction 20 with 2 rules applied. Total rules applied 2502 place count 55 transition count 67
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 2510 place count 51 transition count 63
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 2511 place count 50 transition count 60
Iterating global reduction 20 with 1 rules applied. Total rules applied 2512 place count 50 transition count 60
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 20 with 10 rules applied. Total rules applied 2522 place count 50 transition count 50
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 20 with 10 rules applied. Total rules applied 2532 place count 40 transition count 50
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 2533 place count 40 transition count 50
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 2534 place count 39 transition count 45
Iterating global reduction 21 with 1 rules applied. Total rules applied 2535 place count 39 transition count 45
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 21 with 3 rules applied. Total rules applied 2538 place count 39 transition count 42
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 2539 place count 38 transition count 40
Iterating global reduction 22 with 1 rules applied. Total rules applied 2540 place count 38 transition count 40
Applied a total of 2540 rules in 384 ms. Remains 38 /971 variables (removed 933) and now considering 40/3461 (removed 3421) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 40 rows 38 cols
[2022-05-17 22:45:16] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-17 22:45:16] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 22:45:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 22:45:16] [INFO ] [Nat]Absence check using 3 positive and 11 generalized place invariants in 4 ms returned sat
[2022-05-17 22:45:16] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 22:45:16] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 22:45:16] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 22:45:16] [INFO ] Flatten gal took : 3 ms
[2022-05-17 22:45:16] [INFO ] Flatten gal took : 3 ms
[2022-05-17 22:45:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17818277026053313865.gal : 2 ms
[2022-05-17 22:45:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4045163029553789793.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms11088719562032325636;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17818277026053313865.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4045163029553789793.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality4045163029553789793.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :11 after 23
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :23 after 47
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :47 after 98
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :98 after 437
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,913,0.02277,3928,2,535,10,1947,7,0,180,1377,0
Total reachable state count : 913

Verifying 1 reachability properties.
Reachability property AtomicPropp11 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
AtomicPropp11,57,0.023166,4352,2,158,10,1947,7,0,184,1377,0
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 7 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 394 stabilizing places and 1083 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(p0)))'
Support contains 1 out of 1226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1226/1226 places, 2716/2716 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1226 transition count 2694
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 1204 transition count 2694
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 44 place count 1204 transition count 2679
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 74 place count 1189 transition count 2679
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 80 place count 1183 transition count 2669
Iterating global reduction 2 with 6 rules applied. Total rules applied 86 place count 1183 transition count 2669
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 86 place count 1183 transition count 2668
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 88 place count 1182 transition count 2668
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 93 place count 1177 transition count 2655
Iterating global reduction 2 with 5 rules applied. Total rules applied 98 place count 1177 transition count 2655
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 101 place count 1174 transition count 2640
Iterating global reduction 2 with 3 rules applied. Total rules applied 104 place count 1174 transition count 2640
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 162 place count 1145 transition count 2611
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 170 place count 1137 transition count 2603
Iterating global reduction 2 with 8 rules applied. Total rules applied 178 place count 1137 transition count 2603
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 186 place count 1129 transition count 2563
Iterating global reduction 2 with 8 rules applied. Total rules applied 194 place count 1129 transition count 2563
Applied a total of 194 rules in 371 ms. Remains 1129 /1226 variables (removed 97) and now considering 2563/2716 (removed 153) transitions.
[2022-05-17 22:45:17] [INFO ] Flow matrix only has 2291 transitions (discarded 272 similar events)
// Phase 1: matrix 2291 rows 1129 cols
[2022-05-17 22:45:17] [INFO ] Computed 56 place invariants in 25 ms
[2022-05-17 22:45:18] [INFO ] Implicit Places using invariants in 877 ms returned [154, 384, 385, 412, 486, 551, 700, 734, 761, 811, 852, 1030]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 881 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1117/1226 places, 2563/2716 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1113 transition count 2559
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1113 transition count 2559
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 1109 transition count 2555
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 1109 transition count 2555
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 1107 transition count 2545
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 1107 transition count 2545
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 30 place count 1102 transition count 2540
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 1097 transition count 2535
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 1097 transition count 2535
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 1092 transition count 2510
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 1092 transition count 2510
Applied a total of 50 rules in 311 ms. Remains 1092 /1117 variables (removed 25) and now considering 2510/2563 (removed 53) transitions.
[2022-05-17 22:45:18] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1092 cols
[2022-05-17 22:45:18] [INFO ] Computed 44 place invariants in 26 ms
[2022-05-17 22:45:19] [INFO ] Implicit Places using invariants in 824 ms returned []
[2022-05-17 22:45:19] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1092 cols
[2022-05-17 22:45:19] [INFO ] Computed 44 place invariants in 15 ms
[2022-05-17 22:45:20] [INFO ] State equation strengthened by 834 read => feed constraints.
[2022-05-17 22:45:27] [INFO ] Implicit Places using invariants and state equation in 7977 ms returned []
Implicit Place search using SMT with State Equation took 8804 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1092/1226 places, 2510/2716 transitions.
Finished structural reductions, in 2 iterations. Remains : 1092/1226 places, 2510/2716 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s544)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-05 finished in 10565 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(p0)))))'
Support contains 2 out of 1226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1226/1226 places, 2716/2716 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1226 transition count 2693
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 1203 transition count 2693
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 1203 transition count 2678
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 76 place count 1188 transition count 2678
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 83 place count 1181 transition count 2667
Iterating global reduction 2 with 7 rules applied. Total rules applied 90 place count 1181 transition count 2667
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 90 place count 1181 transition count 2666
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 1180 transition count 2666
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 98 place count 1174 transition count 2648
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 1174 transition count 2648
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 1171 transition count 2633
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 1171 transition count 2633
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 168 place count 1142 transition count 2604
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 176 place count 1134 transition count 2596
Iterating global reduction 2 with 8 rules applied. Total rules applied 184 place count 1134 transition count 2596
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 192 place count 1126 transition count 2556
Iterating global reduction 2 with 8 rules applied. Total rules applied 200 place count 1126 transition count 2556
Applied a total of 200 rules in 356 ms. Remains 1126 /1226 variables (removed 100) and now considering 2556/2716 (removed 160) transitions.
[2022-05-17 22:45:27] [INFO ] Flow matrix only has 2284 transitions (discarded 272 similar events)
// Phase 1: matrix 2284 rows 1126 cols
[2022-05-17 22:45:27] [INFO ] Computed 56 place invariants in 41 ms
[2022-05-17 22:45:28] [INFO ] Implicit Places using invariants in 897 ms returned [154, 384, 385, 412, 486, 550, 551, 697, 731, 758, 808, 849, 1027]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 903 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1113/1226 places, 2556/2716 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1109 transition count 2552
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1109 transition count 2552
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 1105 transition count 2548
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 1105 transition count 2548
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 1103 transition count 2538
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 1103 transition count 2538
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 32 place count 1097 transition count 2532
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 1091 transition count 2526
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 1091 transition count 2526
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 1085 transition count 2496
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 1085 transition count 2496
Applied a total of 56 rules in 293 ms. Remains 1085 /1113 variables (removed 28) and now considering 2496/2556 (removed 60) transitions.
[2022-05-17 22:45:29] [INFO ] Flow matrix only has 2224 transitions (discarded 272 similar events)
// Phase 1: matrix 2224 rows 1085 cols
[2022-05-17 22:45:29] [INFO ] Computed 43 place invariants in 28 ms
[2022-05-17 22:45:29] [INFO ] Implicit Places using invariants in 842 ms returned []
[2022-05-17 22:45:29] [INFO ] Flow matrix only has 2224 transitions (discarded 272 similar events)
// Phase 1: matrix 2224 rows 1085 cols
[2022-05-17 22:45:29] [INFO ] Computed 43 place invariants in 17 ms
[2022-05-17 22:45:30] [INFO ] State equation strengthened by 826 read => feed constraints.
[2022-05-17 22:45:36] [INFO ] Implicit Places using invariants and state equation in 6862 ms returned []
Implicit Place search using SMT with State Equation took 7708 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1085/1226 places, 2496/2716 transitions.
Finished structural reductions, in 2 iterations. Remains : 1085/1226 places, 2496/2716 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s146 s1002)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-07 finished in 9363 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((F(p1)&&p2))))'
Support contains 6 out of 1226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1226/1226 places, 2716/2716 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1226 transition count 2697
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1207 transition count 2697
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 38 place count 1207 transition count 2682
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 68 place count 1192 transition count 2682
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 74 place count 1186 transition count 2672
Iterating global reduction 2 with 6 rules applied. Total rules applied 80 place count 1186 transition count 2672
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 80 place count 1186 transition count 2671
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 82 place count 1185 transition count 2671
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 87 place count 1180 transition count 2654
Iterating global reduction 2 with 5 rules applied. Total rules applied 92 place count 1180 transition count 2654
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 1178 transition count 2644
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 1178 transition count 2644
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 154 place count 1149 transition count 2615
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 159 place count 1144 transition count 2610
Iterating global reduction 2 with 5 rules applied. Total rules applied 164 place count 1144 transition count 2610
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 169 place count 1139 transition count 2585
Iterating global reduction 2 with 5 rules applied. Total rules applied 174 place count 1139 transition count 2585
Applied a total of 174 rules in 340 ms. Remains 1139 /1226 variables (removed 87) and now considering 2585/2716 (removed 131) transitions.
[2022-05-17 22:45:37] [INFO ] Flow matrix only has 2313 transitions (discarded 272 similar events)
// Phase 1: matrix 2313 rows 1139 cols
[2022-05-17 22:45:37] [INFO ] Computed 56 place invariants in 21 ms
[2022-05-17 22:45:38] [INFO ] Implicit Places using invariants in 883 ms returned [154, 384, 385, 412, 486, 550, 737, 764, 814, 1037]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 885 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1129/1226 places, 2585/2716 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1127 transition count 2583
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1127 transition count 2583
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1125 transition count 2581
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1125 transition count 2581
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1124 transition count 2576
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1124 transition count 2576
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1119 transition count 2571
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 1114 transition count 2566
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 1114 transition count 2566
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 1110 transition count 2546
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 1110 transition count 2546
Applied a total of 38 rules in 274 ms. Remains 1110 /1129 variables (removed 19) and now considering 2546/2585 (removed 39) transitions.
[2022-05-17 22:45:38] [INFO ] Flow matrix only has 2274 transitions (discarded 272 similar events)
// Phase 1: matrix 2274 rows 1110 cols
[2022-05-17 22:45:38] [INFO ] Computed 46 place invariants in 23 ms
[2022-05-17 22:45:39] [INFO ] Implicit Places using invariants in 850 ms returned []
[2022-05-17 22:45:39] [INFO ] Flow matrix only has 2274 transitions (discarded 272 similar events)
// Phase 1: matrix 2274 rows 1110 cols
[2022-05-17 22:45:39] [INFO ] Computed 46 place invariants in 22 ms
[2022-05-17 22:45:39] [INFO ] State equation strengthened by 854 read => feed constraints.
[2022-05-17 22:45:48] [INFO ] Implicit Places using invariants and state equation in 9441 ms returned []
Implicit Place search using SMT with State Equation took 10295 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1110/1226 places, 2546/2716 transitions.
Finished structural reductions, in 2 iterations. Remains : 1110/1226 places, 2546/2716 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s670 s712), p0:(LEQ s1074 s860), p1:(LEQ s543 s1038)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2716 reset in 664 ms.
Product exploration explored 100000 steps with 2711 reset in 635 ms.
Computed a total of 295 stabilizing places and 930 stable transitions
Computed a total of 295 stabilizing places and 930 stable transitions
Detected a total of 295/1110 stabilizing places and 930/2546 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (AND p2 p0)), (X (NOT (AND p2 (NOT p0)))), true, (X (X p2)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1725 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p1), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 271 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-17 22:45:52] [INFO ] Flow matrix only has 2274 transitions (discarded 272 similar events)
// Phase 1: matrix 2274 rows 1110 cols
[2022-05-17 22:45:52] [INFO ] Computed 46 place invariants in 22 ms
[2022-05-17 22:45:52] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 22:45:52] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-17 22:45:52] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-17 22:45:53] [INFO ] After 790ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-17 22:45:53] [INFO ] State equation strengthened by 854 read => feed constraints.
[2022-05-17 22:45:53] [INFO ] After 228ms SMT Verify possible using 854 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-05-17 22:45:54] [INFO ] Deduced a trap composed of 95 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:45:54] [INFO ] Deduced a trap composed of 326 places in 392 ms of which 1 ms to minimize.
[2022-05-17 22:45:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 974 ms
[2022-05-17 22:45:55] [INFO ] After 1371ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 138 ms.
[2022-05-17 22:45:55] [INFO ] After 2500ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1110 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1110/1110 places, 2546/2546 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1110 transition count 2545
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1109 transition count 2545
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 1108 transition count 2544
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 1108 transition count 2544
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1107 transition count 2539
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1107 transition count 2539
Free-agglomeration rule (complex) applied 137 times.
Iterating global reduction 2 with 137 rules applied. Total rules applied 143 place count 1107 transition count 3458
Reduce places removed 137 places and 0 transitions.
Iterating post reduction 2 with 137 rules applied. Total rules applied 280 place count 970 transition count 3458
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 283 place count 970 transition count 3458
Applied a total of 283 rules in 340 ms. Remains 970 /1110 variables (removed 140) and now considering 3458/2546 (removed -912) transitions.
Finished structural reductions, in 1 iterations. Remains : 970/1110 places, 3458/2546 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 68776 steps, run timeout after 3021 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68776 steps, saw 28779 distinct states, run finished after 3022 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-17 22:45:58] [INFO ] Flow matrix only has 3060 transitions (discarded 398 similar events)
// Phase 1: matrix 3060 rows 970 cols
[2022-05-17 22:45:58] [INFO ] Computed 46 place invariants in 19 ms
[2022-05-17 22:45:58] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 22:45:59] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-17 22:45:59] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-17 22:45:59] [INFO ] After 756ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 22:45:59] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2022-05-17 22:46:00] [INFO ] After 819ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 22:46:01] [INFO ] Deduced a trap composed of 246 places in 394 ms of which 1 ms to minimize.
[2022-05-17 22:46:01] [INFO ] Deduced a trap composed of 78 places in 443 ms of which 1 ms to minimize.
[2022-05-17 22:46:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1052 ms
[2022-05-17 22:46:01] [INFO ] After 2084ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 161 ms.
[2022-05-17 22:46:02] [INFO ] After 3177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 970 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 970/970 places, 3458/3458 transitions.
Applied a total of 0 rules in 85 ms. Remains 970 /970 variables (removed 0) and now considering 3458/3458 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 970/970 places, 3458/3458 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 970/970 places, 3458/3458 transitions.
Applied a total of 0 rules in 82 ms. Remains 970 /970 variables (removed 0) and now considering 3458/3458 (removed 0) transitions.
[2022-05-17 22:46:02] [INFO ] Flow matrix only has 3060 transitions (discarded 398 similar events)
// Phase 1: matrix 3060 rows 970 cols
[2022-05-17 22:46:02] [INFO ] Computed 46 place invariants in 27 ms
[2022-05-17 22:46:03] [INFO ] Implicit Places using invariants in 969 ms returned [471]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 972 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 969/970 places, 3458/3458 transitions.
Applied a total of 0 rules in 85 ms. Remains 969 /969 variables (removed 0) and now considering 3458/3458 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 969/970 places, 3458/3458 transitions.
Incomplete random walk after 10000 steps, including 339 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 70472 steps, run timeout after 3005 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70472 steps, saw 29481 distinct states, run finished after 3006 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-17 22:46:06] [INFO ] Flow matrix only has 3060 transitions (discarded 398 similar events)
// Phase 1: matrix 3060 rows 969 cols
[2022-05-17 22:46:06] [INFO ] Computed 45 place invariants in 22 ms
[2022-05-17 22:46:06] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 22:46:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-17 22:46:06] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 6 ms returned sat
[2022-05-17 22:46:07] [INFO ] After 933ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 22:46:07] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2022-05-17 22:46:08] [INFO ] After 488ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 22:46:08] [INFO ] Deduced a trap composed of 303 places in 411 ms of which 1 ms to minimize.
[2022-05-17 22:46:09] [INFO ] Deduced a trap composed of 72 places in 456 ms of which 1 ms to minimize.
[2022-05-17 22:46:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1090 ms
[2022-05-17 22:46:09] [INFO ] After 1772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 171 ms.
[2022-05-17 22:46:09] [INFO ] After 3059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 969 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 969/969 places, 3458/3458 transitions.
Applied a total of 0 rules in 79 ms. Remains 969 /969 variables (removed 0) and now considering 3458/3458 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 969/969 places, 3458/3458 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 969/969 places, 3458/3458 transitions.
Applied a total of 0 rules in 99 ms. Remains 969 /969 variables (removed 0) and now considering 3458/3458 (removed 0) transitions.
[2022-05-17 22:46:10] [INFO ] Flow matrix only has 3060 transitions (discarded 398 similar events)
// Phase 1: matrix 3060 rows 969 cols
[2022-05-17 22:46:10] [INFO ] Computed 45 place invariants in 21 ms
[2022-05-17 22:46:10] [INFO ] Implicit Places using invariants in 955 ms returned []
[2022-05-17 22:46:11] [INFO ] Flow matrix only has 3060 transitions (discarded 398 similar events)
// Phase 1: matrix 3060 rows 969 cols
[2022-05-17 22:46:11] [INFO ] Computed 45 place invariants in 16 ms
[2022-05-17 22:46:11] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2022-05-17 22:46:25] [INFO ] Implicit Places using invariants and state equation in 14060 ms returned []
Implicit Place search using SMT with State Equation took 15016 ms to find 0 implicit places.
[2022-05-17 22:46:25] [INFO ] Redundant transitions in 184 ms returned []
[2022-05-17 22:46:25] [INFO ] Flow matrix only has 3060 transitions (discarded 398 similar events)
// Phase 1: matrix 3060 rows 969 cols
[2022-05-17 22:46:25] [INFO ] Computed 45 place invariants in 20 ms
[2022-05-17 22:46:26] [INFO ] Dead Transitions using invariants and state equation in 1168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 969/969 places, 3458/3458 transitions.
Graph (trivial) has 1050 edges and 969 vertex of which 17 / 969 are part of one of the 1 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4019 edges and 953 vertex of which 939 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1195.t1403 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 98 rules applied. Total rules applied 100 place count 922 transition count 2690
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 287 rules applied. Total rules applied 387 place count 826 transition count 2499
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 23 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 262 rules applied. Total rules applied 649 place count 731 transition count 2332
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 863 place count 659 transition count 2190
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1053 place count 589 transition count 2070
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1201 place count 539 transition count 1972
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1329 place count 491 transition count 1892
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1423 place count 459 transition count 1830
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1501 place count 429 transition count 1782
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1553 place count 411 transition count 1748
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1593 place count 395 transition count 1724
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1615 place count 387 transition count 1710
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1629 place count 381 transition count 1702
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1634 place count 379 transition count 1699
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1636 place count 378 transition count 1698
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 12 Pre rules applied. Total rules applied 1636 place count 378 transition count 1686
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 15 with 24 rules applied. Total rules applied 1660 place count 366 transition count 1686
Discarding 280 places :
Symmetric choice reduction at 15 with 280 rule applications. Total rules 1940 place count 86 transition count 354
Iterating global reduction 15 with 280 rules applied. Total rules applied 2220 place count 86 transition count 354
Ensure Unique test removed 221 transitions
Reduce isomorphic transitions removed 221 transitions.
Iterating post reduction 15 with 221 rules applied. Total rules applied 2441 place count 86 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2441 place count 86 transition count 132
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2443 place count 85 transition count 132
Discarding 10 places :
Symmetric choice reduction at 16 with 10 rule applications. Total rules 2453 place count 75 transition count 101
Iterating global reduction 16 with 10 rules applied. Total rules applied 2463 place count 75 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 2466 place count 75 transition count 98
Discarding 9 places :
Symmetric choice reduction at 17 with 9 rule applications. Total rules 2475 place count 66 transition count 89
Iterating global reduction 17 with 9 rules applied. Total rules applied 2484 place count 66 transition count 89
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 17 with 1 rules applied. Total rules applied 2485 place count 66 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 2486 place count 65 transition count 88
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 2487 place count 64 transition count 87
Iterating global reduction 19 with 1 rules applied. Total rules applied 2488 place count 64 transition count 87
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 19 with 12 rules applied. Total rules applied 2500 place count 58 transition count 81
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 2501 place count 57 transition count 77
Iterating global reduction 19 with 1 rules applied. Total rules applied 2502 place count 57 transition count 77
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 19 with 9 rules applied. Total rules applied 2511 place count 57 transition count 68
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 19 with 9 rules applied. Total rules applied 2520 place count 48 transition count 68
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 20 with 7 rules applied. Total rules applied 2527 place count 48 transition count 68
Applied a total of 2527 rules in 285 ms. Remains 48 /969 variables (removed 921) and now considering 68/3458 (removed 3390) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 68 rows 48 cols
[2022-05-17 22:46:26] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 22:46:26] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 22:46:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 22:46:26] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2022-05-17 22:46:26] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 22:46:26] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-17 22:46:26] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-17 22:46:26] [INFO ] Flatten gal took : 7 ms
[2022-05-17 22:46:26] [INFO ] Flatten gal took : 5 ms
[2022-05-17 22:46:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13411519455073334030.gal : 2 ms
[2022-05-17 22:46:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1881260528762160592.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14715825575001482622;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13411519455073334030.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1881260528762160592.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality1881260528762160592.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 18
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :18 after 23
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :23 after 55
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :55 after 103
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :103 after 199
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :199 after 931
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,2808,0.039117,5128,2,1014,11,4252,8,0,249,3713,0
Total reachable state count : 2808

Verifying 2 reachability properties.
Reachability property apf1 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
apf1,1,0.03958,5128,2,49,11,4252,8,0,256,3713,0
Reachability property apf6 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
apf6,91,0.039843,5392,2,199,11,4252,8,0,256,3713,0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (AND p2 p0)), (X (NOT (AND p2 (NOT p0)))), true, (X (X p2)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND p2 (NOT p0))), (F (AND p2 (NOT p1))), (F (NOT p1)), (F (NOT (AND p2 p0)))]
Knowledge based reduction with 18 factoid took 1480 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p1), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p1), (OR (NOT p1) (NOT p2))]
Support contains 6 out of 1110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1110/1110 places, 2546/2546 transitions.
Applied a total of 0 rules in 37 ms. Remains 1110 /1110 variables (removed 0) and now considering 2546/2546 (removed 0) transitions.
[2022-05-17 22:46:28] [INFO ] Flow matrix only has 2274 transitions (discarded 272 similar events)
// Phase 1: matrix 2274 rows 1110 cols
[2022-05-17 22:46:28] [INFO ] Computed 46 place invariants in 23 ms
[2022-05-17 22:46:29] [INFO ] Implicit Places using invariants in 857 ms returned []
[2022-05-17 22:46:29] [INFO ] Flow matrix only has 2274 transitions (discarded 272 similar events)
// Phase 1: matrix 2274 rows 1110 cols
[2022-05-17 22:46:29] [INFO ] Computed 46 place invariants in 16 ms
[2022-05-17 22:46:30] [INFO ] State equation strengthened by 854 read => feed constraints.
[2022-05-17 22:46:39] [INFO ] Implicit Places using invariants and state equation in 9564 ms returned []
Implicit Place search using SMT with State Equation took 10423 ms to find 0 implicit places.
[2022-05-17 22:46:39] [INFO ] Flow matrix only has 2274 transitions (discarded 272 similar events)
// Phase 1: matrix 2274 rows 1110 cols
[2022-05-17 22:46:39] [INFO ] Computed 46 place invariants in 23 ms
[2022-05-17 22:46:40] [INFO ] Dead Transitions using invariants and state equation in 958 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1110/1110 places, 2546/2546 transitions.
Computed a total of 295 stabilizing places and 930 stable transitions
Computed a total of 295 stabilizing places and 930 stable transitions
Detected a total of 295/1110 stabilizing places and 930/2546 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p1), (X (AND p0 p2)), (X p0), (X (NOT (AND (NOT p1) p2))), (X (X p2)), true, (X (X p1)), (X (X (AND p0 p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 510 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p1), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 271 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-17 22:46:41] [INFO ] Flow matrix only has 2274 transitions (discarded 272 similar events)
// Phase 1: matrix 2274 rows 1110 cols
[2022-05-17 22:46:41] [INFO ] Computed 46 place invariants in 25 ms
[2022-05-17 22:46:41] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 22:46:41] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2022-05-17 22:46:41] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-17 22:46:42] [INFO ] After 850ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 22:46:42] [INFO ] State equation strengthened by 854 read => feed constraints.
[2022-05-17 22:46:42] [INFO ] After 334ms SMT Verify possible using 854 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-17 22:46:43] [INFO ] Deduced a trap composed of 319 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:46:43] [INFO ] Deduced a trap composed of 121 places in 414 ms of which 1 ms to minimize.
[2022-05-17 22:46:44] [INFO ] Deduced a trap composed of 96 places in 410 ms of which 1 ms to minimize.
[2022-05-17 22:46:44] [INFO ] Deduced a trap composed of 124 places in 412 ms of which 1 ms to minimize.
[2022-05-17 22:46:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1947 ms
[2022-05-17 22:46:44] [INFO ] After 2579ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 218 ms.
[2022-05-17 22:46:45] [INFO ] After 3858ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1110 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1110/1110 places, 2546/2546 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1110 transition count 2544
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1108 transition count 2544
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1107 transition count 2543
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1107 transition count 2543
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 1106 transition count 2538
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 1106 transition count 2538
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 1105 transition count 2537
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 1104 transition count 2536
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 1104 transition count 2536
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 1103 transition count 2531
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 1103 transition count 2531
Free-agglomeration rule (complex) applied 136 times.
Iterating global reduction 2 with 136 rules applied. Total rules applied 150 place count 1103 transition count 3455
Reduce places removed 136 places and 0 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 286 place count 967 transition count 3455
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 289 place count 967 transition count 3455
Applied a total of 289 rules in 443 ms. Remains 967 /1110 variables (removed 143) and now considering 3455/2546 (removed -909) transitions.
Finished structural reductions, in 1 iterations. Remains : 967/1110 places, 3455/2546 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 65621 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 65621 steps, saw 27482 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :2
Running SMT prover for 1 properties.
[2022-05-17 22:46:49] [INFO ] Flow matrix only has 3057 transitions (discarded 398 similar events)
// Phase 1: matrix 3057 rows 967 cols
[2022-05-17 22:46:49] [INFO ] Computed 46 place invariants in 23 ms
[2022-05-17 22:46:49] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 22:46:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-17 22:46:49] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-17 22:46:49] [INFO ] After 702ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 22:46:50] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2022-05-17 22:46:50] [INFO ] After 337ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 22:46:50] [INFO ] Deduced a trap composed of 301 places in 403 ms of which 1 ms to minimize.
[2022-05-17 22:46:51] [INFO ] Deduced a trap composed of 83 places in 437 ms of which 2 ms to minimize.
[2022-05-17 22:46:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1062 ms
[2022-05-17 22:46:51] [INFO ] After 1463ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2022-05-17 22:46:51] [INFO ] After 2421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 967 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 967/967 places, 3455/3455 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 967 transition count 3454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 966 transition count 3454
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 966 transition count 3454
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 965 transition count 3453
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 965 transition count 3453
Applied a total of 5 rules in 187 ms. Remains 965 /967 variables (removed 2) and now considering 3453/3455 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 965/967 places, 3453/3455 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 75270 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75270 steps, saw 31446 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 22:46:54] [INFO ] Flow matrix only has 3055 transitions (discarded 398 similar events)
// Phase 1: matrix 3055 rows 965 cols
[2022-05-17 22:46:54] [INFO ] Computed 46 place invariants in 36 ms
[2022-05-17 22:46:55] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 22:46:55] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-17 22:46:55] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-17 22:46:55] [INFO ] After 768ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 22:46:55] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2022-05-17 22:46:56] [INFO ] After 307ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 22:46:56] [INFO ] After 436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 112 ms.
[2022-05-17 22:46:56] [INFO ] After 1461ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 965 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 965/965 places, 3453/3453 transitions.
Applied a total of 0 rules in 79 ms. Remains 965 /965 variables (removed 0) and now considering 3453/3453 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 965/965 places, 3453/3453 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 965/965 places, 3453/3453 transitions.
Applied a total of 0 rules in 85 ms. Remains 965 /965 variables (removed 0) and now considering 3453/3453 (removed 0) transitions.
[2022-05-17 22:46:56] [INFO ] Flow matrix only has 3055 transitions (discarded 398 similar events)
// Phase 1: matrix 3055 rows 965 cols
[2022-05-17 22:46:56] [INFO ] Computed 46 place invariants in 36 ms
[2022-05-17 22:46:57] [INFO ] Implicit Places using invariants in 971 ms returned [471, 727]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 973 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 963/965 places, 3453/3453 transitions.
Applied a total of 0 rules in 86 ms. Remains 963 /963 variables (removed 0) and now considering 3453/3453 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 963/965 places, 3453/3453 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 75189 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75189 steps, saw 31424 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 22:47:00] [INFO ] Flow matrix only has 3055 transitions (discarded 398 similar events)
// Phase 1: matrix 3055 rows 963 cols
[2022-05-17 22:47:00] [INFO ] Computed 44 place invariants in 27 ms
[2022-05-17 22:47:01] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 22:47:01] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-05-17 22:47:01] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 3 ms returned sat
[2022-05-17 22:47:01] [INFO ] After 663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 22:47:01] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2022-05-17 22:47:02] [INFO ] After 360ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 22:47:02] [INFO ] Deduced a trap composed of 125 places in 452 ms of which 0 ms to minimize.
[2022-05-17 22:47:03] [INFO ] Deduced a trap composed of 250 places in 383 ms of which 0 ms to minimize.
[2022-05-17 22:47:03] [INFO ] Deduced a trap composed of 65 places in 431 ms of which 1 ms to minimize.
[2022-05-17 22:47:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1547 ms
[2022-05-17 22:47:03] [INFO ] After 1987ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-05-17 22:47:03] [INFO ] After 2877ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 963 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 963/963 places, 3453/3453 transitions.
Applied a total of 0 rules in 80 ms. Remains 963 /963 variables (removed 0) and now considering 3453/3453 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 963/963 places, 3453/3453 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 963/963 places, 3453/3453 transitions.
Applied a total of 0 rules in 74 ms. Remains 963 /963 variables (removed 0) and now considering 3453/3453 (removed 0) transitions.
[2022-05-17 22:47:04] [INFO ] Flow matrix only has 3055 transitions (discarded 398 similar events)
// Phase 1: matrix 3055 rows 963 cols
[2022-05-17 22:47:04] [INFO ] Computed 44 place invariants in 31 ms
[2022-05-17 22:47:05] [INFO ] Implicit Places using invariants in 990 ms returned []
[2022-05-17 22:47:05] [INFO ] Flow matrix only has 3055 transitions (discarded 398 similar events)
// Phase 1: matrix 3055 rows 963 cols
[2022-05-17 22:47:05] [INFO ] Computed 44 place invariants in 24 ms
[2022-05-17 22:47:05] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2022-05-17 22:47:20] [INFO ] Implicit Places using invariants and state equation in 15338 ms returned []
Implicit Place search using SMT with State Equation took 16328 ms to find 0 implicit places.
[2022-05-17 22:47:20] [INFO ] Redundant transitions in 137 ms returned []
[2022-05-17 22:47:20] [INFO ] Flow matrix only has 3055 transitions (discarded 398 similar events)
// Phase 1: matrix 3055 rows 963 cols
[2022-05-17 22:47:20] [INFO ] Computed 44 place invariants in 31 ms
[2022-05-17 22:47:21] [INFO ] Dead Transitions using invariants and state equation in 1167 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 963/963 places, 3453/3453 transitions.
Graph (trivial) has 1049 edges and 963 vertex of which 17 / 963 are part of one of the 1 SCC in 1 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4000 edges and 947 vertex of which 933 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1195.t1403 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 98 rules applied. Total rules applied 100 place count 916 transition count 2685
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 287 rules applied. Total rules applied 387 place count 820 transition count 2494
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 23 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 262 rules applied. Total rules applied 649 place count 725 transition count 2327
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 863 place count 653 transition count 2185
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1053 place count 583 transition count 2065
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1201 place count 533 transition count 1967
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1329 place count 485 transition count 1887
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1423 place count 453 transition count 1825
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1501 place count 423 transition count 1777
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1553 place count 405 transition count 1743
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1593 place count 389 transition count 1719
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1615 place count 381 transition count 1705
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1629 place count 375 transition count 1697
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1634 place count 373 transition count 1694
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1636 place count 372 transition count 1693
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 12 Pre rules applied. Total rules applied 1636 place count 372 transition count 1681
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 15 with 24 rules applied. Total rules applied 1660 place count 360 transition count 1681
Discarding 283 places :
Symmetric choice reduction at 15 with 283 rule applications. Total rules 1943 place count 77 transition count 338
Iterating global reduction 15 with 283 rules applied. Total rules applied 2226 place count 77 transition count 338
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Iterating post reduction 15 with 229 rules applied. Total rules applied 2455 place count 77 transition count 109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2455 place count 77 transition count 108
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2457 place count 76 transition count 108
Discarding 12 places :
Symmetric choice reduction at 16 with 12 rule applications. Total rules 2469 place count 64 transition count 73
Iterating global reduction 16 with 12 rules applied. Total rules applied 2481 place count 64 transition count 73
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 16 with 7 rules applied. Total rules applied 2488 place count 64 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2489 place count 63 transition count 66
Discarding 10 places :
Symmetric choice reduction at 18 with 10 rule applications. Total rules 2499 place count 53 transition count 56
Iterating global reduction 18 with 10 rules applied. Total rules applied 2509 place count 53 transition count 56
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 18 with 1 rules applied. Total rules applied 2510 place count 53 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 2511 place count 52 transition count 55
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 2512 place count 51 transition count 54
Iterating global reduction 20 with 1 rules applied. Total rules applied 2513 place count 51 transition count 54
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 20 with 6 rules applied. Total rules applied 2519 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 2520 place count 47 transition count 49
Iterating global reduction 20 with 1 rules applied. Total rules applied 2521 place count 47 transition count 49
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 20 with 9 rules applied. Total rules applied 2530 place count 47 transition count 40
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 20 with 9 rules applied. Total rules applied 2539 place count 38 transition count 40
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 2540 place count 38 transition count 40
Applied a total of 2540 rules in 277 ms. Remains 38 /963 variables (removed 925) and now considering 40/3453 (removed 3413) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 40 rows 38 cols
[2022-05-17 22:47:22] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 22:47:22] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 22:47:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 22:47:22] [INFO ] [Nat]Absence check using 3 positive and 11 generalized place invariants in 2 ms returned sat
[2022-05-17 22:47:22] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 22:47:22] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 22:47:22] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 22:47:22] [INFO ] Flatten gal took : 3 ms
[2022-05-17 22:47:22] [INFO ] Flatten gal took : 3 ms
[2022-05-17 22:47:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2552981552131232243.gal : 1 ms
[2022-05-17 22:47:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18020130169046164130.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1167736493901485600;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2552981552131232243.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18020130169046164130.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality18020130169046164130.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :11 after 23
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :23 after 47
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :47 after 98
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :98 after 437
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,913,0.022896,4104,2,535,10,1947,7,0,180,1377,0
Total reachable state count : 913

Verifying 1 reachability properties.
Reachability property apf1 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
apf1,57,0.023245,4544,2,158,10,1947,7,0,184,1377,0
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p1), (X (AND p0 p2)), (X p0), (X (NOT (AND (NOT p1) p2))), (X (X p2)), true, (X (X p1)), (X (X (AND p0 p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (AND p2 p0))), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 13 factoid took 815 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p1), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p1), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p1), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2715 reset in 543 ms.
Product exploration explored 100000 steps with 2714 reset in 556 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p1), (OR (NOT p1) (NOT p2))]
Support contains 6 out of 1110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1110/1110 places, 2546/2546 transitions.
Applied a total of 0 rules in 149 ms. Remains 1110 /1110 variables (removed 0) and now considering 2546/2546 (removed 0) transitions.
[2022-05-17 22:47:24] [INFO ] Redundant transitions in 82 ms returned []
[2022-05-17 22:47:24] [INFO ] Flow matrix only has 2274 transitions (discarded 272 similar events)
// Phase 1: matrix 2274 rows 1110 cols
[2022-05-17 22:47:24] [INFO ] Computed 46 place invariants in 16 ms
[2022-05-17 22:47:25] [INFO ] Dead Transitions using invariants and state equation in 976 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1110/1110 places, 2546/2546 transitions.
Product exploration explored 100000 steps with 2716 reset in 556 ms.
Product exploration explored 100000 steps with 2713 reset in 596 ms.
Built C files in :
/tmp/ltsmin2861715019483288288
[2022-05-17 22:47:27] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2861715019483288288
Running compilation step : cd /tmp/ltsmin2861715019483288288;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2861715019483288288;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2861715019483288288;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 6 out of 1110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1110/1110 places, 2546/2546 transitions.
Applied a total of 0 rules in 31 ms. Remains 1110 /1110 variables (removed 0) and now considering 2546/2546 (removed 0) transitions.
[2022-05-17 22:47:30] [INFO ] Flow matrix only has 2274 transitions (discarded 272 similar events)
// Phase 1: matrix 2274 rows 1110 cols
[2022-05-17 22:47:30] [INFO ] Computed 46 place invariants in 16 ms
[2022-05-17 22:47:31] [INFO ] Implicit Places using invariants in 849 ms returned []
[2022-05-17 22:47:31] [INFO ] Flow matrix only has 2274 transitions (discarded 272 similar events)
// Phase 1: matrix 2274 rows 1110 cols
[2022-05-17 22:47:31] [INFO ] Computed 46 place invariants in 37 ms
[2022-05-17 22:47:31] [INFO ] State equation strengthened by 854 read => feed constraints.
[2022-05-17 22:47:40] [INFO ] Implicit Places using invariants and state equation in 9618 ms returned []
Implicit Place search using SMT with State Equation took 10470 ms to find 0 implicit places.
[2022-05-17 22:47:40] [INFO ] Flow matrix only has 2274 transitions (discarded 272 similar events)
// Phase 1: matrix 2274 rows 1110 cols
[2022-05-17 22:47:40] [INFO ] Computed 46 place invariants in 16 ms
[2022-05-17 22:47:41] [INFO ] Dead Transitions using invariants and state equation in 947 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1110/1110 places, 2546/2546 transitions.
Built C files in :
/tmp/ltsmin5265251576962306855
[2022-05-17 22:47:42] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5265251576962306855
Running compilation step : cd /tmp/ltsmin5265251576962306855;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5265251576962306855;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5265251576962306855;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 22:47:45] [INFO ] Flatten gal took : 82 ms
[2022-05-17 22:47:45] [INFO ] Flatten gal took : 86 ms
[2022-05-17 22:47:45] [INFO ] Time to serialize gal into /tmp/LTL12166214422566734100.gal : 17 ms
[2022-05-17 22:47:45] [INFO ] Time to serialize properties into /tmp/LTL10383394363010147220.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12166214422566734100.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10383394363010147220.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1216621...268
Read 1 LTL properties
Checking formula 0 : !((("(LeafSetOfLx2IsSentToNode16<=Node15HasTheLeafSetOfLx2ToReplaceNode5)")U(G((F("(Node8HasTheLeafSetOfRx3ToReplaceNode11<=Node16Thin...302
Formula 0 simplified : !("(LeafSetOfLx2IsSentToNode16<=Node15HasTheLeafSetOfLx2ToReplaceNode5)" U G("(Node12ThinksNode11ShouldBeNodeMasterToReplaceNode10<=...295
Detected timeout of ITS tools.
[2022-05-17 22:48:00] [INFO ] Flatten gal took : 66 ms
[2022-05-17 22:48:00] [INFO ] Applying decomposition
[2022-05-17 22:48:00] [INFO ] Flatten gal took : 67 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16644968766397539886.txt' '-o' '/tmp/graph16644968766397539886.bin' '-w' '/tmp/graph16644968766397539886.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16644968766397539886.bin' '-l' '-1' '-v' '-w' '/tmp/graph16644968766397539886.weights' '-q' '0' '-e' '0.001'
[2022-05-17 22:48:00] [INFO ] Decomposing Gal with order
[2022-05-17 22:48:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 22:48:00] [INFO ] Removed a total of 86 redundant transitions.
[2022-05-17 22:48:01] [INFO ] Flatten gal took : 149 ms
[2022-05-17 22:48:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 9 ms.
[2022-05-17 22:48:01] [INFO ] Time to serialize gal into /tmp/LTL17002166673640553273.gal : 11 ms
[2022-05-17 22:48:01] [INFO ] Time to serialize properties into /tmp/LTL18188184622121346460.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17002166673640553273.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18188184622121346460.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1700216...268
Read 1 LTL properties
Checking formula 0 : !((("(gu13.LeafSetOfLx2IsSentToNode16<=gu13.Node15HasTheLeafSetOfLx2ToReplaceNode5)")U(G((F("(gu8.Node8HasTheLeafSetOfRx3ToReplaceNode...328
Formula 0 simplified : !("(gu13.LeafSetOfLx2IsSentToNode16<=gu13.Node15HasTheLeafSetOfLx2ToReplaceNode5)" U G("(gu9.Node12ThinksNode11ShouldBeNodeMasterToR...321
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8453844717019810435
[2022-05-17 22:48:16] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8453844717019810435
Running compilation step : cd /tmp/ltsmin8453844717019810435;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8453844717019810435;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8453844717019810435;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-13 finished in 162400 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((F(p1)&&p2))))'
[2022-05-17 22:48:19] [INFO ] Flatten gal took : 79 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12155671956469693240
[2022-05-17 22:48:19] [INFO ] Too many transitions (2716) to apply POR reductions. Disabling POR matrices.
[2022-05-17 22:48:19] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12155671956469693240
Running compilation step : cd /tmp/ltsmin12155671956469693240;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-17 22:48:19] [INFO ] Applying decomposition
[2022-05-17 22:48:19] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3110375945616451789.txt' '-o' '/tmp/graph3110375945616451789.bin' '-w' '/tmp/graph3110375945616451789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3110375945616451789.bin' '-l' '-1' '-v' '-w' '/tmp/graph3110375945616451789.weights' '-q' '0' '-e' '0.001'
[2022-05-17 22:48:19] [INFO ] Decomposing Gal with order
[2022-05-17 22:48:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 22:48:20] [INFO ] Removed a total of 1894 redundant transitions.
[2022-05-17 22:48:20] [INFO ] Flatten gal took : 323 ms
[2022-05-17 22:48:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 61 ms.
[2022-05-17 22:48:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality8282185285801651616.gal : 15 ms
[2022-05-17 22:48:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality11166708684520303879.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8282185285801651616.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11166708684520303879.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((("(gu130.LeafSetOfLx2IsSentToNode16<=gu130.Node15HasTheLeafSetOfLx2ToReplaceNode5)")U(G((F("(gu156.Node8HasTheLeafSetOfRx3ToReplace...338
Formula 0 simplified : !("(gu130.LeafSetOfLx2IsSentToNode16<=gu130.Node15HasTheLeafSetOfLx2ToReplaceNode5)" U G("(gu106.Node12ThinksNode11ShouldBeNodeMaste...331
Compilation finished in 5929 ms.
Running link step : cd /tmp/ltsmin12155671956469693240;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin12155671956469693240;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((LTLAPp0==true) U []((<>((LTLAPp1==true))&&(LTLAPp2==true))))' '--buchi-type=spotba'
LTSmin run took 382896 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 656184 ms.

BK_STOP 1652828088797

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="MultiCrashLeafsetExtension-PT-S16C05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271821200675"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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