MCC'2023- Execution of r233-tall-167856419400763

About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S16C04

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1078.607	349155.00	412924.00	1071.70	TTFTF?TTFF?F?FTF	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 11K Feb 26 02:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 02:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 02:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 02:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 26 02:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 02:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.1M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679604720842

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 20:52:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 20:52:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 20:52:02] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2023-03-23 20:52:02] [INFO ] Transformed 4260 places.
[2023-03-23 20:52:02] [INFO ] Transformed 6027 transitions.
[2023-03-23 20:52:02] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 338 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 4260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 4233 transition count 6027
Discarding 1076 places :
Symmetric choice reduction at 1 with 1076 rule applications. Total rules 1103 place count 3157 transition count 4951
Iterating global reduction 1 with 1076 rules applied. Total rules applied 2179 place count 3157 transition count 4951
Discarding 936 places :
Symmetric choice reduction at 1 with 936 rule applications. Total rules 3115 place count 2221 transition count 4015
Iterating global reduction 1 with 936 rules applied. Total rules applied 4051 place count 2221 transition count 4015
Discarding 219 places :
Symmetric choice reduction at 1 with 219 rule applications. Total rules 4270 place count 2002 transition count 3139
Iterating global reduction 1 with 219 rules applied. Total rules applied 4489 place count 2002 transition count 3139
Applied a total of 4489 rules in 922 ms. Remains 2002 /4260 variables (removed 2258) and now considering 3139/6027 (removed 2888) transitions.
[2023-03-23 20:52:03] [INFO ] Flow matrix only has 2867 transitions (discarded 272 similar events)
// Phase 1: matrix 2867 rows 2002 cols
[2023-03-23 20:52:04] [INFO ] Computed 470 place invariants in 151 ms
[2023-03-23 20:52:06] [INFO ] Implicit Places using invariants in 2293 ms returned [4, 8, 12, 14, 16, 18, 20, 32, 41, 52, 65, 80, 96, 112, 114, 118, 120, 133, 144, 155, 162, 167, 170, 192, 199, 202, 203, 204, 205, 206, 209, 214, 221, 230, 241, 254, 268, 282, 283, 284, 285, 286, 297, 306, 313, 318, 321, 323, 342, 349, 352, 353, 354, 355, 356, 358, 361, 366, 373, 382, 393, 405, 417, 418, 419, 420, 421, 430, 437, 442, 445, 447, 449, 468, 475, 479, 480, 481, 482, 484, 486, 489, 494, 501, 510, 522, 532, 533, 534, 535, 536, 543, 548, 551, 553, 555, 557, 584, 587, 588, 589, 590, 591, 593, 595, 597, 600, 605, 612, 620, 628, 629, 630, 631, 632, 637, 640, 642, 644, 646, 667, 674, 677, 678, 679, 680, 681, 683, 685, 688, 693, 698, 704, 711, 712, 713, 714, 719, 721, 723, 725, 729, 731, 750, 757, 760, 761, 762, 764, 768, 770, 772, 774, 776, 782, 786, 790, 791, 792, 793, 794, 796, 798, 800, 802, 804, 806, 825, 832, 835, 836, 837, 838, 839, 841, 843, 845, 847, 849, 851, 853, 856, 857, 858, 859, 860, 862, 864, 866, 868, 870, 872, 891, 893, 897, 901, 902, 903, 904, 906, 908, 910, 912, 914, 917, 921, 924, 925, 926, 927, 928, 930, 932, 934, 936, 938, 940, 959, 966, 969, 970, 971, 972, 973, 975, 977, 979, 981, 983, 985, 987, 990, 992, 993, 994, 996, 1000, 1002, 1004, 1006, 1008, 1027, 1034, 1037, 1038, 1039, 1040, 1041, 1043, 1045, 1047, 1049, 1051, 1053, 1056, 1061, 1062, 1063, 1064, 1065, 1068, 1070, 1072, 1074, 1076, 1078, 1097, 1104, 1107, 1108, 1109, 1110, 1111, 1113, 1115, 1117, 1119, 1121, 1124, 1129, 1136, 1138, 1140, 1145, 1148, 1153, 1155, 1159, 1161, 1180, 1187, 1190, 1191, 1192, 1193, 1194, 1196, 1198, 1200, 1202, 1205, 1210, 1217, 1226, 1227, 1228, 1229, 1230, 1237, 1242, 1245, 1247, 1249, 1251, 1270, 1277, 1280, 1281, 1282, 1283, 1284, 1286, 1288, 1290, 1293, 1298, 1305, 1314, 1327, 1328, 1329, 1341, 1350, 1356, 1361, 1363, 1365, 1384, 1391, 1394, 1395, 1396, 1397, 1398, 1400, 1402, 1405, 1410, 1417, 1426, 1437, 1450, 1451, 1452, 1453, 1454, 1465, 1474, 1481, 1486, 1489, 1491, 1510, 1517, 1521, 1523, 1524, 1528, 1533, 1538, 1545, 1554, 1565, 1578, 1593, 1594, 1595, 1596, 1597, 1610, 1621, 1630, 1637, 1642, 1645, 1664, 1666, 1670, 1673, 1674, 1675, 1676, 1677, 1680, 1685, 1692, 1701, 1712, 1725, 1740, 1757, 1758, 1759, 1760, 1761, 1776, 1789, 1800, 1809, 1816, 1821, 1841]
Discarding 412 places :
Implicit Place search using SMT only with invariants took 2327 ms to find 412 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1590/4260 places, 3139/6027 transitions.
Discarding 114 places :
Symmetric choice reduction at 0 with 114 rule applications. Total rules 114 place count 1476 transition count 3025
Iterating global reduction 0 with 114 rules applied. Total rules applied 228 place count 1476 transition count 3025
Discarding 110 places :
Symmetric choice reduction at 0 with 110 rule applications. Total rules 338 place count 1366 transition count 2915
Iterating global reduction 0 with 110 rules applied. Total rules applied 448 place count 1366 transition count 2915
Discarding 110 places :
Symmetric choice reduction at 0 with 110 rule applications. Total rules 558 place count 1256 transition count 2805
Iterating global reduction 0 with 110 rules applied. Total rules applied 668 place count 1256 transition count 2805
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 687 place count 1237 transition count 2729
Iterating global reduction 0 with 19 rules applied. Total rules applied 706 place count 1237 transition count 2729
Applied a total of 706 rules in 179 ms. Remains 1237 /1590 variables (removed 353) and now considering 2729/3139 (removed 410) transitions.
[2023-03-23 20:52:06] [INFO ] Flow matrix only has 2457 transitions (discarded 272 similar events)
// Phase 1: matrix 2457 rows 1237 cols
[2023-03-23 20:52:06] [INFO ] Computed 58 place invariants in 59 ms
[2023-03-23 20:52:07] [INFO ] Implicit Places using invariants in 1048 ms returned [18, 435]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1051 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1235/4260 places, 2729/6027 transitions.
Applied a total of 0 rules in 43 ms. Remains 1235 /1235 variables (removed 0) and now considering 2729/2729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 4524 ms. Remains : 1235/4260 places, 2729/6027 transitions.
Support contains 41 out of 1235 places after structural reductions.
[2023-03-23 20:52:07] [INFO ] Flatten gal took : 204 ms
[2023-03-23 20:52:08] [INFO ] Flatten gal took : 127 ms
[2023-03-23 20:52:08] [INFO ] Input system was already deterministic with 2729 transitions.
Incomplete random walk after 10000 steps, including 239 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 26) seen :13
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-23 20:52:09] [INFO ] Flow matrix only has 2457 transitions (discarded 272 similar events)
// Phase 1: matrix 2457 rows 1235 cols
[2023-03-23 20:52:09] [INFO ] Computed 56 place invariants in 25 ms
[2023-03-23 20:52:10] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-23 20:52:10] [INFO ] [Nat]Absence check using 32 positive place invariants in 24 ms returned sat
[2023-03-23 20:52:10] [INFO ] [Nat]Absence check using 32 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-23 20:52:12] [INFO ] After 1342ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :5
[2023-03-23 20:52:12] [INFO ] State equation strengthened by 920 read => feed constraints.
[2023-03-23 20:52:13] [INFO ] After 1294ms SMT Verify possible using 920 Read/Feed constraints in natural domain returned unsat :8 sat :3
[2023-03-23 20:52:14] [INFO ] Deduced a trap composed of 325 places in 715 ms of which 16 ms to minimize.
[2023-03-23 20:52:15] [INFO ] Deduced a trap composed of 205 places in 679 ms of which 1 ms to minimize.
[2023-03-23 20:52:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1611 ms
[2023-03-23 20:52:15] [INFO ] After 3375ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :3
Attempting to minimize the solution found.
Minimization took 315 ms.
[2023-03-23 20:52:15] [INFO ] After 5655ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :3
Fused 11 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 1235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1235/1235 places, 2729/2729 transitions.
Graph (complete) has 5698 edges and 1235 vertex of which 1234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 1234 transition count 2718
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 1223 transition count 2718
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 23 place count 1223 transition count 2699
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 61 place count 1204 transition count 2699
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 79 place count 1186 transition count 2672
Iterating global reduction 2 with 18 rules applied. Total rules applied 97 place count 1186 transition count 2672
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 97 place count 1186 transition count 2670
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 101 place count 1184 transition count 2670
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 116 place count 1169 transition count 2625
Iterating global reduction 2 with 15 rules applied. Total rules applied 131 place count 1169 transition count 2625
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 134 place count 1166 transition count 2613
Iterating global reduction 2 with 3 rules applied. Total rules applied 137 place count 1166 transition count 2613
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 4 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 191 place count 1139 transition count 2586
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 195 place count 1135 transition count 2582
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 1135 transition count 2582
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 203 place count 1131 transition count 2566
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 1131 transition count 2566
Free-agglomeration rule (complex) applied 142 times.
Iterating global reduction 2 with 142 rules applied. Total rules applied 349 place count 1131 transition count 3198
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 2 with 142 rules applied. Total rules applied 491 place count 989 transition count 3198
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 499 place count 989 transition count 3198
Applied a total of 499 rules in 874 ms. Remains 989 /1235 variables (removed 246) and now considering 3198/2729 (removed -469) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 876 ms. Remains : 989/1235 places, 3198/2729 transitions.
Incomplete random walk after 10000 steps, including 425 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 67558 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{0=1}
Probabilistic random walk after 67558 steps, saw 28436 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :1
Running SMT prover for 2 properties.
[2023-03-23 20:52:20] [INFO ] Flow matrix only has 2801 transitions (discarded 397 similar events)
// Phase 1: matrix 2801 rows 989 cols
[2023-03-23 20:52:20] [INFO ] Computed 55 place invariants in 29 ms
[2023-03-23 20:52:20] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 20:52:20] [INFO ] [Nat]Absence check using 32 positive place invariants in 20 ms returned sat
[2023-03-23 20:52:20] [INFO ] [Nat]Absence check using 32 positive and 23 generalized place invariants in 4 ms returned sat
[2023-03-23 20:52:21] [INFO ] After 800ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 20:52:21] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 20:52:22] [INFO ] After 723ms SMT Verify possible using 1634 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 20:52:22] [INFO ] Deduced a trap composed of 151 places in 453 ms of which 2 ms to minimize.
[2023-03-23 20:52:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 589 ms
[2023-03-23 20:52:23] [INFO ] After 1731ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 382 ms.
[2023-03-23 20:52:23] [INFO ] After 3118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 989 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 989/989 places, 3198/3198 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 989 transition count 3198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 987 transition count 3196
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 987 transition count 3196
Applied a total of 6 rules in 304 ms. Remains 987 /989 variables (removed 2) and now considering 3196/3198 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 309 ms. Remains : 987/989 places, 3196/3198 transitions.
Incomplete random walk after 10000 steps, including 425 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 70373 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70373 steps, saw 29613 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 20:52:27] [INFO ] Flow matrix only has 2799 transitions (discarded 397 similar events)
// Phase 1: matrix 2799 rows 987 cols
[2023-03-23 20:52:27] [INFO ] Computed 55 place invariants in 43 ms
[2023-03-23 20:52:27] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 20:52:27] [INFO ] [Nat]Absence check using 32 positive place invariants in 20 ms returned sat
[2023-03-23 20:52:27] [INFO ] [Nat]Absence check using 32 positive and 23 generalized place invariants in 4 ms returned sat
[2023-03-23 20:52:28] [INFO ] After 934ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 20:52:28] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 20:52:29] [INFO ] After 934ms SMT Verify possible using 1634 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 20:52:29] [INFO ] Deduced a trap composed of 187 places in 470 ms of which 1 ms to minimize.
[2023-03-23 20:52:30] [INFO ] Deduced a trap composed of 64 places in 546 ms of which 1 ms to minimize.
[2023-03-23 20:52:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1231 ms
[2023-03-23 20:52:30] [INFO ] After 2468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 262 ms.
[2023-03-23 20:52:31] [INFO ] After 3894ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 987 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 987/987 places, 3196/3196 transitions.
Applied a total of 0 rules in 119 ms. Remains 987 /987 variables (removed 0) and now considering 3196/3196 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 987/987 places, 3196/3196 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 987/987 places, 3196/3196 transitions.
Applied a total of 0 rules in 120 ms. Remains 987 /987 variables (removed 0) and now considering 3196/3196 (removed 0) transitions.
[2023-03-23 20:52:31] [INFO ] Flow matrix only has 2799 transitions (discarded 397 similar events)
[2023-03-23 20:52:31] [INFO ] Invariant cache hit.
[2023-03-23 20:52:32] [INFO ] Implicit Places using invariants in 1113 ms returned [82, 302, 388, 401, 413, 429, 474, 505, 557, 558, 644, 645, 745, 746]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1133 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 973/987 places, 3196/3196 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 965 transition count 3188
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 965 transition count 3188
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 957 transition count 3180
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 957 transition count 3180
Applied a total of 32 rules in 161 ms. Remains 957 /973 variables (removed 16) and now considering 3180/3196 (removed 16) transitions.
[2023-03-23 20:52:32] [INFO ] Flow matrix only has 2783 transitions (discarded 397 similar events)
// Phase 1: matrix 2783 rows 957 cols
[2023-03-23 20:52:32] [INFO ] Computed 41 place invariants in 21 ms
[2023-03-23 20:52:33] [INFO ] Implicit Places using invariants in 1073 ms returned []
[2023-03-23 20:52:33] [INFO ] Flow matrix only has 2783 transitions (discarded 397 similar events)
[2023-03-23 20:52:33] [INFO ] Invariant cache hit.
[2023-03-23 20:52:34] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 20:52:50] [INFO ] Implicit Places using invariants and state equation in 16783 ms returned []
Implicit Place search using SMT with State Equation took 17885 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 957/987 places, 3180/3196 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 19299 ms. Remains : 957/987 places, 3180/3196 transitions.
Incomplete random walk after 10000 steps, including 424 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 73865 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73865 steps, saw 30850 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 20:52:53] [INFO ] Flow matrix only has 2783 transitions (discarded 397 similar events)
[2023-03-23 20:52:53] [INFO ] Invariant cache hit.
[2023-03-23 20:52:53] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 20:52:54] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-23 20:52:54] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-23 20:52:54] [INFO ] After 788ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 20:52:54] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 20:52:56] [INFO ] After 1302ms SMT Verify possible using 1634 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 20:52:56] [INFO ] Deduced a trap composed of 206 places in 431 ms of which 1 ms to minimize.
[2023-03-23 20:52:57] [INFO ] Deduced a trap composed of 81 places in 478 ms of which 1 ms to minimize.
[2023-03-23 20:52:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1116 ms
[2023-03-23 20:52:58] [INFO ] Deduced a trap composed of 79 places in 471 ms of which 1 ms to minimize.
[2023-03-23 20:52:58] [INFO ] Deduced a trap composed of 73 places in 470 ms of which 1 ms to minimize.
[2023-03-23 20:52:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1142 ms
[2023-03-23 20:52:58] [INFO ] After 3817ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 271 ms.
[2023-03-23 20:52:59] [INFO ] After 5077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 957 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 957/957 places, 3180/3180 transitions.
Applied a total of 0 rules in 76 ms. Remains 957 /957 variables (removed 0) and now considering 3180/3180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 957/957 places, 3180/3180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 957/957 places, 3180/3180 transitions.
Applied a total of 0 rules in 76 ms. Remains 957 /957 variables (removed 0) and now considering 3180/3180 (removed 0) transitions.
[2023-03-23 20:52:59] [INFO ] Flow matrix only has 2783 transitions (discarded 397 similar events)
[2023-03-23 20:52:59] [INFO ] Invariant cache hit.
[2023-03-23 20:53:00] [INFO ] Implicit Places using invariants in 1014 ms returned []
[2023-03-23 20:53:00] [INFO ] Flow matrix only has 2783 transitions (discarded 397 similar events)
[2023-03-23 20:53:00] [INFO ] Invariant cache hit.
[2023-03-23 20:53:00] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 20:53:17] [INFO ] Implicit Places using invariants and state equation in 16862 ms returned []
Implicit Place search using SMT with State Equation took 17886 ms to find 0 implicit places.
[2023-03-23 20:53:17] [INFO ] Redundant transitions in 222 ms returned []
[2023-03-23 20:53:17] [INFO ] Flow matrix only has 2783 transitions (discarded 397 similar events)
[2023-03-23 20:53:17] [INFO ] Invariant cache hit.
[2023-03-23 20:53:18] [INFO ] Dead Transitions using invariants and state equation in 1217 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19431 ms. Remains : 957/957 places, 3180/3180 transitions.
Graph (trivial) has 1044 edges and 957 vertex of which 17 / 957 are part of one of the 1 SCC in 4 ms
Free SCC test removed 16 places
Drop transitions removed 299 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 669 transitions.
Graph (complete) has 3706 edges and 941 vertex of which 927 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 t1211.t1410 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 910 transition count 2412
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 1 with 288 rules applied. Total rules applied 389 place count 813 transition count 2221
Reduce places removed 94 places and 0 transitions.
Drop transitions removed 23 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 2 with 259 rules applied. Total rules applied 648 place count 719 transition count 2056
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 3 with 210 rules applied. Total rules applied 858 place count 648 transition count 1917
Reduce places removed 68 places and 0 transitions.
Drop transitions removed 19 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 4 with 185 rules applied. Total rules applied 1043 place count 580 transition count 1800
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 145 rules applied. Total rules applied 1188 place count 531 transition count 1704
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 47 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 126 rules applied. Total rules applied 1314 place count 484 transition count 1625
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 1408 place count 452 transition count 1563
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 1486 place count 422 transition count 1515
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 1538 place count 404 transition count 1481
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 1578 place count 388 transition count 1457
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 1600 place count 380 transition count 1443
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 1614 place count 374 transition count 1435
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 13 with 7 rules applied. Total rules applied 1621 place count 372 transition count 1430
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1627 place count 369 transition count 1427
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 11 Pre rules applied. Total rules applied 1627 place count 369 transition count 1416
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 1649 place count 358 transition count 1416
Discarding 281 places :
Symmetric choice reduction at 15 with 281 rule applications. Total rules 1930 place count 77 transition count 352
Iterating global reduction 15 with 281 rules applied. Total rules applied 2211 place count 77 transition count 352
Ensure Unique test removed 202 transitions
Reduce isomorphic transitions removed 202 transitions.
Iterating post reduction 15 with 202 rules applied. Total rules applied 2413 place count 77 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2413 place count 77 transition count 149
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 2415 place count 76 transition count 149
Discarding 12 places :
Symmetric choice reduction at 16 with 12 rule applications. Total rules 2427 place count 64 transition count 100
Iterating global reduction 16 with 12 rules applied. Total rules applied 2439 place count 64 transition count 100
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 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 16 with 24 rules applied. Total rules applied 2463 place count 64 transition count 76
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 2465 place count 62 transition count 76
Discarding 9 places :
Symmetric choice reduction at 18 with 9 rule applications. Total rules 2474 place count 53 transition count 66
Iterating global reduction 18 with 9 rules applied. Total rules applied 2483 place count 53 transition count 66
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 2484 place count 53 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 2485 place count 52 transition count 65
Discarding 2 places :
Symmetric choice reduction at 20 with 2 rule applications. Total rules 2487 place count 50 transition count 63
Iterating global reduction 20 with 2 rules applied. Total rules applied 2489 place count 50 transition count 63
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 2497 place count 46 transition count 59
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 2498 place count 45 transition count 57
Iterating global reduction 20 with 1 rules applied. Total rules applied 2499 place count 45 transition count 57
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 2501 place count 45 transition count 55
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 20 with 10 rules applied. Total rules applied 2511 place count 45 transition count 45
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 20 with 10 rules applied. Total rules applied 2521 place count 35 transition count 45
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 21 with 3 rules applied. Total rules applied 2524 place count 35 transition count 45
Applied a total of 2524 rules in 452 ms. Remains 35 /957 variables (removed 922) and now considering 45/3180 (removed 3135) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 45 rows 35 cols
[2023-03-23 20:53:19] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-23 20:53:19] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 20:53:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 31 ms returned sat
[2023-03-23 20:53:19] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-23 20:53:19] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 20:53:19] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-23 20:53:19] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 8 atomic propositions for a total of 13 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 403 stabilizing places and 1096 stable transitions
Graph (complete) has 8458 edges and 1235 vertex of which 1234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.24 ms
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1 U G(p0))||X(p2))))'
Support contains 3 out of 1235 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1235/1235 places, 2729/2729 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1234 transition count 2729
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 1213 transition count 2699
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 1213 transition count 2699
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 61 place count 1195 transition count 2654
Iterating global reduction 1 with 18 rules applied. Total rules applied 79 place count 1195 transition count 2654
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 86 place count 1188 transition count 2632
Iterating global reduction 1 with 7 rules applied. Total rules applied 93 place count 1188 transition count 2632
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 1186 transition count 2624
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 1186 transition count 2624
Applied a total of 97 rules in 217 ms. Remains 1186 /1235 variables (removed 49) and now considering 2624/2729 (removed 105) transitions.
[2023-03-23 20:53:19] [INFO ] Flow matrix only has 2352 transitions (discarded 272 similar events)
// Phase 1: matrix 2352 rows 1186 cols
[2023-03-23 20:53:20] [INFO ] Computed 55 place invariants in 59 ms
[2023-03-23 20:53:21] [INFO ] Implicit Places using invariants in 1165 ms returned [369, 473, 487, 504, 524, 576, 611, 673, 780, 781, 902]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 1178 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1175/1235 places, 2624/2729 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1166 transition count 2615
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1166 transition count 2615
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1157 transition count 2606
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1157 transition count 2606
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 1148 transition count 2597
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 1148 transition count 2597
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 1142 transition count 2573
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 1142 transition count 2573
Applied a total of 66 rules in 167 ms. Remains 1142 /1175 variables (removed 33) and now considering 2573/2624 (removed 51) transitions.
[2023-03-23 20:53:21] [INFO ] Flow matrix only has 2301 transitions (discarded 272 similar events)
// Phase 1: matrix 2301 rows 1142 cols
[2023-03-23 20:53:21] [INFO ] Computed 44 place invariants in 26 ms
[2023-03-23 20:53:22] [INFO ] Implicit Places using invariants in 970 ms returned []
[2023-03-23 20:53:22] [INFO ] Flow matrix only has 2301 transitions (discarded 272 similar events)
[2023-03-23 20:53:22] [INFO ] Invariant cache hit.
[2023-03-23 20:53:23] [INFO ] State equation strengthened by 845 read => feed constraints.
[2023-03-23 20:53:32] [INFO ] Implicit Places using invariants and state equation in 10149 ms returned []
Implicit Place search using SMT with State Equation took 11153 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1142/1235 places, 2573/2729 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12716 ms. Remains : 1142/1235 places, 2573/2729 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s872), p2:(LEQ s150 s428)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1378 ms.
Product exploration explored 100000 steps with 50000 reset in 1328 ms.
Computed a total of 310 stabilizing places and 940 stable transitions
Computed a total of 310 stabilizing places and 940 stable transitions
Detected a total of 310/1142 stabilizing places and 940/2573 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 5 factoid took 71 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-00 finished in 15870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G((p1&&F(p2))))))'
Support contains 5 out of 1235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1235/1235 places, 2729/2729 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1234 transition count 2729
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 1211 transition count 2700
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 1211 transition count 2700
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 68 place count 1190 transition count 2643
Iterating global reduction 1 with 21 rules applied. Total rules applied 89 place count 1190 transition count 2643
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 97 place count 1182 transition count 2617
Iterating global reduction 1 with 8 rules applied. Total rules applied 105 place count 1182 transition count 2617
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 1180 transition count 2609
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 1180 transition count 2609
Applied a total of 109 rules in 179 ms. Remains 1180 /1235 variables (removed 55) and now considering 2609/2729 (removed 120) transitions.
[2023-03-23 20:53:35] [INFO ] Flow matrix only has 2337 transitions (discarded 272 similar events)
// Phase 1: matrix 2337 rows 1180 cols
[2023-03-23 20:53:35] [INFO ] Computed 55 place invariants in 33 ms
[2023-03-23 20:53:36] [INFO ] Implicit Places using invariants in 1054 ms returned [100, 364, 468, 499, 519, 571, 607, 669, 670, 775, 776, 896, 897]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1066 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1167/1235 places, 2609/2729 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1155 transition count 2597
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1155 transition count 2597
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1143 transition count 2585
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1143 transition count 2585
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1131 transition count 2573
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1131 transition count 2573
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 1123 transition count 2541
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 1123 transition count 2541
Applied a total of 88 rules in 160 ms. Remains 1123 /1167 variables (removed 44) and now considering 2541/2609 (removed 68) transitions.
[2023-03-23 20:53:36] [INFO ] Flow matrix only has 2269 transitions (discarded 272 similar events)
// Phase 1: matrix 2269 rows 1123 cols
[2023-03-23 20:53:36] [INFO ] Computed 42 place invariants in 38 ms
[2023-03-23 20:53:37] [INFO ] Implicit Places using invariants in 954 ms returned []
[2023-03-23 20:53:37] [INFO ] Flow matrix only has 2269 transitions (discarded 272 similar events)
[2023-03-23 20:53:37] [INFO ] Invariant cache hit.
[2023-03-23 20:53:38] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 20:53:47] [INFO ] Implicit Places using invariants and state equation in 9422 ms returned []
Implicit Place search using SMT with State Equation took 10397 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1123/1235 places, 2541/2729 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11803 ms. Remains : 1123/1235 places, 2541/2729 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), true, (NOT p0), (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s694 s376), p0:(GT s1110 s558), p2:(OR (LEQ s1110 s558) (LEQ 2 s473))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-02 finished in 12071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1235/1235 places, 2729/2729 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1234 transition count 2729
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 1211 transition count 2697
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 1211 transition count 2697
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 1191 transition count 2644
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 1191 transition count 2644
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 94 place count 1184 transition count 2622
Iterating global reduction 1 with 7 rules applied. Total rules applied 101 place count 1184 transition count 2622
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 1182 transition count 2614
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 1182 transition count 2614
Applied a total of 105 rules in 168 ms. Remains 1182 /1235 variables (removed 53) and now considering 2614/2729 (removed 115) transitions.
[2023-03-23 20:53:47] [INFO ] Flow matrix only has 2342 transitions (discarded 272 similar events)
// Phase 1: matrix 2342 rows 1182 cols
[2023-03-23 20:53:47] [INFO ] Computed 55 place invariants in 33 ms
[2023-03-23 20:53:48] [INFO ] Implicit Places using invariants in 997 ms returned [100, 364, 468, 482, 499, 574, 609, 671, 672, 776, 899, 900]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 999 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1170/1235 places, 2614/2729 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1160 transition count 2604
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1160 transition count 2604
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1150 transition count 2594
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1150 transition count 2594
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 1140 transition count 2584
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 1140 transition count 2584
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 1133 transition count 2556
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 1133 transition count 2556
Applied a total of 74 rules in 166 ms. Remains 1133 /1170 variables (removed 37) and now considering 2556/2614 (removed 58) transitions.
[2023-03-23 20:53:48] [INFO ] Flow matrix only has 2284 transitions (discarded 272 similar events)
// Phase 1: matrix 2284 rows 1133 cols
[2023-03-23 20:53:48] [INFO ] Computed 43 place invariants in 28 ms
[2023-03-23 20:53:49] [INFO ] Implicit Places using invariants in 970 ms returned []
[2023-03-23 20:53:49] [INFO ] Flow matrix only has 2284 transitions (discarded 272 similar events)
[2023-03-23 20:53:49] [INFO ] Invariant cache hit.
[2023-03-23 20:53:50] [INFO ] State equation strengthened by 836 read => feed constraints.
[2023-03-23 20:53:59] [INFO ] Implicit Places using invariants and state equation in 10120 ms returned []
Implicit Place search using SMT with State Equation took 11095 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1133/1235 places, 2556/2729 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12429 ms. Remains : 1133/1235 places, 2556/2729 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s769 s515)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 971 ms.
Product exploration explored 100000 steps with 33333 reset in 1005 ms.
Computed a total of 301 stabilizing places and 923 stable transitions
Computed a total of 301 stabilizing places and 923 stable transitions
Detected a total of 301/1133 stabilizing places and 923/2556 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-03 finished in 14599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 1235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1235/1235 places, 2729/2729 transitions.
Graph (complete) has 8458 edges and 1235 vertex of which 1234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 1234 transition count 2719
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 1224 transition count 2718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 1223 transition count 2718
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 23 place count 1223 transition count 2700
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 59 place count 1205 transition count 2700
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 79 place count 1185 transition count 2671
Iterating global reduction 3 with 20 rules applied. Total rules applied 99 place count 1185 transition count 2671
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 99 place count 1185 transition count 2668
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 105 place count 1182 transition count 2668
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 122 place count 1165 transition count 2615
Iterating global reduction 3 with 17 rules applied. Total rules applied 139 place count 1165 transition count 2615
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 142 place count 1162 transition count 2603
Iterating global reduction 3 with 3 rules applied. Total rules applied 145 place count 1162 transition count 2603
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 197 place count 1136 transition count 2577
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 201 place count 1132 transition count 2573
Iterating global reduction 3 with 4 rules applied. Total rules applied 205 place count 1132 transition count 2573
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 209 place count 1128 transition count 2557
Iterating global reduction 3 with 4 rules applied. Total rules applied 213 place count 1128 transition count 2557
Applied a total of 213 rules in 492 ms. Remains 1128 /1235 variables (removed 107) and now considering 2557/2729 (removed 172) transitions.
[2023-03-23 20:54:02] [INFO ] Flow matrix only has 2285 transitions (discarded 272 similar events)
// Phase 1: matrix 2285 rows 1128 cols
[2023-03-23 20:54:02] [INFO ] Computed 55 place invariants in 28 ms
[2023-03-23 20:54:03] [INFO ] Implicit Places using invariants in 1001 ms returned [93, 347, 449, 462, 479, 497, 546, 579, 638, 639, 739, 740, 856, 857]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1005 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1114/1235 places, 2557/2729 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1106 transition count 2549
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1106 transition count 2549
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1098 transition count 2541
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1098 transition count 2541
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 1094 transition count 2525
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 1094 transition count 2525
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 1091 transition count 2522
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 1088 transition count 2519
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 1088 transition count 2519
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 1084 transition count 2503
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 1084 transition count 2503
Applied a total of 60 rules in 375 ms. Remains 1084 /1114 variables (removed 30) and now considering 2503/2557 (removed 54) transitions.
[2023-03-23 20:54:03] [INFO ] Flow matrix only has 2231 transitions (discarded 272 similar events)
// Phase 1: matrix 2231 rows 1084 cols
[2023-03-23 20:54:03] [INFO ] Computed 41 place invariants in 23 ms
[2023-03-23 20:54:04] [INFO ] Implicit Places using invariants in 963 ms returned []
[2023-03-23 20:54:04] [INFO ] Flow matrix only has 2231 transitions (discarded 272 similar events)
[2023-03-23 20:54:04] [INFO ] Invariant cache hit.
[2023-03-23 20:54:05] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 20:54:14] [INFO ] Implicit Places using invariants and state equation in 9121 ms returned []
Implicit Place search using SMT with State Equation took 10101 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1084/1235 places, 2503/2729 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11974 ms. Remains : 1084/1235 places, 2503/2729 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s143), p0:(GT s650 s1060)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-04 finished in 12070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1235/1235 places, 2729/2729 transitions.
Graph (complete) has 8458 edges and 1235 vertex of which 1234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 1234 transition count 2719
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 1224 transition count 2719
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 21 place count 1224 transition count 2699
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 61 place count 1204 transition count 2699
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 82 place count 1183 transition count 2669
Iterating global reduction 2 with 21 rules applied. Total rules applied 103 place count 1183 transition count 2669
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 103 place count 1183 transition count 2666
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 1180 transition count 2666
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 127 place count 1162 transition count 2612
Iterating global reduction 2 with 18 rules applied. Total rules applied 145 place count 1162 transition count 2612
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 149 place count 1158 transition count 2596
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 1158 transition count 2596
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 203 place count 1133 transition count 2571
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 206 place count 1130 transition count 2568
Iterating global reduction 2 with 3 rules applied. Total rules applied 209 place count 1130 transition count 2568
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 212 place count 1127 transition count 2556
Iterating global reduction 2 with 3 rules applied. Total rules applied 215 place count 1127 transition count 2556
Applied a total of 215 rules in 365 ms. Remains 1127 /1235 variables (removed 108) and now considering 2556/2729 (removed 173) transitions.
[2023-03-23 20:54:14] [INFO ] Flow matrix only has 2284 transitions (discarded 272 similar events)
// Phase 1: matrix 2284 rows 1127 cols
[2023-03-23 20:54:14] [INFO ] Computed 55 place invariants in 24 ms
[2023-03-23 20:54:15] [INFO ] Implicit Places using invariants in 1016 ms returned [93, 343, 445, 458, 475, 493, 542, 575, 634, 635, 736, 855, 856]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1019 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1114/1235 places, 2556/2729 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1107 transition count 2549
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1107 transition count 2549
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1100 transition count 2542
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1100 transition count 2542
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 1096 transition count 2526
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 1096 transition count 2526
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 1092 transition count 2522
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 1088 transition count 2518
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 1088 transition count 2518
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 1084 transition count 2502
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 1084 transition count 2502
Applied a total of 60 rules in 311 ms. Remains 1084 /1114 variables (removed 30) and now considering 2502/2556 (removed 54) transitions.
[2023-03-23 20:54:15] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1084 cols
[2023-03-23 20:54:15] [INFO ] Computed 42 place invariants in 28 ms
[2023-03-23 20:54:16] [INFO ] Implicit Places using invariants in 936 ms returned []
[2023-03-23 20:54:16] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 20:54:16] [INFO ] Invariant cache hit.
[2023-03-23 20:54:17] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 20:54:26] [INFO ] Implicit Places using invariants and state equation in 9653 ms returned [1068]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10593 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1083/1235 places, 2502/2729 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1083 transition count 2501
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1082 transition count 2501
Applied a total of 2 rules in 86 ms. Remains 1082 /1083 variables (removed 1) and now considering 2501/2502 (removed 1) transitions.
[2023-03-23 20:54:26] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
// Phase 1: matrix 2229 rows 1082 cols
[2023-03-23 20:54:26] [INFO ] Computed 41 place invariants in 25 ms
[2023-03-23 20:54:27] [INFO ] Implicit Places using invariants in 926 ms returned []
[2023-03-23 20:54:27] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2023-03-23 20:54:27] [INFO ] Invariant cache hit.
[2023-03-23 20:54:28] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 20:54:36] [INFO ] Implicit Places using invariants and state equation in 9173 ms returned []
Implicit Place search using SMT with State Equation took 10104 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1082/1235 places, 2501/2729 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 22480 ms. Remains : 1082/1235 places, 2501/2729 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s721)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3384 reset in 512 ms.
Product exploration explored 100000 steps with 3386 reset in 554 ms.
Computed a total of 267 stabilizing places and 885 stable transitions
Computed a total of 267 stabilizing places and 885 stable transitions
Detected a total of 267/1082 stabilizing places and 885/2501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 2407 steps, including 81 resets, run visited all 1 properties in 15 ms. (steps per millisecond=160 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1082/1082 places, 2501/2501 transitions.
Applied a total of 0 rules in 73 ms. Remains 1082 /1082 variables (removed 0) and now considering 2501/2501 (removed 0) transitions.
[2023-03-23 20:54:38] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2023-03-23 20:54:38] [INFO ] Invariant cache hit.
[2023-03-23 20:54:39] [INFO ] Implicit Places using invariants in 912 ms returned []
[2023-03-23 20:54:39] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2023-03-23 20:54:39] [INFO ] Invariant cache hit.
[2023-03-23 20:54:40] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 20:54:48] [INFO ] Implicit Places using invariants and state equation in 9389 ms returned []
Implicit Place search using SMT with State Equation took 10336 ms to find 0 implicit places.
[2023-03-23 20:54:48] [INFO ] Redundant transitions in 129 ms returned []
[2023-03-23 20:54:48] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2023-03-23 20:54:48] [INFO ] Invariant cache hit.
[2023-03-23 20:54:49] [INFO ] Dead Transitions using invariants and state equation in 1047 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11597 ms. Remains : 1082/1082 places, 2501/2501 transitions.
Computed a total of 267 stabilizing places and 885 stable transitions
Computed a total of 267 stabilizing places and 885 stable transitions
Detected a total of 267/1082 stabilizing places and 885/2501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 1746 steps, including 59 resets, run visited all 1 properties in 13 ms. (steps per millisecond=134 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3383 reset in 468 ms.
Product exploration explored 100000 steps with 3386 reset in 489 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1082/1082 places, 2501/2501 transitions.
Applied a total of 0 rules in 64 ms. Remains 1082 /1082 variables (removed 0) and now considering 2501/2501 (removed 0) transitions.
[2023-03-23 20:54:51] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2023-03-23 20:54:51] [INFO ] Invariant cache hit.
[2023-03-23 20:54:52] [INFO ] Implicit Places using invariants in 915 ms returned []
[2023-03-23 20:54:52] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2023-03-23 20:54:52] [INFO ] Invariant cache hit.
[2023-03-23 20:54:53] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 20:55:01] [INFO ] Implicit Places using invariants and state equation in 9306 ms returned []
Implicit Place search using SMT with State Equation took 10225 ms to find 0 implicit places.
[2023-03-23 20:55:01] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-23 20:55:01] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2023-03-23 20:55:01] [INFO ] Invariant cache hit.
[2023-03-23 20:55:02] [INFO ] Dead Transitions using invariants and state equation in 1050 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11426 ms. Remains : 1082/1082 places, 2501/2501 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-05 finished in 48906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1235/1235 places, 2729/2729 transitions.
Graph (complete) has 8458 edges and 1235 vertex of which 1234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 1234 transition count 2719
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 1224 transition count 2719
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 21 place count 1224 transition count 2699
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 61 place count 1204 transition count 2699
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 82 place count 1183 transition count 2669
Iterating global reduction 2 with 21 rules applied. Total rules applied 103 place count 1183 transition count 2669
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 103 place count 1183 transition count 2666
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 1180 transition count 2666
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 127 place count 1162 transition count 2612
Iterating global reduction 2 with 18 rules applied. Total rules applied 145 place count 1162 transition count 2612
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 149 place count 1158 transition count 2596
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 1158 transition count 2596
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 203 place count 1133 transition count 2571
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 206 place count 1130 transition count 2568
Iterating global reduction 2 with 3 rules applied. Total rules applied 209 place count 1130 transition count 2568
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 212 place count 1127 transition count 2556
Iterating global reduction 2 with 3 rules applied. Total rules applied 215 place count 1127 transition count 2556
Applied a total of 215 rules in 395 ms. Remains 1127 /1235 variables (removed 108) and now considering 2556/2729 (removed 173) transitions.
[2023-03-23 20:55:03] [INFO ] Flow matrix only has 2284 transitions (discarded 272 similar events)
// Phase 1: matrix 2284 rows 1127 cols
[2023-03-23 20:55:03] [INFO ] Computed 55 place invariants in 28 ms
[2023-03-23 20:55:04] [INFO ] Implicit Places using invariants in 969 ms returned [93, 343, 445, 458, 475, 493, 542, 575, 635, 738, 739, 855, 856]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 971 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1114/1235 places, 2556/2729 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1107 transition count 2549
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1107 transition count 2549
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1100 transition count 2542
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1100 transition count 2542
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 1097 transition count 2530
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 1097 transition count 2530
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 1093 transition count 2526
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 1089 transition count 2522
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 1089 transition count 2522
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 1084 transition count 2502
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 1084 transition count 2502
Applied a total of 60 rules in 307 ms. Remains 1084 /1114 variables (removed 30) and now considering 2502/2556 (removed 54) transitions.
[2023-03-23 20:55:04] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1084 cols
[2023-03-23 20:55:04] [INFO ] Computed 42 place invariants in 30 ms
[2023-03-23 20:55:05] [INFO ] Implicit Places using invariants in 960 ms returned []
[2023-03-23 20:55:05] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 20:55:05] [INFO ] Invariant cache hit.
[2023-03-23 20:55:06] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 20:55:14] [INFO ] Implicit Places using invariants and state equation in 8524 ms returned []
Implicit Place search using SMT with State Equation took 9486 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1084/1235 places, 2502/2729 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11159 ms. Remains : 1084/1235 places, 2502/2729 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT 2 s660) (GT 1 s624))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3385 reset in 480 ms.
Product exploration explored 100000 steps with 3383 reset in 505 ms.
Computed a total of 269 stabilizing places and 886 stable transitions
Computed a total of 269 stabilizing places and 886 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 2007 steps, including 67 resets, run visited all 1 properties in 15 ms. (steps per millisecond=133 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 2 out of 1084 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1084/1084 places, 2502/2502 transitions.
Applied a total of 0 rules in 68 ms. Remains 1084 /1084 variables (removed 0) and now considering 2502/2502 (removed 0) transitions.
[2023-03-23 20:55:15] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 20:55:15] [INFO ] Invariant cache hit.
[2023-03-23 20:55:16] [INFO ] Implicit Places using invariants in 915 ms returned []
[2023-03-23 20:55:16] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 20:55:16] [INFO ] Invariant cache hit.
[2023-03-23 20:55:17] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 20:55:24] [INFO ] Implicit Places using invariants and state equation in 8284 ms returned []
Implicit Place search using SMT with State Equation took 9214 ms to find 0 implicit places.
[2023-03-23 20:55:25] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-23 20:55:25] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 20:55:25] [INFO ] Invariant cache hit.
[2023-03-23 20:55:26] [INFO ] Dead Transitions using invariants and state equation in 1061 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10434 ms. Remains : 1084/1084 places, 2502/2502 transitions.
Computed a total of 269 stabilizing places and 886 stable transitions
Computed a total of 269 stabilizing places and 886 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 339 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished probabilistic random walk after 14731 steps, run visited all 1 properties in 563 ms. (steps per millisecond=26 )
Probabilistic random walk after 14731 steps, saw 6312 distinct states, run finished after 563 ms. (steps per millisecond=26 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3384 reset in 485 ms.
Product exploration explored 100000 steps with 3380 reset in 506 ms.
Support contains 2 out of 1084 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1084/1084 places, 2502/2502 transitions.
Applied a total of 0 rules in 64 ms. Remains 1084 /1084 variables (removed 0) and now considering 2502/2502 (removed 0) transitions.
[2023-03-23 20:55:28] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 20:55:28] [INFO ] Invariant cache hit.
[2023-03-23 20:55:29] [INFO ] Implicit Places using invariants in 929 ms returned []
[2023-03-23 20:55:29] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 20:55:29] [INFO ] Invariant cache hit.
[2023-03-23 20:55:30] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 20:55:37] [INFO ] Implicit Places using invariants and state equation in 8503 ms returned []
Implicit Place search using SMT with State Equation took 9459 ms to find 0 implicit places.
[2023-03-23 20:55:37] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-23 20:55:37] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 20:55:37] [INFO ] Invariant cache hit.
[2023-03-23 20:55:38] [INFO ] Dead Transitions using invariants and state equation in 1050 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10661 ms. Remains : 1084/1084 places, 2502/2502 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-10 finished in 35849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1235/1235 places, 2729/2729 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1234 transition count 2729
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 1210 transition count 2696
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 1210 transition count 2696
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 70 place count 1189 transition count 2642
Iterating global reduction 1 with 21 rules applied. Total rules applied 91 place count 1189 transition count 2642
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 99 place count 1181 transition count 2616
Iterating global reduction 1 with 8 rules applied. Total rules applied 107 place count 1181 transition count 2616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 1179 transition count 2608
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 1179 transition count 2608
Applied a total of 111 rules in 190 ms. Remains 1179 /1235 variables (removed 56) and now considering 2608/2729 (removed 121) transitions.
[2023-03-23 20:55:39] [INFO ] Flow matrix only has 2336 transitions (discarded 272 similar events)
// Phase 1: matrix 2336 rows 1179 cols
[2023-03-23 20:55:39] [INFO ] Computed 55 place invariants in 28 ms
[2023-03-23 20:55:40] [INFO ] Implicit Places using invariants in 1016 ms returned [100, 364, 482, 521, 573, 608, 670, 671, 775, 776, 896, 897]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1018 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1167/1235 places, 2608/2729 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1156 transition count 2597
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1156 transition count 2597
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1145 transition count 2586
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1145 transition count 2586
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1134 transition count 2575
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1134 transition count 2575
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 1126 transition count 2543
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 1126 transition count 2543
Applied a total of 82 rules in 197 ms. Remains 1126 /1167 variables (removed 41) and now considering 2543/2608 (removed 65) transitions.
[2023-03-23 20:55:40] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1126 cols
[2023-03-23 20:55:40] [INFO ] Computed 43 place invariants in 24 ms
[2023-03-23 20:55:41] [INFO ] Implicit Places using invariants in 950 ms returned []
[2023-03-23 20:55:41] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 20:55:41] [INFO ] Invariant cache hit.
[2023-03-23 20:55:41] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 20:55:51] [INFO ] Implicit Places using invariants and state equation in 9972 ms returned [1102]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10926 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1125/1235 places, 2543/2729 transitions.
Applied a total of 0 rules in 35 ms. Remains 1125 /1125 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12367 ms. Remains : 1125/1235 places, 2543/2729 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s460 s498)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3766 steps with 90 reset in 16 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-11 finished in 12532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0 U p1))||F(p2))))'
Support contains 4 out of 1235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1235/1235 places, 2729/2729 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1234 transition count 2729
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 1210 transition count 2696
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 1210 transition count 2696
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 70 place count 1189 transition count 2642
Iterating global reduction 1 with 21 rules applied. Total rules applied 91 place count 1189 transition count 2642
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 99 place count 1181 transition count 2616
Iterating global reduction 1 with 8 rules applied. Total rules applied 107 place count 1181 transition count 2616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 1179 transition count 2608
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 1179 transition count 2608
Applied a total of 111 rules in 197 ms. Remains 1179 /1235 variables (removed 56) and now considering 2608/2729 (removed 121) transitions.
[2023-03-23 20:55:51] [INFO ] Flow matrix only has 2336 transitions (discarded 272 similar events)
// Phase 1: matrix 2336 rows 1179 cols
[2023-03-23 20:55:51] [INFO ] Computed 55 place invariants in 21 ms
[2023-03-23 20:55:52] [INFO ] Implicit Places using invariants in 1010 ms returned [100, 364, 468, 482, 499, 519, 571, 606, 668, 669, 773, 774, 894]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1012 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1166/1235 places, 2608/2729 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1155 transition count 2597
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1155 transition count 2597
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1144 transition count 2586
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1144 transition count 2586
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1133 transition count 2575
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1133 transition count 2575
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 1125 transition count 2543
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 1125 transition count 2543
Applied a total of 82 rules in 185 ms. Remains 1125 /1166 variables (removed 41) and now considering 2543/2608 (removed 65) transitions.
[2023-03-23 20:55:52] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1125 cols
[2023-03-23 20:55:52] [INFO ] Computed 42 place invariants in 20 ms
[2023-03-23 20:55:53] [INFO ] Implicit Places using invariants in 943 ms returned []
[2023-03-23 20:55:53] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 20:55:53] [INFO ] Invariant cache hit.
[2023-03-23 20:55:54] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 20:56:03] [INFO ] Implicit Places using invariants and state equation in 10055 ms returned [1114]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11015 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1124/1235 places, 2543/2729 transitions.
Applied a total of 0 rules in 36 ms. Remains 1124 /1124 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12447 ms. Remains : 1124/1235 places, 2543/2729 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (LEQ 1 s734) (LEQ 1 s414)), p1:(LEQ s859 s397), p0:(LEQ 1 s414)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33106 reset in 1091 ms.
Product exploration explored 100000 steps with 32965 reset in 1049 ms.
Computed a total of 292 stabilizing places and 910 stable transitions
Computed a total of 292 stabilizing places and 910 stable transitions
Detected a total of 292/1124 stabilizing places and 910/2543 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 285 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 238 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 20:56:06] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1124 cols
[2023-03-23 20:56:06] [INFO ] Computed 41 place invariants in 20 ms
[2023-03-23 20:56:06] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 441 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 1124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1124/1124 places, 2543/2543 transitions.
Applied a total of 0 rules in 36 ms. Remains 1124 /1124 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
[2023-03-23 20:56:07] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 20:56:07] [INFO ] Invariant cache hit.
[2023-03-23 20:56:08] [INFO ] Implicit Places using invariants in 909 ms returned []
[2023-03-23 20:56:08] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 20:56:08] [INFO ] Invariant cache hit.
[2023-03-23 20:56:09] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 20:56:18] [INFO ] Implicit Places using invariants and state equation in 10169 ms returned []
Implicit Place search using SMT with State Equation took 11094 ms to find 0 implicit places.
[2023-03-23 20:56:18] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 20:56:18] [INFO ] Invariant cache hit.
[2023-03-23 20:56:19] [INFO ] Dead Transitions using invariants and state equation in 1049 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12200 ms. Remains : 1124/1124 places, 2543/2543 transitions.
Computed a total of 292 stabilizing places and 910 stable transitions
Computed a total of 292 stabilizing places and 910 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 239 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 20:56:20] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 20:56:20] [INFO ] Invariant cache hit.
[2023-03-23 20:56:20] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 20:56:20] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 20:56:20] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 9 ms returned sat
[2023-03-23 20:56:21] [INFO ] After 664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 20:56:21] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 20:56:21] [INFO ] After 319ms SMT Verify possible using 830 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 20:56:21] [INFO ] After 518ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-23 20:56:21] [INFO ] After 1530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 1124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1124/1124 places, 2543/2543 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 0 with 16 rules applied. Total rules applied 16 place count 1124 transition count 2527
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 1108 transition count 2527
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 32 place count 1108 transition count 2518
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 50 place count 1099 transition count 2518
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 86 place count 1081 transition count 2500
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 2 with 133 rules applied. Total rules applied 219 place count 1081 transition count 3171
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 2 with 133 rules applied. Total rules applied 352 place count 948 transition count 3171
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 353 place count 948 transition count 3171
Applied a total of 353 rules in 301 ms. Remains 948 /1124 variables (removed 176) and now considering 3171/2543 (removed -628) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 948/1124 places, 3171/2543 transitions.
Incomplete random walk after 10000 steps, including 426 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 12209 steps, run visited all 1 properties in 472 ms. (steps per millisecond=25 )
Probabilistic random walk after 12209 steps, saw 5225 distinct states, run finished after 472 ms. (steps per millisecond=25 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 246 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 32978 reset in 1011 ms.
Product exploration explored 100000 steps with 32920 reset in 1040 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 1124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1124/1124 places, 2543/2543 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1124 transition count 2543
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 16 place count 1124 transition count 2544
Deduced a syphon composed of 25 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 25 place count 1124 transition count 2544
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 33 place count 1116 transition count 2536
Deduced a syphon composed of 17 places in 3 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 41 place count 1116 transition count 2536
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 59 place count 1116 transition count 2536
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1115 transition count 2535
Deduced a syphon composed of 34 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1115 transition count 2535
Deduced a syphon composed of 34 places in 1 ms
Applied a total of 61 rules in 518 ms. Remains 1115 /1124 variables (removed 9) and now considering 2535/2543 (removed 8) transitions.
[2023-03-23 20:56:26] [INFO ] Redundant transitions in 82 ms returned []
[2023-03-23 20:56:26] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1115 cols
[2023-03-23 20:56:26] [INFO ] Computed 41 place invariants in 24 ms
[2023-03-23 20:56:27] [INFO ] Dead Transitions using invariants and state equation in 1349 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1115/1124 places, 2535/2543 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1972 ms. Remains : 1115/1124 places, 2535/2543 transitions.
Support contains 4 out of 1124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1124/1124 places, 2543/2543 transitions.
Applied a total of 0 rules in 30 ms. Remains 1124 /1124 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
[2023-03-23 20:56:27] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1124 cols
[2023-03-23 20:56:27] [INFO ] Computed 41 place invariants in 24 ms
[2023-03-23 20:56:28] [INFO ] Implicit Places using invariants in 963 ms returned []
[2023-03-23 20:56:28] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 20:56:28] [INFO ] Invariant cache hit.
[2023-03-23 20:56:29] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 20:56:38] [INFO ] Implicit Places using invariants and state equation in 9699 ms returned []
Implicit Place search using SMT with State Equation took 10663 ms to find 0 implicit places.
[2023-03-23 20:56:38] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 20:56:38] [INFO ] Invariant cache hit.
[2023-03-23 20:56:39] [INFO ] Dead Transitions using invariants and state equation in 965 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11661 ms. Remains : 1124/1124 places, 2543/2543 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-12 finished in 47954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1235/1235 places, 2729/2729 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1234 transition count 2729
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 1211 transition count 2700
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 1211 transition count 2700
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 68 place count 1190 transition count 2643
Iterating global reduction 1 with 21 rules applied. Total rules applied 89 place count 1190 transition count 2643
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 1183 transition count 2618
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 1183 transition count 2618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 1182 transition count 2614
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 1182 transition count 2614
Applied a total of 105 rules in 201 ms. Remains 1182 /1235 variables (removed 53) and now considering 2614/2729 (removed 115) transitions.
[2023-03-23 20:56:39] [INFO ] Flow matrix only has 2342 transitions (discarded 272 similar events)
// Phase 1: matrix 2342 rows 1182 cols
[2023-03-23 20:56:39] [INFO ] Computed 55 place invariants in 30 ms
[2023-03-23 20:56:40] [INFO ] Implicit Places using invariants in 965 ms returned [100, 364, 469, 486, 503, 523, 575, 610, 672, 673, 777, 778, 898, 899]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 972 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1168/1235 places, 2614/2729 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1156 transition count 2602
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1156 transition count 2602
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1144 transition count 2590
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1144 transition count 2590
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1132 transition count 2578
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1132 transition count 2578
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 1123 transition count 2542
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 1123 transition count 2542
Applied a total of 90 rules in 196 ms. Remains 1123 /1168 variables (removed 45) and now considering 2542/2614 (removed 72) transitions.
[2023-03-23 20:56:40] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1123 cols
[2023-03-23 20:56:40] [INFO ] Computed 41 place invariants in 29 ms
[2023-03-23 20:56:41] [INFO ] Implicit Places using invariants in 932 ms returned []
[2023-03-23 20:56:41] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2023-03-23 20:56:41] [INFO ] Invariant cache hit.
[2023-03-23 20:56:42] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 20:56:51] [INFO ] Implicit Places using invariants and state equation in 9654 ms returned []
Implicit Place search using SMT with State Equation took 10603 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1123/1235 places, 2542/2729 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11973 ms. Remains : 1123/1235 places, 2542/2729 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s474 s463)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1646 steps with 39 reset in 11 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-13 finished in 12083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 1235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1235/1235 places, 2729/2729 transitions.
Graph (complete) has 8458 edges and 1235 vertex of which 1234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 1234 transition count 2718
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 1223 transition count 2718
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 23 place count 1223 transition count 2698
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 63 place count 1203 transition count 2698
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 81 place count 1185 transition count 2671
Iterating global reduction 2 with 18 rules applied. Total rules applied 99 place count 1185 transition count 2671
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 99 place count 1185 transition count 2669
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 103 place count 1183 transition count 2669
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 1168 transition count 2627
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 1168 transition count 2627
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 137 place count 1164 transition count 2611
Iterating global reduction 2 with 4 rules applied. Total rules applied 141 place count 1164 transition count 2611
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 193 place count 1138 transition count 2585
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 197 place count 1134 transition count 2581
Iterating global reduction 2 with 4 rules applied. Total rules applied 201 place count 1134 transition count 2581
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 205 place count 1130 transition count 2565
Iterating global reduction 2 with 4 rules applied. Total rules applied 209 place count 1130 transition count 2565
Applied a total of 209 rules in 414 ms. Remains 1130 /1235 variables (removed 105) and now considering 2565/2729 (removed 164) transitions.
[2023-03-23 20:56:51] [INFO ] Flow matrix only has 2293 transitions (discarded 272 similar events)
// Phase 1: matrix 2293 rows 1130 cols
[2023-03-23 20:56:51] [INFO ] Computed 55 place invariants in 29 ms
[2023-03-23 20:56:52] [INFO ] Implicit Places using invariants in 1097 ms returned [94, 344, 446, 459, 582, 641, 642, 742, 743, 859, 860]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 1110 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1119/1235 places, 2565/2729 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1114 transition count 2560
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1114 transition count 2560
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 1109 transition count 2555
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 1109 transition count 2555
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 1107 transition count 2547
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 1107 transition count 2547
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1103 transition count 2543
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 1099 transition count 2539
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 1099 transition count 2539
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 1095 transition count 2523
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 1095 transition count 2523
Applied a total of 48 rules in 330 ms. Remains 1095 /1119 variables (removed 24) and now considering 2523/2565 (removed 42) transitions.
[2023-03-23 20:56:53] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
// Phase 1: matrix 2251 rows 1095 cols
[2023-03-23 20:56:53] [INFO ] Computed 44 place invariants in 25 ms
[2023-03-23 20:56:54] [INFO ] Implicit Places using invariants in 951 ms returned []
[2023-03-23 20:56:54] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
[2023-03-23 20:56:54] [INFO ] Invariant cache hit.
[2023-03-23 20:56:55] [INFO ] State equation strengthened by 842 read => feed constraints.
[2023-03-23 20:57:03] [INFO ] Implicit Places using invariants and state equation in 8996 ms returned []
Implicit Place search using SMT with State Equation took 9971 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1095/1235 places, 2523/2729 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11828 ms. Remains : 1095/1235 places, 2523/2729 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT s548 s488) (GT s472 s7))], 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 28 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-15 finished in 11884 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0 U p1))||F(p2))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-12
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 1235 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1235/1235 places, 2729/2729 transitions.
Graph (complete) has 8458 edges and 1235 vertex of which 1234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 1234 transition count 2718
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 1223 transition count 2718
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 23 place count 1223 transition count 2698
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 63 place count 1203 transition count 2698
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 83 place count 1183 transition count 2669
Iterating global reduction 2 with 20 rules applied. Total rules applied 103 place count 1183 transition count 2669
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 103 place count 1183 transition count 2667
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 1181 transition count 2667
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 124 place count 1164 transition count 2617
Iterating global reduction 2 with 17 rules applied. Total rules applied 141 place count 1164 transition count 2617
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 145 place count 1160 transition count 2601
Iterating global reduction 2 with 4 rules applied. Total rules applied 149 place count 1160 transition count 2601
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 201 place count 1134 transition count 2575
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 205 place count 1130 transition count 2571
Iterating global reduction 2 with 4 rules applied. Total rules applied 209 place count 1130 transition count 2571
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 213 place count 1126 transition count 2555
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 1126 transition count 2555
Applied a total of 217 rules in 353 ms. Remains 1126 /1235 variables (removed 109) and now considering 2555/2729 (removed 174) transitions.
[2023-03-23 20:57:04] [INFO ] Flow matrix only has 2283 transitions (discarded 272 similar events)
// Phase 1: matrix 2283 rows 1126 cols
[2023-03-23 20:57:04] [INFO ] Computed 55 place invariants in 23 ms
[2023-03-23 20:57:05] [INFO ] Implicit Places using invariants in 1158 ms returned [94, 344, 446, 459, 476, 494, 543, 576, 635, 636, 736, 737, 853]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1160 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1113/1235 places, 2555/2729 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1106 transition count 2548
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1106 transition count 2548
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1099 transition count 2541
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1099 transition count 2541
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 1096 transition count 2529
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 1096 transition count 2529
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 1092 transition count 2525
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 1088 transition count 2521
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 1088 transition count 2521
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 1083 transition count 2501
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 1083 transition count 2501
Applied a total of 60 rules in 294 ms. Remains 1083 /1113 variables (removed 30) and now considering 2501/2555 (removed 54) transitions.
[2023-03-23 20:57:05] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
// Phase 1: matrix 2229 rows 1083 cols
[2023-03-23 20:57:05] [INFO ] Computed 42 place invariants in 37 ms
[2023-03-23 20:57:06] [INFO ] Implicit Places using invariants in 885 ms returned []
[2023-03-23 20:57:06] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2023-03-23 20:57:06] [INFO ] Invariant cache hit.
[2023-03-23 20:57:07] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 20:57:15] [INFO ] Implicit Places using invariants and state equation in 8858 ms returned []
Implicit Place search using SMT with State Equation took 9749 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1083/1235 places, 2501/2729 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 11557 ms. Remains : 1083/1235 places, 2501/2729 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (LEQ 1 s705) (LEQ 1 s395)), p1:(LEQ s828 s378), p0:(LEQ 1 s395)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 32934 reset in 1014 ms.
Product exploration explored 100000 steps with 32949 reset in 1033 ms.
Computed a total of 268 stabilizing places and 885 stable transitions
Computed a total of 268 stabilizing places and 885 stable transitions
Detected a total of 268/1083 stabilizing places and 885/2501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 335 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 337 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 20:57:17] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2023-03-23 20:57:17] [INFO ] Invariant cache hit.
[2023-03-23 20:57:18] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 359 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 1083 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1083/1083 places, 2501/2501 transitions.
Applied a total of 0 rules in 43 ms. Remains 1083 /1083 variables (removed 0) and now considering 2501/2501 (removed 0) transitions.
[2023-03-23 20:57:18] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2023-03-23 20:57:18] [INFO ] Invariant cache hit.
[2023-03-23 20:57:19] [INFO ] Implicit Places using invariants in 941 ms returned []
[2023-03-23 20:57:19] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2023-03-23 20:57:19] [INFO ] Invariant cache hit.
[2023-03-23 20:57:20] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 20:57:28] [INFO ] Implicit Places using invariants and state equation in 8598 ms returned []
Implicit Place search using SMT with State Equation took 9567 ms to find 0 implicit places.
[2023-03-23 20:57:28] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2023-03-23 20:57:28] [INFO ] Invariant cache hit.
[2023-03-23 20:57:29] [INFO ] Dead Transitions using invariants and state equation in 1032 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10643 ms. Remains : 1083/1083 places, 2501/2501 transitions.
Computed a total of 268 stabilizing places and 885 stable transitions
Computed a total of 268 stabilizing places and 885 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 338 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 20:57:29] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2023-03-23 20:57:29] [INFO ] Invariant cache hit.
[2023-03-23 20:57:29] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 20:57:29] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 20:57:29] [INFO ] [Nat]Absence check using 31 positive and 11 generalized place invariants in 16 ms returned sat
[2023-03-23 20:57:30] [INFO ] After 773ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 20:57:30] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 20:57:30] [INFO ] After 157ms SMT Verify possible using 830 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 20:57:31] [INFO ] After 304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-23 20:57:31] [INFO ] After 1369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 2501/2501 transitions.
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 0 with 133 rules applied. Total rules applied 133 place count 1083 transition count 3172
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 0 with 133 rules applied. Total rules applied 266 place count 950 transition count 3172
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 267 place count 950 transition count 3172
Applied a total of 267 rules in 246 ms. Remains 950 /1083 variables (removed 133) and now considering 3172/2501 (removed -671) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 950/1083 places, 3172/2501 transitions.
Finished random walk after 2780 steps, including 117 resets, run visited all 1 properties in 34 ms. (steps per millisecond=81 )
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 33089 reset in 999 ms.
Product exploration explored 100000 steps with 32946 reset in 1027 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 1083 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1083/1083 places, 2501/2501 transitions.
Applied a total of 0 rules in 66 ms. Remains 1083 /1083 variables (removed 0) and now considering 2501/2501 (removed 0) transitions.
[2023-03-23 20:57:34] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-23 20:57:34] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2023-03-23 20:57:34] [INFO ] Invariant cache hit.
[2023-03-23 20:57:35] [INFO ] Dead Transitions using invariants and state equation in 1012 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1169 ms. Remains : 1083/1083 places, 2501/2501 transitions.
Support contains 4 out of 1083 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1083/1083 places, 2501/2501 transitions.
Applied a total of 0 rules in 37 ms. Remains 1083 /1083 variables (removed 0) and now considering 2501/2501 (removed 0) transitions.
[2023-03-23 20:57:35] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2023-03-23 20:57:35] [INFO ] Invariant cache hit.
[2023-03-23 20:57:36] [INFO ] Implicit Places using invariants in 879 ms returned []
[2023-03-23 20:57:36] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2023-03-23 20:57:36] [INFO ] Invariant cache hit.
[2023-03-23 20:57:36] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 20:57:45] [INFO ] Implicit Places using invariants and state equation in 9363 ms returned []
Implicit Place search using SMT with State Equation took 10244 ms to find 0 implicit places.
[2023-03-23 20:57:45] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2023-03-23 20:57:45] [INFO ] Invariant cache hit.
[2023-03-23 20:57:46] [INFO ] Dead Transitions using invariants and state equation in 1046 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11330 ms. Remains : 1083/1083 places, 2501/2501 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-12 finished in 43180 ms.
[2023-03-23 20:57:46] [INFO ] Flatten gal took : 131 ms
[2023-03-23 20:57:46] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-23 20:57:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1235 places, 2729 transitions and 12085 arcs took 21 ms.
Total runtime 344607 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1512/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1512/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1512/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-05
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-10
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-12

BK_STOP 1679605069997

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-05
ltl formula formula --ltl=/tmp/1512/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1235 places, 2729 transitions and 12085 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.290 real 0.100 user 0.100 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1512/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1512/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1512/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1512/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-10
ltl formula formula --ltl=/tmp/1512/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1235 places, 2729 transitions and 12085 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.290 real 0.080 user 0.110 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1512/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1512/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1512/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1512/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55a675a303f4]
1: pnml2lts-mc(+0xa2496) [0x55a675a30496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fe5d459d140]
3: pnml2lts-mc(+0x405b30) [0x55a675d93b30]
4: pnml2lts-mc(+0x16b3f9) [0x55a675af93f9]
5: pnml2lts-mc(+0x164ac4) [0x55a675af2ac4]
6: pnml2lts-mc(+0x272e0a) [0x55a675c00e0a]
7: pnml2lts-mc(+0xb61f0) [0x55a675a441f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fe5d43f04d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fe5d43f067a]
10: pnml2lts-mc(+0xa1581) [0x55a675a2f581]
11: pnml2lts-mc(+0xa1910) [0x55a675a2f910]
12: pnml2lts-mc(+0xa32a2) [0x55a675a312a2]
13: pnml2lts-mc(+0xa50f4) [0x55a675a330f4]
14: pnml2lts-mc(+0xa516b) [0x55a675a3316b]
15: pnml2lts-mc(+0x3f34b3) [0x55a675d814b3]
16: pnml2lts-mc(+0x7c63d) [0x55a675a0a63d]
17: pnml2lts-mc(+0x67d86) [0x55a6759f5d86]
18: pnml2lts-mc(+0x60a8a) [0x55a6759eea8a]
19: pnml2lts-mc(+0x5eb15) [0x55a6759ecb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fe5d43d8d0a]
21: pnml2lts-mc(+0x6075e) [0x55a6759ee75e]
ltl formula name MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-12
ltl formula formula --ltl=/tmp/1512/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1235 places, 2729 transitions and 12085 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.090 user 0.110 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1512/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1512/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1512/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1512/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C04, 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 r233-tall-167856419400763"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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