MCC'2023- Execution of r453-smll-167912645400420

About the Execution of ITS-Tools for StigmergyCommit-PT-03b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
5957.672	3600000.00	13592423.00	3591.00	FFFFFFFFFF?TTTFF	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.r453-smll-167912645400420.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is StigmergyCommit-PT-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645400420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 10:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 359K Mar 5 18:23 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 StigmergyCommit-PT-03b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679334426939

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-20 17:47:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 17:47:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 17:47:10] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2023-03-20 17:47:10] [INFO ] Transformed 1231 places.
[2023-03-20 17:47:10] [INFO ] Transformed 1476 transitions.
[2023-03-20 17:47:10] [INFO ] Found NUPN structural information;
[2023-03-20 17:47:10] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 335 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA StigmergyCommit-PT-03b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 1231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 97 place count 1134 transition count 1379
Iterating global reduction 0 with 97 rules applied. Total rules applied 194 place count 1134 transition count 1379
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 253 place count 1075 transition count 1320
Iterating global reduction 0 with 59 rules applied. Total rules applied 312 place count 1075 transition count 1320
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 346 place count 1041 transition count 1286
Iterating global reduction 0 with 34 rules applied. Total rules applied 380 place count 1041 transition count 1286
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 408 place count 1013 transition count 1258
Iterating global reduction 0 with 28 rules applied. Total rules applied 436 place count 1013 transition count 1258
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 460 place count 989 transition count 1234
Iterating global reduction 0 with 24 rules applied. Total rules applied 484 place count 989 transition count 1234
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 508 place count 965 transition count 1210
Iterating global reduction 0 with 24 rules applied. Total rules applied 532 place count 965 transition count 1210
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 556 place count 941 transition count 1186
Iterating global reduction 0 with 24 rules applied. Total rules applied 580 place count 941 transition count 1186
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 604 place count 917 transition count 1162
Iterating global reduction 0 with 24 rules applied. Total rules applied 628 place count 917 transition count 1162
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 649 place count 896 transition count 1141
Iterating global reduction 0 with 21 rules applied. Total rules applied 670 place count 896 transition count 1141
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 687 place count 879 transition count 1124
Iterating global reduction 0 with 17 rules applied. Total rules applied 704 place count 879 transition count 1124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 707 place count 879 transition count 1121
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 713 place count 873 transition count 1115
Iterating global reduction 1 with 6 rules applied. Total rules applied 719 place count 873 transition count 1115
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 725 place count 867 transition count 1109
Iterating global reduction 1 with 6 rules applied. Total rules applied 731 place count 867 transition count 1109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 735 place count 863 transition count 1105
Iterating global reduction 1 with 4 rules applied. Total rules applied 739 place count 863 transition count 1105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 743 place count 859 transition count 1101
Iterating global reduction 1 with 4 rules applied. Total rules applied 747 place count 859 transition count 1101
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 751 place count 855 transition count 1097
Iterating global reduction 1 with 4 rules applied. Total rules applied 755 place count 855 transition count 1097
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 759 place count 851 transition count 1093
Iterating global reduction 1 with 4 rules applied. Total rules applied 763 place count 851 transition count 1093
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 767 place count 847 transition count 1089
Iterating global reduction 1 with 4 rules applied. Total rules applied 771 place count 847 transition count 1089
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 775 place count 843 transition count 1085
Iterating global reduction 1 with 4 rules applied. Total rules applied 779 place count 843 transition count 1085
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 783 place count 839 transition count 1081
Iterating global reduction 1 with 4 rules applied. Total rules applied 787 place count 839 transition count 1081
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 791 place count 835 transition count 1077
Iterating global reduction 1 with 4 rules applied. Total rules applied 795 place count 835 transition count 1077
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 798 place count 832 transition count 1074
Iterating global reduction 1 with 3 rules applied. Total rules applied 801 place count 832 transition count 1074
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 804 place count 829 transition count 1071
Iterating global reduction 1 with 3 rules applied. Total rules applied 807 place count 829 transition count 1071
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 810 place count 829 transition count 1068
Applied a total of 810 rules in 1350 ms. Remains 829 /1231 variables (removed 402) and now considering 1068/1476 (removed 408) transitions.
// Phase 1: matrix 1068 rows 829 cols
[2023-03-20 17:47:12] [INFO ] Computed 5 place invariants in 38 ms
[2023-03-20 17:47:13] [INFO ] Implicit Places using invariants in 674 ms returned []
[2023-03-20 17:47:13] [INFO ] Invariant cache hit.
[2023-03-20 17:47:14] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 1930 ms to find 0 implicit places.
[2023-03-20 17:47:14] [INFO ] Invariant cache hit.
[2023-03-20 17:47:15] [INFO ] Dead Transitions using invariants and state equation in 1281 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 829/1231 places, 1068/1476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4566 ms. Remains : 829/1231 places, 1068/1476 transitions.
Support contains 35 out of 829 places after structural reductions.
[2023-03-20 17:47:16] [INFO ] Flatten gal took : 241 ms
[2023-03-20 17:47:16] [INFO ] Flatten gal took : 136 ms
[2023-03-20 17:47:16] [INFO ] Input system was already deterministic with 1068 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 806 ms. (steps per millisecond=12 ) properties (out of 25) seen :5
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-20 17:47:17] [INFO ] Invariant cache hit.
[2023-03-20 17:47:18] [INFO ] After 845ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-20 17:47:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2023-03-20 17:47:22] [INFO ] After 1947ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-20 17:47:23] [INFO ] Deduced a trap composed of 299 places in 486 ms of which 11 ms to minimize.
[2023-03-20 17:47:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 620 ms
[2023-03-20 17:47:25] [INFO ] After 5018ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 1349 ms.
[2023-03-20 17:47:26] [INFO ] After 7647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 3 properties in 358 ms.
Support contains 26 out of 829 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Graph (trivial) has 781 edges and 829 vertex of which 58 / 829 are part of one of the 10 SCC in 11 ms
Free SCC test removed 48 places
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Graph (complete) has 1235 edges and 781 vertex of which 778 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 554 transitions
Trivial Post-agglo rules discarded 554 transitions
Performed 554 trivial Post agglomeration. Transition count delta: 554
Iterating post reduction 0 with 557 rules applied. Total rules applied 559 place count 778 transition count 447
Reduce places removed 554 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 567 rules applied. Total rules applied 1126 place count 224 transition count 434
Reduce places removed 5 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 16 rules applied. Total rules applied 1142 place count 219 transition count 423
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 13 rules applied. Total rules applied 1155 place count 208 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1156 place count 207 transition count 421
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 46 Pre rules applied. Total rules applied 1156 place count 207 transition count 375
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 1248 place count 161 transition count 375
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 1308 place count 131 transition count 345
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1314 place count 131 transition count 339
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1328 place count 117 transition count 273
Iterating global reduction 6 with 14 rules applied. Total rules applied 1342 place count 117 transition count 273
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1347 place count 117 transition count 268
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1356 place count 108 transition count 257
Iterating global reduction 7 with 9 rules applied. Total rules applied 1365 place count 108 transition count 257
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1372 place count 101 transition count 250
Iterating global reduction 7 with 7 rules applied. Total rules applied 1379 place count 101 transition count 250
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1382 place count 101 transition count 247
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 8 with 8 rules applied. Total rules applied 1390 place count 97 transition count 243
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1400 place count 92 transition count 258
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1402 place count 92 transition count 256
Free-agglomeration rule applied 21 times.
Iterating global reduction 8 with 21 rules applied. Total rules applied 1423 place count 92 transition count 235
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 1444 place count 71 transition count 235
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1452 place count 71 transition count 227
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1458 place count 71 transition count 227
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1460 place count 71 transition count 225
Applied a total of 1460 rules in 325 ms. Remains 71 /829 variables (removed 758) and now considering 225/1068 (removed 843) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 71/829 places, 225/1068 transitions.
Incomplete random walk after 10000 steps, including 322 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 17) seen :14
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 225 rows 71 cols
[2023-03-20 17:47:27] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 17:47:27] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-20 17:47:27] [INFO ] After 78ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 17:47:27] [INFO ] State equation strengthened by 118 read => feed constraints.
[2023-03-20 17:47:27] [INFO ] After 31ms SMT Verify possible using 118 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 17:47:27] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 17:47:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-20 17:47:27] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 17:47:27] [INFO ] After 30ms SMT Verify possible using 118 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 17:47:27] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-20 17:47:27] [INFO ] After 168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 16 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 1 ms.
Computed a total of 171 stabilizing places and 179 stable transitions
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((p0&&(G(p1)||G(p2)))))'
Support contains 3 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 822 transition count 1061
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 822 transition count 1061
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 817 transition count 1056
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 817 transition count 1056
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 813 transition count 1052
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 813 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 809 transition count 1048
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 809 transition count 1048
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 805 transition count 1044
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 805 transition count 1044
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 801 transition count 1040
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 801 transition count 1040
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 798 transition count 1037
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 798 transition count 1037
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 798 transition count 1036
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 797 transition count 1035
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 797 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 796 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 796 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 795 transition count 1033
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 795 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 794 transition count 1032
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 794 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 793 transition count 1031
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 793 transition count 1031
Applied a total of 73 rules in 582 ms. Remains 793 /829 variables (removed 36) and now considering 1031/1068 (removed 37) transitions.
// Phase 1: matrix 1031 rows 793 cols
[2023-03-20 17:47:28] [INFO ] Computed 5 place invariants in 13 ms
[2023-03-20 17:47:29] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-20 17:47:29] [INFO ] Invariant cache hit.
[2023-03-20 17:47:30] [INFO ] Implicit Places using invariants and state equation in 1166 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
[2023-03-20 17:47:30] [INFO ] Invariant cache hit.
[2023-03-20 17:47:31] [INFO ] Dead Transitions using invariants and state equation in 1503 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 793/829 places, 1031/1068 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3670 ms. Remains : 793/829 places, 1031/1068 transitions.
Stuttering acceptance computed with spot in 595 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(EQ s118 1), p1:(EQ s538 0), p0:(EQ s786 1)], 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-00 finished in 4355 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' '!(((p0&&X(p0)) U X(G((F(p2)&&p1)))))'
Support contains 6 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 820 transition count 1059
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 820 transition count 1059
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 815 transition count 1054
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 815 transition count 1054
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 811 transition count 1050
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 811 transition count 1050
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 807 transition count 1046
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 807 transition count 1046
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 803 transition count 1042
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 803 transition count 1042
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 799 transition count 1038
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 799 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 796 transition count 1035
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 796 transition count 1035
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 796 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 795 transition count 1033
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 795 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 794 transition count 1032
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 794 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 793 transition count 1031
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 793 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 792 transition count 1030
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 792 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 791 transition count 1029
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 791 transition count 1029
Applied a total of 77 rules in 650 ms. Remains 791 /829 variables (removed 38) and now considering 1029/1068 (removed 39) transitions.
// Phase 1: matrix 1029 rows 791 cols
[2023-03-20 17:47:33] [INFO ] Computed 5 place invariants in 11 ms
[2023-03-20 17:47:33] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-20 17:47:33] [INFO ] Invariant cache hit.
[2023-03-20 17:47:34] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
[2023-03-20 17:47:34] [INFO ] Invariant cache hit.
[2023-03-20 17:47:35] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 791/829 places, 1029/1068 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3185 ms. Remains : 791/829 places, 1029/1068 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s230 1), p1:(AND (EQ s77 1) (EQ s291 1) (EQ s505 1) (EQ s678 1)), p2:(EQ s540 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-01 finished in 3487 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(X(X((p0&&X(G((G((p2||X(p3)))||p1)))))))))'
Support contains 6 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 820 transition count 1059
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 820 transition count 1059
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 814 transition count 1053
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 814 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 814 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 810 transition count 1048
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 810 transition count 1048
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 806 transition count 1044
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 806 transition count 1044
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 802 transition count 1040
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 802 transition count 1040
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 798 transition count 1036
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 798 transition count 1036
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 795 transition count 1033
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 795 transition count 1033
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 795 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 794 transition count 1031
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 794 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 793 transition count 1030
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 793 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 792 transition count 1029
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 792 transition count 1029
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 791 transition count 1028
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 791 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 790 transition count 1027
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 790 transition count 1027
Applied a total of 80 rules in 634 ms. Remains 790 /829 variables (removed 39) and now considering 1027/1068 (removed 41) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2023-03-20 17:47:36] [INFO ] Computed 5 place invariants in 11 ms
[2023-03-20 17:47:37] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-20 17:47:37] [INFO ] Invariant cache hit.
[2023-03-20 17:47:38] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1395 ms to find 0 implicit places.
[2023-03-20 17:47:38] [INFO ] Invariant cache hit.
[2023-03-20 17:47:39] [INFO ] Dead Transitions using invariants and state equation in 1367 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/829 places, 1027/1068 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3398 ms. Remains : 790/829 places, 1027/1068 transitions.
Stuttering acceptance computed with spot in 451 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-02 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: 5}], [{ cond=(NOT p3), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND p2 p3), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 7}]], initial=8, aps=[p0:(OR (NEQ s77 1) (NEQ s270 1) (NEQ s463 1) (NEQ s656 1)), p3:(NEQ s661 1), p2:(NEQ s401 1), p1:(OR (NEQ s77 1) (NEQ s270 1) (NEQ s463 1) (NEQ s656 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1286 reset in 576 ms.
Product exploration explored 100000 steps with 1272 reset in 389 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p0 p3 p2 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 9 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 460 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Incomplete random walk after 10000 steps, including 128 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-20 17:47:42] [INFO ] Invariant cache hit.
[2023-03-20 17:47:42] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2023-03-20 17:47:43] [INFO ] After 664ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3 real:2
[2023-03-20 17:47:43] [INFO ] After 1078ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :3 real:2
Attempting to minimize the solution found.
Minimization took 254 ms.
[2023-03-20 17:47:44] [INFO ] After 1651ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :3 real:2
[2023-03-20 17:47:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2023-03-20 17:47:45] [INFO ] After 984ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-20 17:47:46] [INFO ] After 1487ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 277 ms.
[2023-03-20 17:47:46] [INFO ] After 2185ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 36 ms.
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Graph (trivial) has 784 edges and 790 vertex of which 61 / 790 are part of one of the 11 SCC in 4 ms
Free SCC test removed 50 places
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 1188 edges and 740 vertex of which 736 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 551 transitions
Trivial Post-agglo rules discarded 551 transitions
Performed 551 trivial Post agglomeration. Transition count delta: 551
Iterating post reduction 0 with 555 rules applied. Total rules applied 557 place count 736 transition count 404
Reduce places removed 551 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 565 rules applied. Total rules applied 1122 place count 185 transition count 390
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 1129 place count 180 transition count 388
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1131 place count 178 transition count 388
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1131 place count 178 transition count 342
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1223 place count 132 transition count 342
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1224 place count 132 transition count 341
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1282 place count 103 transition count 312
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1289 place count 103 transition count 305
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1313 place count 79 transition count 152
Iterating global reduction 6 with 24 rules applied. Total rules applied 1337 place count 79 transition count 152
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1350 place count 79 transition count 139
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1361 place count 68 transition count 128
Iterating global reduction 7 with 11 rules applied. Total rules applied 1372 place count 68 transition count 128
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1380 place count 60 transition count 120
Iterating global reduction 7 with 8 rules applied. Total rules applied 1388 place count 60 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1392 place count 60 transition count 116
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1402 place count 55 transition count 111
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1410 place count 51 transition count 132
Free-agglomeration rule applied 21 times with reduction of 7 identical transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 1431 place count 51 transition count 104
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 27 rules applied. Total rules applied 1458 place count 30 transition count 98
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1462 place count 26 transition count 94
Iterating global reduction 9 with 4 rules applied. Total rules applied 1466 place count 26 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1467 place count 26 transition count 93
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 1493 place count 26 transition count 67
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1497 place count 24 transition count 85
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1501 place count 24 transition count 81
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1503 place count 24 transition count 81
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1504 place count 24 transition count 80
Applied a total of 1504 rules in 119 ms. Remains 24 /790 variables (removed 766) and now considering 80/1027 (removed 947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 24/790 places, 80/1027 transitions.
Finished random walk after 79 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=26 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 p2 p1), true, (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p3 p2))), (F (AND p2 (NOT p1))), (F (NOT p0)), (F (AND p3 (NOT p2))), (F (NOT p3)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 355 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 9 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 544 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 509 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Support contains 6 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Applied a total of 0 rules in 37 ms. Remains 790 /790 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
[2023-03-20 17:47:47] [INFO ] Invariant cache hit.
[2023-03-20 17:47:48] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-20 17:47:48] [INFO ] Invariant cache hit.
[2023-03-20 17:47:49] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
[2023-03-20 17:47:49] [INFO ] Invariant cache hit.
[2023-03-20 17:47:50] [INFO ] Dead Transitions using invariants and state equation in 1204 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2577 ms. Remains : 790/790 places, 1027/1027 transitions.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p0 p3 p2 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 9 states, 14 edges and 4 AP (stutter sensitive) to 9 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 514 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Incomplete random walk after 10000 steps, including 127 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 17:47:51] [INFO ] Invariant cache hit.
[2023-03-20 17:47:52] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2023-03-20 17:47:52] [INFO ] After 702ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-20 17:47:53] [INFO ] After 913ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-20 17:47:53] [INFO ] After 1358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-20 17:47:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2023-03-20 17:47:54] [INFO ] After 915ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 17:47:54] [INFO ] After 1347ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 285 ms.
[2023-03-20 17:47:55] [INFO ] After 1996ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 27 ms.
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Graph (trivial) has 784 edges and 790 vertex of which 61 / 790 are part of one of the 11 SCC in 3 ms
Free SCC test removed 50 places
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 1188 edges and 740 vertex of which 736 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 551 transitions
Trivial Post-agglo rules discarded 551 transitions
Performed 551 trivial Post agglomeration. Transition count delta: 551
Iterating post reduction 0 with 555 rules applied. Total rules applied 557 place count 736 transition count 404
Reduce places removed 551 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 565 rules applied. Total rules applied 1122 place count 185 transition count 390
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 1129 place count 180 transition count 388
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1131 place count 178 transition count 388
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1131 place count 178 transition count 342
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1223 place count 132 transition count 342
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1224 place count 132 transition count 341
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1282 place count 103 transition count 312
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1289 place count 103 transition count 305
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1313 place count 79 transition count 152
Iterating global reduction 6 with 24 rules applied. Total rules applied 1337 place count 79 transition count 152
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1350 place count 79 transition count 139
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1361 place count 68 transition count 128
Iterating global reduction 7 with 11 rules applied. Total rules applied 1372 place count 68 transition count 128
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1380 place count 60 transition count 120
Iterating global reduction 7 with 8 rules applied. Total rules applied 1388 place count 60 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1392 place count 60 transition count 116
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1402 place count 55 transition count 111
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1410 place count 51 transition count 132
Free-agglomeration rule applied 21 times with reduction of 7 identical transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 1431 place count 51 transition count 104
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 27 rules applied. Total rules applied 1458 place count 30 transition count 98
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1462 place count 26 transition count 94
Iterating global reduction 9 with 4 rules applied. Total rules applied 1466 place count 26 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1467 place count 26 transition count 93
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 1493 place count 26 transition count 67
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1497 place count 24 transition count 85
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1501 place count 24 transition count 81
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1503 place count 24 transition count 81
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1504 place count 24 transition count 80
Applied a total of 1504 rules in 72 ms. Remains 24 /790 variables (removed 766) and now considering 80/1027 (removed 947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 24/790 places, 80/1027 transitions.
Finished random walk after 81 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND p0 p3 p2 p1), true]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p3 p2))), (F (NOT p1)), (F (NOT p0)), (F (AND p3 (NOT p2))), (F (NOT p3))]
Knowledge based reduction with 2 factoid took 346 ms. Reduced automaton from 9 states, 14 edges and 4 AP (stutter sensitive) to 9 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 470 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 425 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 488 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 1278 reset in 225 ms.
Product exploration explored 100000 steps with 1278 reset in 243 ms.
Built C files in :
/tmp/ltsmin14495216050746326057
[2023-03-20 17:47:57] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14495216050746326057
Running compilation step : cd /tmp/ltsmin14495216050746326057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14495216050746326057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14495216050746326057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Applied a total of 0 rules in 22 ms. Remains 790 /790 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
[2023-03-20 17:48:00] [INFO ] Invariant cache hit.
[2023-03-20 17:48:01] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-20 17:48:01] [INFO ] Invariant cache hit.
[2023-03-20 17:48:02] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1459 ms to find 0 implicit places.
[2023-03-20 17:48:02] [INFO ] Invariant cache hit.
[2023-03-20 17:48:03] [INFO ] Dead Transitions using invariants and state equation in 1348 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2831 ms. Remains : 790/790 places, 1027/1027 transitions.
Built C files in :
/tmp/ltsmin2345885349172232377
[2023-03-20 17:48:03] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2345885349172232377
Running compilation step : cd /tmp/ltsmin2345885349172232377;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2345885349172232377;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2345885349172232377;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-20 17:48:07] [INFO ] Flatten gal took : 99 ms
[2023-03-20 17:48:07] [INFO ] Flatten gal took : 92 ms
[2023-03-20 17:48:07] [INFO ] Time to serialize gal into /tmp/LTL15226246961920899541.gal : 16 ms
[2023-03-20 17:48:07] [INFO ] Time to serialize properties into /tmp/LTL9375647224084324079.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15226246961920899541.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13228874395679731820.hoa' '-atoms' '/tmp/LTL9375647224084324079.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9375647224084324079.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13228874395679731820.hoa
Detected timeout of ITS tools.
[2023-03-20 17:48:22] [INFO ] Flatten gal took : 44 ms
[2023-03-20 17:48:22] [INFO ] Flatten gal took : 44 ms
[2023-03-20 17:48:22] [INFO ] Time to serialize gal into /tmp/LTL6963774073909094767.gal : 7 ms
[2023-03-20 17:48:22] [INFO ] Time to serialize properties into /tmp/LTL15227215015496301248.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6963774073909094767.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15227215015496301248.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X((X(G(("(((p94!=1)||(p396!=1))||((p698!=1)||(p1000!=1)))")||(G(("(p622!=1)")||(X("(p1005!=1)")))))))&&("(((p94!=1)||(p396!=1...191
Formula 0 simplified : XXXX(!"(((p94!=1)||(p396!=1))||((p698!=1)||(p1000!=1)))" | XF(!"(((p94!=1)||(p396!=1))||((p698!=1)||(p1000!=1)))" & F(!"(p622!=1)" &...173
Detected timeout of ITS tools.
[2023-03-20 17:48:37] [INFO ] Flatten gal took : 38 ms
[2023-03-20 17:48:37] [INFO ] Applying decomposition
[2023-03-20 17:48:37] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5820783682078814862.txt' '-o' '/tmp/graph5820783682078814862.bin' '-w' '/tmp/graph5820783682078814862.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5820783682078814862.bin' '-l' '-1' '-v' '-w' '/tmp/graph5820783682078814862.weights' '-q' '0' '-e' '0.001'
[2023-03-20 17:48:37] [INFO ] Decomposing Gal with order
[2023-03-20 17:48:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 17:48:38] [INFO ] Removed a total of 863 redundant transitions.
[2023-03-20 17:48:38] [INFO ] Flatten gal took : 248 ms
[2023-03-20 17:48:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2023-03-20 17:48:38] [INFO ] Time to serialize gal into /tmp/LTL12396617672775869729.gal : 23 ms
[2023-03-20 17:48:38] [INFO ] Time to serialize properties into /tmp/LTL11931177626465644773.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12396617672775869729.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11931177626465644773.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X((X(G(("(((i9.u34.p94!=1)||(i9.u114.p396!=1))||((i9.u195.p698!=1)||(i9.u276.p1000!=1)))")||(G(("(i18.u166.p622!=1)")||(X("(i...277
Formula 0 simplified : XXXX(!"(((i9.u34.p94!=1)||(i9.u114.p396!=1))||((i9.u195.p698!=1)||(i9.u276.p1000!=1)))" | XF(!"(((i9.u34.p94!=1)||(i9.u114.p396!=1))...259
Reverse transition relation is NOT exact ! Due to transitions t78, t163, t219, t259, t344, t345, t401, t435, t525, t578, t581, t614, t708, t709, t765, t785...592
Computing Next relation with stutter on 81276 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3555011641214286189
[2023-03-20 17:48:53] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3555011641214286189
Running compilation step : cd /tmp/ltsmin3555011641214286189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3555011641214286189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3555011641214286189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property StigmergyCommit-PT-03b-LTLFireability-02 finished in 80356 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)||G(!p0))))'
Support contains 1 out of 829 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Graph (trivial) has 821 edges and 829 vertex of which 69 / 829 are part of one of the 12 SCC in 4 ms
Free SCC test removed 57 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 572 transitions
Trivial Post-agglo rules discarded 572 transitions
Performed 572 trivial Post agglomeration. Transition count delta: 572
Iterating post reduction 0 with 572 rules applied. Total rules applied 573 place count 771 transition count 430
Reduce places removed 572 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 1 with 587 rules applied. Total rules applied 1160 place count 199 transition count 415
Reduce places removed 6 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 12 rules applied. Total rules applied 1172 place count 193 transition count 409
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1178 place count 187 transition count 409
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 1178 place count 187 transition count 371
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 1254 place count 149 transition count 371
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1261 place count 142 transition count 364
Iterating global reduction 4 with 7 rules applied. Total rules applied 1268 place count 142 transition count 364
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1268 place count 142 transition count 363
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1270 place count 141 transition count 363
Performed 30 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 1330 place count 111 transition count 332
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 1355 place count 86 transition count 181
Iterating global reduction 4 with 25 rules applied. Total rules applied 1380 place count 86 transition count 181
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1392 place count 86 transition count 169
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1404 place count 74 transition count 153
Iterating global reduction 5 with 12 rules applied. Total rules applied 1416 place count 74 transition count 153
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1428 place count 62 transition count 137
Iterating global reduction 5 with 12 rules applied. Total rules applied 1440 place count 62 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1444 place count 62 transition count 133
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1460 place count 54 transition count 140
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1461 place count 53 transition count 132
Iterating global reduction 6 with 1 rules applied. Total rules applied 1462 place count 53 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1463 place count 53 transition count 131
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1467 place count 53 transition count 127
Applied a total of 1467 rules in 133 ms. Remains 53 /829 variables (removed 776) and now considering 127/1068 (removed 941) transitions.
[2023-03-20 17:48:56] [INFO ] Flow matrix only has 123 transitions (discarded 4 similar events)
// Phase 1: matrix 123 rows 53 cols
[2023-03-20 17:48:56] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-20 17:48:56] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-20 17:48:56] [INFO ] Flow matrix only has 123 transitions (discarded 4 similar events)
[2023-03-20 17:48:56] [INFO ] Invariant cache hit.
[2023-03-20 17:48:56] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-20 17:48:56] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-20 17:48:56] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-20 17:48:56] [INFO ] Flow matrix only has 123 transitions (discarded 4 similar events)
[2023-03-20 17:48:56] [INFO ] Invariant cache hit.
[2023-03-20 17:48:56] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/829 places, 127/1068 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 548 ms. Remains : 53/829 places, 127/1068 transitions.
Stuttering acceptance computed with spot in 54 ms :[false]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s26 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13255 reset in 639 ms.
Stack based approach found an accepted trace after 273 steps with 35 reset with depth 8 and stack size 8 in 3 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-03 finished in 1269 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)&&X(F(p1))))'
Support contains 5 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 820 transition count 1059
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 820 transition count 1059
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 814 transition count 1053
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 814 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 814 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 810 transition count 1048
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 810 transition count 1048
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 806 transition count 1044
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 806 transition count 1044
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 802 transition count 1040
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 802 transition count 1040
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 798 transition count 1036
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 798 transition count 1036
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 795 transition count 1033
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 795 transition count 1033
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 795 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 794 transition count 1031
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 794 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 793 transition count 1030
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 793 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 792 transition count 1029
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 792 transition count 1029
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 791 transition count 1028
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 791 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 790 transition count 1027
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 790 transition count 1027
Applied a total of 80 rules in 467 ms. Remains 790 /829 variables (removed 39) and now considering 1027/1068 (removed 41) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2023-03-20 17:48:58] [INFO ] Computed 5 place invariants in 18 ms
[2023-03-20 17:48:58] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-20 17:48:58] [INFO ] Invariant cache hit.
[2023-03-20 17:48:59] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
[2023-03-20 17:48:59] [INFO ] Invariant cache hit.
[2023-03-20 17:49:00] [INFO ] Dead Transitions using invariants and state equation in 1247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/829 places, 1027/1068 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2850 ms. Remains : 790/829 places, 1027/1068 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s42 1) (EQ s256 1) (EQ s407 1) (EQ s621 1)), p1:(AND (OR (EQ s42 0) (EQ s256 0) (EQ s407 0) (EQ s621 0)) (EQ s540 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-04 finished in 3023 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)))'
Support contains 1 out of 829 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Graph (trivial) has 827 edges and 829 vertex of which 69 / 829 are part of one of the 12 SCC in 2 ms
Free SCC test removed 57 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 576 transitions
Trivial Post-agglo rules discarded 576 transitions
Performed 576 trivial Post agglomeration. Transition count delta: 576
Iterating post reduction 0 with 576 rules applied. Total rules applied 577 place count 771 transition count 426
Reduce places removed 576 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 1 with 591 rules applied. Total rules applied 1168 place count 195 transition count 411
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1174 place count 189 transition count 411
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 1174 place count 189 transition count 371
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1254 place count 149 transition count 371
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1260 place count 143 transition count 365
Iterating global reduction 3 with 6 rules applied. Total rules applied 1266 place count 143 transition count 365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1266 place count 143 transition count 364
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1268 place count 142 transition count 364
Performed 30 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1328 place count 112 transition count 333
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1352 place count 88 transition count 183
Iterating global reduction 3 with 24 rules applied. Total rules applied 1376 place count 88 transition count 183
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1388 place count 88 transition count 171
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1399 place count 77 transition count 156
Iterating global reduction 4 with 11 rules applied. Total rules applied 1410 place count 77 transition count 156
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1421 place count 66 transition count 141
Iterating global reduction 4 with 11 rules applied. Total rules applied 1432 place count 66 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1435 place count 66 transition count 138
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1451 place count 58 transition count 152
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1452 place count 57 transition count 144
Iterating global reduction 5 with 1 rules applied. Total rules applied 1453 place count 57 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1454 place count 57 transition count 143
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1458 place count 57 transition count 139
Applied a total of 1458 rules in 67 ms. Remains 57 /829 variables (removed 772) and now considering 139/1068 (removed 929) transitions.
[2023-03-20 17:49:00] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
// Phase 1: matrix 134 rows 57 cols
[2023-03-20 17:49:00] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-20 17:49:00] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-20 17:49:00] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2023-03-20 17:49:00] [INFO ] Invariant cache hit.
[2023-03-20 17:49:00] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-20 17:49:01] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-20 17:49:01] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-20 17:49:01] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2023-03-20 17:49:01] [INFO ] Invariant cache hit.
[2023-03-20 17:49:01] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/829 places, 139/1068 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 517 ms. Remains : 57/829 places, 139/1068 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-05 finished in 640 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) U p1) U p2))))'
Support contains 6 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 822 transition count 1061
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 822 transition count 1061
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 816 transition count 1055
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 816 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 816 transition count 1054
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 812 transition count 1050
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 812 transition count 1050
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 808 transition count 1046
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 808 transition count 1046
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 804 transition count 1042
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 804 transition count 1042
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 800 transition count 1038
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 800 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 797 transition count 1035
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 797 transition count 1035
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 797 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 796 transition count 1033
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 796 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 795 transition count 1032
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 795 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 794 transition count 1031
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 794 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 793 transition count 1030
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 793 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 792 transition count 1029
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 792 transition count 1029
Applied a total of 76 rules in 557 ms. Remains 792 /829 variables (removed 37) and now considering 1029/1068 (removed 39) transitions.
// Phase 1: matrix 1029 rows 792 cols
[2023-03-20 17:49:01] [INFO ] Computed 5 place invariants in 19 ms
[2023-03-20 17:49:02] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-20 17:49:02] [INFO ] Invariant cache hit.
[2023-03-20 17:49:03] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned []
Implicit Place search using SMT with State Equation took 1501 ms to find 0 implicit places.
[2023-03-20 17:49:03] [INFO ] Invariant cache hit.
[2023-03-20 17:49:04] [INFO ] Dead Transitions using invariants and state equation in 985 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 792/829 places, 1029/1068 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3046 ms. Remains : 792/829 places, 1029/1068 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s10 1) (AND (EQ s157 1) (EQ s351 1) (EQ s543 1) (EQ s737 1))), p1:(AND (EQ s157 1) (EQ s351 1) (EQ s543 1) (EQ s737 1)), p0:(EQ s702 1)], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-07 finished in 3340 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||G(p1))))))'
Support contains 5 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 821 transition count 1060
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 821 transition count 1060
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 816 transition count 1055
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 816 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 816 transition count 1054
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 813 transition count 1051
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 813 transition count 1051
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 810 transition count 1048
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 810 transition count 1048
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 807 transition count 1045
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 807 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 804 transition count 1042
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 804 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 802 transition count 1040
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 802 transition count 1040
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 801 transition count 1039
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 801 transition count 1039
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 800 transition count 1038
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 800 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 799 transition count 1037
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 799 transition count 1037
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 798 transition count 1036
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 798 transition count 1036
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 797 transition count 1035
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 797 transition count 1035
Applied a total of 65 rules in 558 ms. Remains 797 /829 variables (removed 32) and now considering 1035/1068 (removed 33) transitions.
// Phase 1: matrix 1035 rows 797 cols
[2023-03-20 17:49:05] [INFO ] Computed 5 place invariants in 11 ms
[2023-03-20 17:49:05] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-20 17:49:05] [INFO ] Invariant cache hit.
[2023-03-20 17:49:06] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
[2023-03-20 17:49:06] [INFO ] Invariant cache hit.
[2023-03-20 17:49:07] [INFO ] Dead Transitions using invariants and state equation in 1096 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 797/829 places, 1035/1068 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2810 ms. Remains : 797/829 places, 1035/1068 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (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=[p1:(EQ s347 0), p0:(AND (EQ s63 1) (EQ s235 1) (EQ s435 1) (EQ s628 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1289 reset in 291 ms.
Product exploration explored 100000 steps with 1286 reset in 409 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 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 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 131 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 403844 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 403844 steps, saw 80290 distinct states, run finished after 3003 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 17:49:11] [INFO ] Invariant cache hit.
[2023-03-20 17:49:12] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 17:49:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2023-03-20 17:49:13] [INFO ] After 828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 17:49:13] [INFO ] Deduced a trap composed of 302 places in 736 ms of which 3 ms to minimize.
[2023-03-20 17:49:14] [INFO ] Deduced a trap composed of 299 places in 522 ms of which 1 ms to minimize.
[2023-03-20 17:49:15] [INFO ] Deduced a trap composed of 299 places in 679 ms of which 2 ms to minimize.
[2023-03-20 17:49:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2200 ms
[2023-03-20 17:49:15] [INFO ] After 3185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-20 17:49:15] [INFO ] After 3547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Graph (trivial) has 791 edges and 797 vertex of which 68 / 797 are part of one of the 12 SCC in 2 ms
Free SCC test removed 56 places
Drop transitions removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1188 edges and 741 vertex of which 737 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 554 transitions
Trivial Post-agglo rules discarded 554 transitions
Performed 554 trivial Post agglomeration. Transition count delta: 554
Iterating post reduction 0 with 558 rules applied. Total rules applied 560 place count 737 transition count 401
Reduce places removed 554 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 566 rules applied. Total rules applied 1126 place count 183 transition count 389
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1130 place count 179 transition count 389
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1130 place count 179 transition count 344
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1220 place count 134 transition count 344
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1221 place count 134 transition count 343
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1279 place count 105 transition count 314
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1287 place count 105 transition count 306
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1308 place count 84 transition count 217
Iterating global reduction 5 with 21 rules applied. Total rules applied 1329 place count 84 transition count 217
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1338 place count 84 transition count 208
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1350 place count 72 transition count 196
Iterating global reduction 6 with 12 rules applied. Total rules applied 1362 place count 72 transition count 196
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1370 place count 64 transition count 188
Iterating global reduction 6 with 8 rules applied. Total rules applied 1378 place count 64 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1382 place count 64 transition count 184
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 7 with 8 rules applied. Total rules applied 1390 place count 60 transition count 180
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1398 place count 56 transition count 201
Free-agglomeration rule applied 26 times with reduction of 7 identical transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1424 place count 56 transition count 168
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 44 rules applied. Total rules applied 1468 place count 30 transition count 150
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1472 place count 26 transition count 146
Iterating global reduction 8 with 4 rules applied. Total rules applied 1476 place count 26 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1477 place count 26 transition count 145
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 9 with 61 rules applied. Total rules applied 1538 place count 26 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1542 place count 24 transition count 102
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1548 place count 24 transition count 96
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1550 place count 24 transition count 96
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1551 place count 24 transition count 95
Applied a total of 1551 rules in 97 ms. Remains 24 /797 variables (removed 773) and now considering 95/1035 (removed 940) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 24/797 places, 95/1035 transitions.
Finished random walk after 28 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 253 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 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 797 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Applied a total of 0 rules in 45 ms. Remains 797 /797 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
[2023-03-20 17:49:16] [INFO ] Invariant cache hit.
[2023-03-20 17:49:16] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-20 17:49:16] [INFO ] Invariant cache hit.
[2023-03-20 17:49:17] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1250 ms to find 0 implicit places.
[2023-03-20 17:49:17] [INFO ] Invariant cache hit.
[2023-03-20 17:49:18] [INFO ] Dead Transitions using invariants and state equation in 954 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2252 ms. Remains : 797/797 places, 1035/1035 transitions.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 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 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 125 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 458055 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 458055 steps, saw 90089 distinct states, run finished after 3002 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 17:49:22] [INFO ] Invariant cache hit.
[2023-03-20 17:49:22] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 17:49:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-20 17:49:22] [INFO ] After 623ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 17:49:23] [INFO ] Deduced a trap composed of 302 places in 811 ms of which 10 ms to minimize.
[2023-03-20 17:49:24] [INFO ] Deduced a trap composed of 299 places in 687 ms of which 2 ms to minimize.
[2023-03-20 17:49:25] [INFO ] Deduced a trap composed of 299 places in 665 ms of which 1 ms to minimize.
[2023-03-20 17:49:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2443 ms
[2023-03-20 17:49:25] [INFO ] After 3254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-20 17:49:25] [INFO ] After 3592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Graph (trivial) has 791 edges and 797 vertex of which 68 / 797 are part of one of the 12 SCC in 2 ms
Free SCC test removed 56 places
Drop transitions removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1188 edges and 741 vertex of which 737 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 554 transitions
Trivial Post-agglo rules discarded 554 transitions
Performed 554 trivial Post agglomeration. Transition count delta: 554
Iterating post reduction 0 with 558 rules applied. Total rules applied 560 place count 737 transition count 401
Reduce places removed 554 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 566 rules applied. Total rules applied 1126 place count 183 transition count 389
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1130 place count 179 transition count 389
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1130 place count 179 transition count 344
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1220 place count 134 transition count 344
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1221 place count 134 transition count 343
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1279 place count 105 transition count 314
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1287 place count 105 transition count 306
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1308 place count 84 transition count 217
Iterating global reduction 5 with 21 rules applied. Total rules applied 1329 place count 84 transition count 217
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1338 place count 84 transition count 208
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1350 place count 72 transition count 196
Iterating global reduction 6 with 12 rules applied. Total rules applied 1362 place count 72 transition count 196
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1370 place count 64 transition count 188
Iterating global reduction 6 with 8 rules applied. Total rules applied 1378 place count 64 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1382 place count 64 transition count 184
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 7 with 8 rules applied. Total rules applied 1390 place count 60 transition count 180
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1398 place count 56 transition count 201
Free-agglomeration rule applied 26 times with reduction of 7 identical transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1424 place count 56 transition count 168
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 44 rules applied. Total rules applied 1468 place count 30 transition count 150
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1472 place count 26 transition count 146
Iterating global reduction 8 with 4 rules applied. Total rules applied 1476 place count 26 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1477 place count 26 transition count 145
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 9 with 61 rules applied. Total rules applied 1538 place count 26 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1542 place count 24 transition count 102
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1548 place count 24 transition count 96
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1550 place count 24 transition count 96
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1551 place count 24 transition count 95
Applied a total of 1551 rules in 80 ms. Remains 24 /797 variables (removed 773) and now considering 95/1035 (removed 940) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 24/797 places, 95/1035 transitions.
Finished random walk after 47 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 320 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 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1284 reset in 179 ms.
Product exploration explored 100000 steps with 1288 reset in 282 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 797 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Graph (trivial) has 791 edges and 797 vertex of which 68 / 797 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Performed 546 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 546 rules applied. Total rules applied 547 place count 741 transition count 971
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 555 place count 741 transition count 963
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 555 place count 741 transition count 967
Deduced a syphon composed of 578 places in 1 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 587 place count 741 transition count 967
Discarding 490 places :
Symmetric choice reduction at 2 with 490 rule applications. Total rules 1077 place count 251 transition count 477
Deduced a syphon composed of 91 places in 1 ms
Iterating global reduction 2 with 490 rules applied. Total rules applied 1567 place count 251 transition count 477
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 1612 place count 251 transition count 490
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 1682 place count 181 transition count 348
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 1752 place count 181 transition count 348
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1765 place count 181 transition count 335
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1794 place count 152 transition count 302
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 3 with 29 rules applied. Total rules applied 1823 place count 152 transition count 302
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1835 place count 140 transition count 290
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1847 place count 140 transition count 290
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1851 place count 140 transition count 286
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1859 place count 132 transition count 278
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 1867 place count 132 transition count 278
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1874 place count 132 transition count 313
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1885 place count 121 transition count 291
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 1896 place count 121 transition count 291
Deduced a syphon composed of 58 places in 0 ms
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 1904 place count 121 transition count 283
Deduced a syphon composed of 58 places in 0 ms
Applied a total of 1904 rules in 196 ms. Remains 121 /797 variables (removed 676) and now considering 283/1035 (removed 752) transitions.
[2023-03-20 17:49:27] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-20 17:49:27] [INFO ] Flow matrix only has 278 transitions (discarded 5 similar events)
// Phase 1: matrix 278 rows 121 cols
[2023-03-20 17:49:27] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-20 17:49:27] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/797 places, 283/1035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 498 ms. Remains : 121/797 places, 283/1035 transitions.
Built C files in :
/tmp/ltsmin1464989537207680129
[2023-03-20 17:49:27] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1464989537207680129
Running compilation step : cd /tmp/ltsmin1464989537207680129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2999 ms.
Running link step : cd /tmp/ltsmin1464989537207680129;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 181 ms.
Running LTSmin : cd /tmp/ltsmin1464989537207680129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17552994884730274119.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 797 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Applied a total of 0 rules in 26 ms. Remains 797 /797 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
// Phase 1: matrix 1035 rows 797 cols
[2023-03-20 17:49:43] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-20 17:49:43] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-20 17:49:43] [INFO ] Invariant cache hit.
[2023-03-20 17:49:44] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
[2023-03-20 17:49:44] [INFO ] Invariant cache hit.
[2023-03-20 17:49:45] [INFO ] Dead Transitions using invariants and state equation in 1227 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2283 ms. Remains : 797/797 places, 1035/1035 transitions.
Built C files in :
/tmp/ltsmin4562353014420880021
[2023-03-20 17:49:45] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4562353014420880021
Running compilation step : cd /tmp/ltsmin4562353014420880021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2672 ms.
Running link step : cd /tmp/ltsmin4562353014420880021;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin4562353014420880021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13369303448648180116.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-20 17:50:00] [INFO ] Flatten gal took : 31 ms
[2023-03-20 17:50:00] [INFO ] Flatten gal took : 31 ms
[2023-03-20 17:50:00] [INFO ] Time to serialize gal into /tmp/LTL10031654551575394579.gal : 7 ms
[2023-03-20 17:50:00] [INFO ] Time to serialize properties into /tmp/LTL14457176638379052150.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10031654551575394579.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7468173462521956459.hoa' '-atoms' '/tmp/LTL14457176638379052150.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14457176638379052150.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7468173462521956459.hoa
Detected timeout of ITS tools.
[2023-03-20 17:50:15] [INFO ] Flatten gal took : 30 ms
[2023-03-20 17:50:15] [INFO ] Flatten gal took : 31 ms
[2023-03-20 17:50:15] [INFO ] Time to serialize gal into /tmp/LTL9343595241823992115.gal : 7 ms
[2023-03-20 17:50:15] [INFO ] Time to serialize properties into /tmp/LTL6331566040919080571.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9343595241823992115.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6331566040919080571.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(p513==0)"))||("(((p72==1)&&(p351==1))&&((p653==1)&&(p955==1)))"))))))
Formula 0 simplified : XXG(!"(((p72==1)&&(p351==1))&&((p653==1)&&(p955==1)))" & F!"(p513==0)")
Detected timeout of ITS tools.
[2023-03-20 17:50:30] [INFO ] Flatten gal took : 29 ms
[2023-03-20 17:50:30] [INFO ] Applying decomposition
[2023-03-20 17:50:30] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17736365019451642513.txt' '-o' '/tmp/graph17736365019451642513.bin' '-w' '/tmp/graph17736365019451642513.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17736365019451642513.bin' '-l' '-1' '-v' '-w' '/tmp/graph17736365019451642513.weights' '-q' '0' '-e' '0.001'
[2023-03-20 17:50:30] [INFO ] Decomposing Gal with order
[2023-03-20 17:50:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 17:50:31] [INFO ] Removed a total of 865 redundant transitions.
[2023-03-20 17:50:31] [INFO ] Flatten gal took : 113 ms
[2023-03-20 17:50:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 18 ms.
[2023-03-20 17:50:31] [INFO ] Time to serialize gal into /tmp/LTL6047779969351542375.gal : 16 ms
[2023-03-20 17:50:31] [INFO ] Time to serialize properties into /tmp/LTL6035735344183990282.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6047779969351542375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6035735344183990282.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(i10.u146.p513==0)"))||("(((i3.u28.p72==1)&&(i3.u83.p351==1))&&((i3.u182.p653==1)&&(i3.u249.p955==1)))"))))))
Formula 0 simplified : XXG(!"(((i3.u28.p72==1)&&(i3.u83.p351==1))&&((i3.u182.p653==1)&&(i3.u249.p955==1)))" & F!"(i10.u146.p513==0)")
Reverse transition relation is NOT exact ! Due to transitions t78, t163, t216, t219, t259, t289, t345, t401, t435, t525, t614, t709, t762, t765, t785, t786...597
Computing Next relation with stutter on 81276 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11515690310865075184
[2023-03-20 17:50:46] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11515690310865075184
Running compilation step : cd /tmp/ltsmin11515690310865075184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11515690310865075184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11515690310865075184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property StigmergyCommit-PT-03b-LTLFireability-08 finished in 104593 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&&F(p1)&&G(p2)))))'
Support contains 2 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 821 transition count 1060
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 821 transition count 1060
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 816 transition count 1055
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 816 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 816 transition count 1054
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 813 transition count 1051
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 813 transition count 1051
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 810 transition count 1048
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 810 transition count 1048
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 807 transition count 1045
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 807 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 804 transition count 1042
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 804 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 802 transition count 1040
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 802 transition count 1040
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 802 transition count 1039
Applied a total of 56 rules in 372 ms. Remains 802 /829 variables (removed 27) and now considering 1039/1068 (removed 29) transitions.
// Phase 1: matrix 1039 rows 802 cols
[2023-03-20 17:50:49] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-20 17:50:50] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-20 17:50:50] [INFO ] Invariant cache hit.
[2023-03-20 17:50:51] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1411 ms to find 0 implicit places.
[2023-03-20 17:50:51] [INFO ] Invariant cache hit.
[2023-03-20 17:50:52] [INFO ] Dead Transitions using invariants and state equation in 1193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 802/829 places, 1039/1068 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2985 ms. Remains : 802/829 places, 1039/1068 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s139 0), p2:(NEQ s139 1), p1:(EQ s655 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1275 reset in 209 ms.
Product exploration explored 100000 steps with 1290 reset in 246 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 572 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 132 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 17:50:54] [INFO ] Invariant cache hit.
[2023-03-20 17:50:54] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2023-03-20 17:50:55] [INFO ] After 743ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-20 17:50:55] [INFO ] Deduced a trap composed of 299 places in 594 ms of which 2 ms to minimize.
[2023-03-20 17:50:56] [INFO ] Deduced a trap composed of 299 places in 484 ms of which 1 ms to minimize.
[2023-03-20 17:50:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1311 ms
[2023-03-20 17:50:56] [INFO ] After 2114ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 17:50:56] [INFO ] After 2413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 17:50:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2023-03-20 17:50:57] [INFO ] After 839ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 17:50:58] [INFO ] Deduced a trap composed of 299 places in 620 ms of which 2 ms to minimize.
[2023-03-20 17:50:59] [INFO ] Deduced a trap composed of 299 places in 520 ms of which 1 ms to minimize.
[2023-03-20 17:50:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1346 ms
[2023-03-20 17:50:59] [INFO ] After 2458ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-20 17:50:59] [INFO ] After 2982ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Graph (trivial) has 798 edges and 802 vertex of which 68 / 802 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1194 edges and 746 vertex of which 742 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 565 rules applied. Total rules applied 567 place count 742 transition count 398
Reduce places removed 561 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 573 rules applied. Total rules applied 1140 place count 181 transition count 386
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1144 place count 177 transition count 386
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1144 place count 177 transition count 341
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1234 place count 132 transition count 341
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1294 place count 102 transition count 311
Drop transitions removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1303 place count 102 transition count 302
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 1328 place count 77 transition count 148
Iterating global reduction 4 with 25 rules applied. Total rules applied 1353 place count 77 transition count 148
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1365 place count 77 transition count 136
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1377 place count 65 transition count 124
Iterating global reduction 5 with 12 rules applied. Total rules applied 1389 place count 65 transition count 124
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1397 place count 57 transition count 116
Iterating global reduction 5 with 8 rules applied. Total rules applied 1405 place count 57 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1409 place count 57 transition count 112
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 6 with 8 rules applied. Total rules applied 1417 place count 53 transition count 108
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1425 place count 49 transition count 129
Free-agglomeration rule applied 22 times with reduction of 6 identical transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1447 place count 49 transition count 101
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 41 rules applied. Total rules applied 1488 place count 27 transition count 82
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1492 place count 23 transition count 78
Iterating global reduction 7 with 4 rules applied. Total rules applied 1496 place count 23 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1497 place count 23 transition count 77
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 1523 place count 23 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1527 place count 21 transition count 69
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1535 place count 21 transition count 61
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1537 place count 21 transition count 61
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1538 place count 21 transition count 60
Applied a total of 1538 rules in 73 ms. Remains 21 /802 variables (removed 781) and now considering 60/1039 (removed 979) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 21/802 places, 60/1039 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (OR (NOT p0) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 707 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 802 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Applied a total of 0 rules in 39 ms. Remains 802 /802 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
[2023-03-20 17:51:00] [INFO ] Invariant cache hit.
[2023-03-20 17:51:01] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-20 17:51:01] [INFO ] Invariant cache hit.
[2023-03-20 17:51:02] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1506 ms to find 0 implicit places.
[2023-03-20 17:51:02] [INFO ] Invariant cache hit.
[2023-03-20 17:51:03] [INFO ] Dead Transitions using invariants and state equation in 1411 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2959 ms. Remains : 802/802 places, 1039/1039 transitions.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 515 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 127 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 17:51:05] [INFO ] Invariant cache hit.
[2023-03-20 17:51:05] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2023-03-20 17:51:06] [INFO ] After 745ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-20 17:51:06] [INFO ] Deduced a trap composed of 299 places in 600 ms of which 2 ms to minimize.
[2023-03-20 17:51:07] [INFO ] Deduced a trap composed of 299 places in 503 ms of which 1 ms to minimize.
[2023-03-20 17:51:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1330 ms
[2023-03-20 17:51:07] [INFO ] After 2129ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 17:51:07] [INFO ] After 2423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 17:51:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2023-03-20 17:51:08] [INFO ] After 895ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 17:51:09] [INFO ] Deduced a trap composed of 299 places in 658 ms of which 2 ms to minimize.
[2023-03-20 17:51:10] [INFO ] Deduced a trap composed of 299 places in 559 ms of which 2 ms to minimize.
[2023-03-20 17:51:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1448 ms
[2023-03-20 17:51:10] [INFO ] After 2635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 183 ms.
[2023-03-20 17:51:10] [INFO ] After 3155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Graph (trivial) has 798 edges and 802 vertex of which 68 / 802 are part of one of the 12 SCC in 2 ms
Free SCC test removed 56 places
Drop transitions removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1194 edges and 746 vertex of which 742 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 565 rules applied. Total rules applied 567 place count 742 transition count 398
Reduce places removed 561 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 573 rules applied. Total rules applied 1140 place count 181 transition count 386
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1144 place count 177 transition count 386
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1144 place count 177 transition count 341
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1234 place count 132 transition count 341
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1294 place count 102 transition count 311
Drop transitions removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1303 place count 102 transition count 302
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 1328 place count 77 transition count 148
Iterating global reduction 4 with 25 rules applied. Total rules applied 1353 place count 77 transition count 148
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1365 place count 77 transition count 136
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1377 place count 65 transition count 124
Iterating global reduction 5 with 12 rules applied. Total rules applied 1389 place count 65 transition count 124
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1397 place count 57 transition count 116
Iterating global reduction 5 with 8 rules applied. Total rules applied 1405 place count 57 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1409 place count 57 transition count 112
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 6 with 8 rules applied. Total rules applied 1417 place count 53 transition count 108
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1425 place count 49 transition count 129
Free-agglomeration rule applied 22 times with reduction of 6 identical transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1447 place count 49 transition count 101
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 41 rules applied. Total rules applied 1488 place count 27 transition count 82
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1492 place count 23 transition count 78
Iterating global reduction 7 with 4 rules applied. Total rules applied 1496 place count 23 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1497 place count 23 transition count 77
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 1523 place count 23 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1527 place count 21 transition count 69
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1535 place count 21 transition count 61
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1537 place count 21 transition count 61
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1538 place count 21 transition count 60
Applied a total of 1538 rules in 62 ms. Remains 21 /802 variables (removed 781) and now considering 60/1039 (removed 979) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 21/802 places, 60/1039 transitions.
Finished random walk after 36 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (OR (NOT p0) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 702 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 1274 reset in 218 ms.
Product exploration explored 100000 steps with 1285 reset in 243 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 802 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Graph (trivial) has 796 edges and 802 vertex of which 68 / 802 are part of one of the 12 SCC in 0 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Performed 551 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 551 rules applied. Total rules applied 552 place count 746 transition count 975
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 560 place count 746 transition count 967
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 560 place count 746 transition count 971
Deduced a syphon composed of 584 places in 1 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 593 place count 746 transition count 971
Discarding 497 places :
Symmetric choice reduction at 2 with 497 rule applications. Total rules 1090 place count 249 transition count 474
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 2 with 497 rules applied. Total rules applied 1587 place count 249 transition count 474
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 135 places in 1 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 1632 place count 249 transition count 486
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 1706 place count 175 transition count 279
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 74 rules applied. Total rules applied 1780 place count 175 transition count 279
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 1794 place count 175 transition count 265
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 1825 place count 144 transition count 230
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 3 with 31 rules applied. Total rules applied 1856 place count 144 transition count 230
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1868 place count 132 transition count 218
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1880 place count 132 transition count 218
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1884 place count 132 transition count 214
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1892 place count 124 transition count 206
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 1900 place count 124 transition count 206
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1907 place count 124 transition count 241
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1918 place count 113 transition count 219
Deduced a syphon composed of 55 places in 1 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 1929 place count 113 transition count 219
Deduced a syphon composed of 55 places in 0 ms
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 1937 place count 113 transition count 211
Deduced a syphon composed of 55 places in 0 ms
Applied a total of 1937 rules in 131 ms. Remains 113 /802 variables (removed 689) and now considering 211/1039 (removed 828) transitions.
[2023-03-20 17:51:13] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 17:51:13] [INFO ] Flow matrix only has 206 transitions (discarded 5 similar events)
// Phase 1: matrix 206 rows 113 cols
[2023-03-20 17:51:13] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-20 17:51:13] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/802 places, 211/1039 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 423 ms. Remains : 113/802 places, 211/1039 transitions.
Built C files in :
/tmp/ltsmin12377165345342757247
[2023-03-20 17:51:13] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12377165345342757247
Running compilation step : cd /tmp/ltsmin12377165345342757247;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12377165345342757247;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12377165345342757247;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 802 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Applied a total of 0 rules in 23 ms. Remains 802 /802 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
// Phase 1: matrix 1039 rows 802 cols
[2023-03-20 17:51:16] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-20 17:51:16] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-20 17:51:16] [INFO ] Invariant cache hit.
[2023-03-20 17:51:17] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
[2023-03-20 17:51:17] [INFO ] Invariant cache hit.
[2023-03-20 17:51:18] [INFO ] Dead Transitions using invariants and state equation in 1338 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2405 ms. Remains : 802/802 places, 1039/1039 transitions.
Built C files in :
/tmp/ltsmin2460383979251820118
[2023-03-20 17:51:18] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2460383979251820118
Running compilation step : cd /tmp/ltsmin2460383979251820118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2979 ms.
Running link step : cd /tmp/ltsmin2460383979251820118;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin2460383979251820118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5683852134873817864.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-20 17:51:33] [INFO ] Flatten gal took : 29 ms
[2023-03-20 17:51:33] [INFO ] Flatten gal took : 26 ms
[2023-03-20 17:51:33] [INFO ] Time to serialize gal into /tmp/LTL8472985472349769878.gal : 6 ms
[2023-03-20 17:51:34] [INFO ] Time to serialize properties into /tmp/LTL10046006780292250104.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8472985472349769878.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3391584475773684995.hoa' '-atoms' '/tmp/LTL10046006780292250104.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10046006780292250104.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3391584475773684995.hoa
Detected timeout of ITS tools.
[2023-03-20 17:51:49] [INFO ] Flatten gal took : 42 ms
[2023-03-20 17:51:49] [INFO ] Flatten gal took : 28 ms
[2023-03-20 17:51:49] [INFO ] Time to serialize gal into /tmp/LTL10033286589657764163.gal : 7 ms
[2023-03-20 17:51:49] [INFO ] Time to serialize properties into /tmp/LTL9933471568557280526.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10033286589657764163.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9933471568557280526.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((("(p172==0)")&&(F("(p979==0)")))&&(G("(p172!=1)"))))))
Formula 0 simplified : XG(!"(p172==0)" | G!"(p979==0)" | F!"(p172!=1)")
Detected timeout of ITS tools.
[2023-03-20 17:52:04] [INFO ] Flatten gal took : 36 ms
[2023-03-20 17:52:04] [INFO ] Applying decomposition
[2023-03-20 17:52:04] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18076200058147838967.txt' '-o' '/tmp/graph18076200058147838967.bin' '-w' '/tmp/graph18076200058147838967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18076200058147838967.bin' '-l' '-1' '-v' '-w' '/tmp/graph18076200058147838967.weights' '-q' '0' '-e' '0.001'
[2023-03-20 17:52:05] [INFO ] Decomposing Gal with order
[2023-03-20 17:52:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 17:52:05] [INFO ] Removed a total of 860 redundant transitions.
[2023-03-20 17:52:05] [INFO ] Flatten gal took : 62 ms
[2023-03-20 17:52:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2023-03-20 17:52:05] [INFO ] Time to serialize gal into /tmp/LTL18261102204503589711.gal : 13 ms
[2023-03-20 17:52:05] [INFO ] Time to serialize properties into /tmp/LTL13078225306148929441.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18261102204503589711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13078225306148929441.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((("(i6.u62.p172==0)")&&(F("(i10.u278.p979==0)")))&&(G("(i6.u62.p172!=1)"))))))
Formula 0 simplified : XG(!"(i6.u62.p172==0)" | G!"(i10.u278.p979==0)" | F!"(i6.u62.p172!=1)")
Reverse transition relation is NOT exact ! Due to transitions t78, t162, t163, t219, t259, t289, t401, t435, t525, t614, t636, t709, t762, t765, t785, t786...593
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8130274882861065364
[2023-03-20 17:52:20] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8130274882861065364
Running compilation step : cd /tmp/ltsmin8130274882861065364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2828 ms.
Running link step : cd /tmp/ltsmin8130274882861065364;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8130274882861065364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&<>((LTLAPp1==true))&&[]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-10 finished in 106160 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' '!(((!p0 U (p1||G(!p0))) U G(p0)))'
Support contains 5 out of 829 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Graph (trivial) has 823 edges and 829 vertex of which 69 / 829 are part of one of the 12 SCC in 1 ms
Free SCC test removed 57 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 572 transitions
Trivial Post-agglo rules discarded 572 transitions
Performed 572 trivial Post agglomeration. Transition count delta: 572
Iterating post reduction 0 with 572 rules applied. Total rules applied 573 place count 771 transition count 430
Reduce places removed 572 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 1 with 587 rules applied. Total rules applied 1160 place count 199 transition count 415
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1166 place count 193 transition count 415
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 1166 place count 193 transition count 376
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1244 place count 154 transition count 376
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1251 place count 147 transition count 369
Iterating global reduction 3 with 7 rules applied. Total rules applied 1258 place count 147 transition count 369
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1258 place count 147 transition count 368
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1260 place count 146 transition count 368
Performed 30 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1320 place count 116 transition count 337
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1342 place count 94 transition count 224
Iterating global reduction 3 with 22 rules applied. Total rules applied 1364 place count 94 transition count 224
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1372 place count 94 transition count 216
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1384 place count 82 transition count 200
Iterating global reduction 4 with 12 rules applied. Total rules applied 1396 place count 82 transition count 200
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1408 place count 70 transition count 184
Iterating global reduction 4 with 12 rules applied. Total rules applied 1420 place count 70 transition count 184
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1424 place count 70 transition count 180
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1440 place count 62 transition count 187
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1441 place count 61 transition count 179
Iterating global reduction 5 with 1 rules applied. Total rules applied 1442 place count 61 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1443 place count 61 transition count 178
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1447 place count 61 transition count 174
Applied a total of 1447 rules in 48 ms. Remains 61 /829 variables (removed 768) and now considering 174/1068 (removed 894) transitions.
[2023-03-20 17:52:35] [INFO ] Flow matrix only has 169 transitions (discarded 5 similar events)
// Phase 1: matrix 169 rows 61 cols
[2023-03-20 17:52:35] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-20 17:52:35] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-20 17:52:35] [INFO ] Flow matrix only has 169 transitions (discarded 5 similar events)
[2023-03-20 17:52:35] [INFO ] Invariant cache hit.
[2023-03-20 17:52:35] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-20 17:52:35] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-20 17:52:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 17:52:35] [INFO ] Flow matrix only has 169 transitions (discarded 5 similar events)
[2023-03-20 17:52:35] [INFO ] Invariant cache hit.
[2023-03-20 17:52:35] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/829 places, 174/1068 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 381 ms. Remains : 61/829 places, 174/1068 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (AND p0 (NOT p1)), true]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s21 1) (EQ s34 1) (EQ s47 1)), p1:(AND (NEQ s53 1) (NOT (AND (EQ s6 1) (EQ s21 1) (EQ s34 1) (EQ s47 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-14 finished in 592 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)))'
Support contains 1 out of 829 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Graph (trivial) has 827 edges and 829 vertex of which 69 / 829 are part of one of the 12 SCC in 0 ms
Free SCC test removed 57 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 576 transitions
Trivial Post-agglo rules discarded 576 transitions
Performed 576 trivial Post agglomeration. Transition count delta: 576
Iterating post reduction 0 with 576 rules applied. Total rules applied 577 place count 771 transition count 426
Reduce places removed 576 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 1 with 591 rules applied. Total rules applied 1168 place count 195 transition count 411
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1174 place count 189 transition count 411
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 1174 place count 189 transition count 371
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1254 place count 149 transition count 371
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1260 place count 143 transition count 365
Iterating global reduction 3 with 6 rules applied. Total rules applied 1266 place count 143 transition count 365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1266 place count 143 transition count 364
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1268 place count 142 transition count 364
Performed 30 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1328 place count 112 transition count 333
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1352 place count 88 transition count 183
Iterating global reduction 3 with 24 rules applied. Total rules applied 1376 place count 88 transition count 183
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1387 place count 88 transition count 172
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1399 place count 76 transition count 156
Iterating global reduction 4 with 12 rules applied. Total rules applied 1411 place count 76 transition count 156
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1423 place count 64 transition count 140
Iterating global reduction 4 with 12 rules applied. Total rules applied 1435 place count 64 transition count 140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1439 place count 64 transition count 136
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1455 place count 56 transition count 143
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1456 place count 55 transition count 135
Iterating global reduction 5 with 1 rules applied. Total rules applied 1457 place count 55 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1458 place count 55 transition count 134
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1462 place count 55 transition count 130
Applied a total of 1462 rules in 67 ms. Remains 55 /829 variables (removed 774) and now considering 130/1068 (removed 938) transitions.
[2023-03-20 17:52:36] [INFO ] Flow matrix only has 125 transitions (discarded 5 similar events)
// Phase 1: matrix 125 rows 55 cols
[2023-03-20 17:52:36] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-20 17:52:36] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-20 17:52:36] [INFO ] Flow matrix only has 125 transitions (discarded 5 similar events)
[2023-03-20 17:52:36] [INFO ] Invariant cache hit.
[2023-03-20 17:52:36] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-20 17:52:36] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-20 17:52:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 17:52:36] [INFO ] Flow matrix only has 125 transitions (discarded 5 similar events)
[2023-03-20 17:52:36] [INFO ] Invariant cache hit.
[2023-03-20 17:52:36] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/829 places, 130/1068 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 491 ms. Remains : 55/829 places, 130/1068 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-15 finished in 608 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(X(X((p0&&X(G((G((p2||X(p3)))||p1)))))))))'
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||G(p1))))))'
Found a Shortening insensitive property : StigmergyCommit-PT-03b-LTLFireability-08
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 829 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Graph (trivial) has 823 edges and 829 vertex of which 69 / 829 are part of one of the 12 SCC in 0 ms
Free SCC test removed 57 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 572 transitions
Trivial Post-agglo rules discarded 572 transitions
Performed 572 trivial Post agglomeration. Transition count delta: 572
Iterating post reduction 0 with 572 rules applied. Total rules applied 573 place count 771 transition count 430
Reduce places removed 572 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 1 with 587 rules applied. Total rules applied 1160 place count 199 transition count 415
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1166 place count 193 transition count 415
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 1166 place count 193 transition count 376
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1244 place count 154 transition count 376
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1251 place count 147 transition count 369
Iterating global reduction 3 with 7 rules applied. Total rules applied 1258 place count 147 transition count 369
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1258 place count 147 transition count 368
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1260 place count 146 transition count 368
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1320 place count 116 transition count 338
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1341 place count 95 transition count 252
Iterating global reduction 3 with 21 rules applied. Total rules applied 1362 place count 95 transition count 252
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1370 place count 95 transition count 244
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1382 place count 83 transition count 228
Iterating global reduction 4 with 12 rules applied. Total rules applied 1394 place count 83 transition count 228
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1406 place count 71 transition count 212
Iterating global reduction 4 with 12 rules applied. Total rules applied 1418 place count 71 transition count 212
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1422 place count 71 transition count 208
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1438 place count 63 transition count 215
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1439 place count 62 transition count 207
Iterating global reduction 5 with 1 rules applied. Total rules applied 1440 place count 62 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1441 place count 62 transition count 206
Applied a total of 1441 rules in 87 ms. Remains 62 /829 variables (removed 767) and now considering 206/1068 (removed 862) transitions.
[2023-03-20 17:52:37] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
// Phase 1: matrix 201 rows 62 cols
[2023-03-20 17:52:37] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-20 17:52:37] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-20 17:52:37] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2023-03-20 17:52:37] [INFO ] Invariant cache hit.
[2023-03-20 17:52:37] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-20 17:52:37] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-20 17:52:37] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2023-03-20 17:52:37] [INFO ] Invariant cache hit.
[2023-03-20 17:52:37] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 62/829 places, 206/1068 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 576 ms. Remains : 62/829 places, 206/1068 transitions.
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (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=[p1:(EQ s28 0), p0:(AND (EQ s6 1) (EQ s20 1) (EQ s36 1) (EQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 47 reset in 116 ms.
Stuttering criterion allowed to conclude after 9062 steps with 1230 reset in 30 ms.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-08 finished in 1028 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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&&F(p1)&&G(p2)))))'
Found a Shortening insensitive property : StigmergyCommit-PT-03b-LTLFireability-10
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 829 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Graph (trivial) has 825 edges and 829 vertex of which 69 / 829 are part of one of the 12 SCC in 0 ms
Free SCC test removed 57 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 574 transitions
Trivial Post-agglo rules discarded 574 transitions
Performed 574 trivial Post agglomeration. Transition count delta: 574
Iterating post reduction 0 with 574 rules applied. Total rules applied 575 place count 771 transition count 428
Reduce places removed 574 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 1 with 589 rules applied. Total rules applied 1164 place count 197 transition count 413
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1170 place count 191 transition count 413
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 1170 place count 191 transition count 373
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1250 place count 151 transition count 373
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1256 place count 145 transition count 367
Iterating global reduction 3 with 6 rules applied. Total rules applied 1262 place count 145 transition count 367
Performed 31 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 1324 place count 114 transition count 335
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1348 place count 90 transition count 185
Iterating global reduction 3 with 24 rules applied. Total rules applied 1372 place count 90 transition count 185
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1382 place count 90 transition count 175
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1394 place count 78 transition count 159
Iterating global reduction 4 with 12 rules applied. Total rules applied 1406 place count 78 transition count 159
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1418 place count 66 transition count 143
Iterating global reduction 4 with 12 rules applied. Total rules applied 1430 place count 66 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1434 place count 66 transition count 139
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1450 place count 58 transition count 146
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1451 place count 57 transition count 138
Iterating global reduction 5 with 1 rules applied. Total rules applied 1452 place count 57 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1453 place count 57 transition count 137
Applied a total of 1453 rules in 69 ms. Remains 57 /829 variables (removed 772) and now considering 137/1068 (removed 931) transitions.
[2023-03-20 17:52:38] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
// Phase 1: matrix 132 rows 57 cols
[2023-03-20 17:52:38] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-20 17:52:38] [INFO ] Implicit Places using invariants in 521 ms returned []
[2023-03-20 17:52:38] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2023-03-20 17:52:38] [INFO ] Invariant cache hit.
[2023-03-20 17:52:38] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-20 17:52:38] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2023-03-20 17:52:38] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2023-03-20 17:52:38] [INFO ] Invariant cache hit.
[2023-03-20 17:52:39] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 57/829 places, 137/1068 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 828 ms. Remains : 57/829 places, 137/1068 transitions.
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s9 0), p2:(NEQ s9 1), p1:(EQ s46 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 444 reset in 51 ms.
Product exploration explored 100000 steps with 2522 reset in 81 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 508 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 1402 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 155 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 17:52:40] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2023-03-20 17:52:40] [INFO ] Invariant cache hit.
[2023-03-20 17:52:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 17:52:40] [INFO ] After 69ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-20 17:52:40] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-20 17:52:40] [INFO ] After 16ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 17:52:40] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 17:52:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 17:52:40] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 17:52:40] [INFO ] After 33ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 17:52:40] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-20 17:52:40] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 137/137 transitions.
Graph (complete) has 242 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 56 transition count 125
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 15 place count 54 transition count 124
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 2 with 8 rules applied. Total rules applied 23 place count 50 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 50 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 49 transition count 129
Free-agglomeration rule applied 22 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 51 place count 49 transition count 101
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 46 rules applied. Total rules applied 97 place count 26 transition count 78
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 101 place count 22 transition count 78
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 105 place count 18 transition count 74
Iterating global reduction 5 with 4 rules applied. Total rules applied 109 place count 18 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 110 place count 18 transition count 73
Performed 8 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 126 place count 10 transition count 43
Drop transitions removed 5 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 155 place count 10 transition count 14
Performed 2 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 161 place count 6 transition count 10
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 165 place count 6 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 167 place count 5 transition count 5
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 168 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 169 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 170 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 170 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 172 place count 2 transition count 2
Applied a total of 172 rules in 28 ms. Remains 2 /57 variables (removed 55) and now considering 2/137 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 2/57 places, 2/137 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (OR (NOT p0) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 729 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 137/137 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-20 17:52:41] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2023-03-20 17:52:41] [INFO ] Invariant cache hit.
[2023-03-20 17:52:41] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-20 17:52:41] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2023-03-20 17:52:41] [INFO ] Invariant cache hit.
[2023-03-20 17:52:42] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-20 17:52:42] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-20 17:52:42] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2023-03-20 17:52:42] [INFO ] Invariant cache hit.
[2023-03-20 17:52:42] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 429 ms. Remains : 57/57 places, 137/137 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 572 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 1396 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 163 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 166 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 156 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 17:52:43] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2023-03-20 17:52:43] [INFO ] Invariant cache hit.
[2023-03-20 17:52:43] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 17:52:43] [INFO ] After 69ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-20 17:52:43] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-20 17:52:43] [INFO ] After 17ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 17:52:43] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 17:52:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 17:52:43] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 17:52:43] [INFO ] After 34ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 17:52:43] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-20 17:52:43] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 137/137 transitions.
Graph (complete) has 242 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 56 transition count 125
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 15 place count 54 transition count 124
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 2 with 8 rules applied. Total rules applied 23 place count 50 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 50 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 49 transition count 129
Free-agglomeration rule applied 22 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 51 place count 49 transition count 101
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 46 rules applied. Total rules applied 97 place count 26 transition count 78
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 101 place count 22 transition count 78
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 105 place count 18 transition count 74
Iterating global reduction 5 with 4 rules applied. Total rules applied 109 place count 18 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 110 place count 18 transition count 73
Performed 8 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 126 place count 10 transition count 43
Drop transitions removed 5 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 155 place count 10 transition count 14
Performed 2 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 161 place count 6 transition count 10
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 165 place count 6 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 167 place count 5 transition count 5
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 168 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 169 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 170 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 170 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 172 place count 2 transition count 2
Applied a total of 172 rules in 29 ms. Remains 2 /57 variables (removed 55) and now considering 2/137 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 2/57 places, 2/137 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (OR (NOT p0) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 670 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 2667 reset in 123 ms.
Product exploration explored 100000 steps with 1994 reset in 126 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 137/137 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 57 transition count 133
Applied a total of 4 rules in 7 ms. Remains 57 /57 variables (removed 0) and now considering 133/137 (removed 4) transitions.
[2023-03-20 17:52:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 17:52:45] [INFO ] Flow matrix only has 128 transitions (discarded 5 similar events)
// Phase 1: matrix 128 rows 57 cols
[2023-03-20 17:52:45] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-20 17:52:45] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/57 places, 133/137 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 57/57 places, 133/137 transitions.
Built C files in :
/tmp/ltsmin15118382911284503701
[2023-03-20 17:52:45] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15118382911284503701
Running compilation step : cd /tmp/ltsmin15118382911284503701;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 560 ms.
Running link step : cd /tmp/ltsmin15118382911284503701;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin15118382911284503701;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4528539330877802630.hoa' '--buchi-type=spotba'
LTSmin run took 188 ms.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-10 finished in 8923 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-20 17:52:46] [INFO ] Flatten gal took : 39 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14510312508586326668
[2023-03-20 17:52:46] [INFO ] Computing symmetric may disable matrix : 1068 transitions.
[2023-03-20 17:52:46] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 17:52:46] [INFO ] Applying decomposition
[2023-03-20 17:52:46] [INFO ] Computing symmetric may enable matrix : 1068 transitions.
[2023-03-20 17:52:46] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 17:52:46] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12819680713211502194.txt' '-o' '/tmp/graph12819680713211502194.bin' '-w' '/tmp/graph12819680713211502194.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12819680713211502194.bin' '-l' '-1' '-v' '-w' '/tmp/graph12819680713211502194.weights' '-q' '0' '-e' '0.001'
[2023-03-20 17:52:47] [INFO ] Decomposing Gal with order
[2023-03-20 17:52:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 17:52:47] [INFO ] Removed a total of 866 redundant transitions.
[2023-03-20 17:52:47] [INFO ] Computing Do-Not-Accords matrix : 1068 transitions.
[2023-03-20 17:52:47] [INFO ] Flatten gal took : 82 ms
[2023-03-20 17:52:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 11 ms.
[2023-03-20 17:52:47] [INFO ] Time to serialize gal into /tmp/LTLFireability10407760035969772135.gal : 10 ms
[2023-03-20 17:52:47] [INFO ] Time to serialize properties into /tmp/LTLFireability13861281294801492881.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10407760035969772135.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13861281294801492881.ltl' '-c' '-stutter-deadlock'
[2023-03-20 17:52:47] [INFO ] Computation of Completed DNA matrix. took 76 ms. Total solver calls (SAT/UNSAT): 0(0/0)

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
[2023-03-20 17:52:47] [INFO ] Built C files in 477ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14510312508586326668
Running compilation step : cd /tmp/ltsmin14510312508586326668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((X(X(X(X(("(((i21.u34.p94!=1)||(i21.u123.p396!=1))||((i21.u205.p698!=1)||(i21.u292.p1000!=1)))")&&(X(G(("(((i21.u34.p94!=1)||(i21.u1...285
Formula 0 simplified : XXXX(!"(((i21.u34.p94!=1)||(i21.u123.p396!=1))||((i21.u205.p698!=1)||(i21.u292.p1000!=1)))" | XF(!"(((i21.u34.p94!=1)||(i21.u123.p39...267
Compilation finished in 4757 ms.
Running link step : cd /tmp/ltsmin14510312508586326668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin14510312508586326668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X(((LTLAPp0==true)&&X([](([](((LTLAPp2==true)||X((LTLAPp3==true))))||(LTLAPp1==true)))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t78, t163, t217, t219, t259, t289, t345, t399, t435, t525, t578, t579, t581, t614, t636, t644...659
Computing Next relation with stutter on 83938 deadlock states
10 unique states visited
10 strongly connected components in search stack
10 transitions explored
10 items max in DFS search stack
8242 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,82.5528,1809172,1,0,2.19511e+06,891,11502,1.51709e+07,220,3168,5158940
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA StigmergyCommit-PT-03b-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(F(("(((i21.u4.p72==1)&&(i21.u107.p351==1))&&((i21.u191.p653==1)&&(i21.u277.p955==1)))")||(G("(i16.i1.i2.u157.p513==0)")))))))
Formula 1 simplified : XXG(!"(((i21.u4.p72==1)&&(i21.u107.p351==1))&&((i21.u191.p653==1)&&(i21.u277.p955==1)))" & F!"(i16.i1.i2.u157.p513==0)")
Computing Next relation with stutter on 83938 deadlock states
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin14510312508586326668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X(((LTLAPp0==true)&&X([](([](((LTLAPp2==true)||X((LTLAPp3==true))))||(LTLAPp1==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14510312508586326668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(((LTLAPp4==true)||[]((LTLAPp5==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-20 18:14:39] [INFO ] Applying decomposition
[2023-03-20 18:14:39] [INFO ] Flatten gal took : 57 ms
[2023-03-20 18:14:39] [INFO ] Decomposing Gal with order
[2023-03-20 18:14:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 18:14:40] [INFO ] Removed a total of 742 redundant transitions.
[2023-03-20 18:14:40] [INFO ] Flatten gal took : 133 ms
[2023-03-20 18:14:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 234 labels/synchronizations in 15 ms.
[2023-03-20 18:14:40] [INFO ] Time to serialize gal into /tmp/LTLFireability216170270939964713.gal : 5 ms
[2023-03-20 18:14:40] [INFO ] Time to serialize properties into /tmp/LTLFireability17125259988873812336.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability216170270939964713.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17125259988873812336.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((X(X(F(("(((i0.i0.i0.u4.p72==1)&&(i0.i0.i0.u5.p351==1))&&((i0.i0.u6.p653==1)&&(i0.u7.p955==1)))")||(G("(i0.i0.i0.u5.p513==0)")))))))
Formula 0 simplified : XXG(!"(((i0.i0.i0.u4.p72==1)&&(i0.i0.i0.u5.p351==1))&&((i0.i0.u6.p653==1)&&(i0.u7.p955==1)))" & F!"(i0.i0.i0.u5.p513==0)")
Reverse transition relation is NOT exact ! Due to transitions t816, u8.t34, u8.t40, i0.u7.t78, i0.u7.t81, i0.u7.t97, i0.u7.t106, i0.u7.t161, i0.u7.t162, i0...863
Computing Next relation with stutter on 83938 deadlock states
LTSmin run took 313735 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin14510312508586326668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp6==true)&&<>((LTLAPp7==true))&&[]((LTLAPp8==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-20 18:36:32] [INFO ] Flatten gal took : 89 ms
[2023-03-20 18:36:32] [INFO ] Input system was already deterministic with 1068 transitions.
[2023-03-20 18:36:32] [INFO ] Transformed 829 places.
[2023-03-20 18:36:32] [INFO ] Transformed 1068 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-20 18:36:33] [INFO ] Time to serialize gal into /tmp/LTLFireability18060557350688819939.gal : 15 ms
[2023-03-20 18:36:33] [INFO ] Time to serialize properties into /tmp/LTLFireability12788649240430213813.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18060557350688819939.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12788649240430213813.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F((("(p172==0)")&&(F("(p979==0)")))&&(G("(p172!=1)"))))))
Formula 0 simplified : XG(!"(p172==0)" | G!"(p979==0)" | F!"(p172!=1)")
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin14510312508586326668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp6==true)&&<>((LTLAPp7==true))&&[]((LTLAPp8==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin14510312508586326668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp6==true)&&<>((LTLAPp7==true))&&[]((LTLAPp8==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t34, t40, t78, t81, t97, t106, t161, t162, t163, t216, t217, t219, t247, t259, t289, t343, t3...502
Computing Next relation with stutter on 83938 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10966984 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16032844 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-03b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-03b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r453-smll-167912645400420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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