MCC'2024- Execution of r377-smll-171683809700117

About the Execution of GreatSPN+red for SieveSingleMsgMbox-PT-d2m18

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1748.424	286473.00	432602.00	758.10	0 1 0 0 0 1 1 0 0 0 0 0 0 0 0 0	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716916413146

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 17:13:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 17:13:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:13:36] [INFO ] Load time of PNML (sax parser for PT used): 553 ms
[2024-05-28 17:13:36] [INFO ] Transformed 2398 places.
[2024-05-28 17:13:36] [INFO ] Transformed 1954 transitions.
[2024-05-28 17:13:36] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 844 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Deduced a syphon composed of 1984 places in 39 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 1954 rows 414 cols
[2024-05-28 17:13:36] [INFO ] Computed 6 invariants in 104 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
RANDOM walk for 10000 steps (2198 resets) in 532 ms. (18 steps per ms)
BEST_FIRST walk for 50001 steps (4571 resets) in 403 ms. (123 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
[2024-05-28 17:13:37] [INFO ] Invariant cache hit.
[2024-05-28 17:13:38] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2024-05-28 17:13:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 10 ms returned sat
[2024-05-28 17:13:38] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2024-05-28 17:13:39] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2024-05-28 17:13:39] [INFO ] [Real]Added 1674 Read/Feed constraints in 782 ms returned sat
[2024-05-28 17:13:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:13:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-28 17:13:40] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-28 17:13:40] [INFO ] [Nat]Absence check using state equation in 730 ms returned sat
[2024-05-28 17:13:41] [INFO ] [Nat]Added 1674 Read/Feed constraints in 775 ms returned sat
[2024-05-28 17:13:42] [INFO ] Deduced a trap composed of 96 places in 401 ms of which 47 ms to minimize.
[2024-05-28 17:13:42] [INFO ] Deduced a trap composed of 103 places in 485 ms of which 7 ms to minimize.
[2024-05-28 17:13:43] [INFO ] Deduced a trap composed of 98 places in 408 ms of which 5 ms to minimize.
[2024-05-28 17:13:43] [INFO ] Deduced a trap composed of 109 places in 476 ms of which 8 ms to minimize.
[2024-05-28 17:13:44] [INFO ] Deduced a trap composed of 109 places in 464 ms of which 7 ms to minimize.
[2024-05-28 17:13:45] [INFO ] Deduced a trap composed of 108 places in 447 ms of which 7 ms to minimize.
[2024-05-28 17:13:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 17:13:45] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 17:13:45] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-28 17:13:45] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2024-05-28 17:13:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:13:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-28 17:13:46] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-28 17:13:46] [INFO ] [Nat]Absence check using state equation in 679 ms returned sat
[2024-05-28 17:13:47] [INFO ] [Nat]Added 1674 Read/Feed constraints in 612 ms returned sat
[2024-05-28 17:13:48] [INFO ] Deduced a trap composed of 103 places in 447 ms of which 4 ms to minimize.
[2024-05-28 17:13:49] [INFO ] Deduced a trap composed of 101 places in 607 ms of which 14 ms to minimize.
[2024-05-28 17:13:50] [INFO ] Deduced a trap composed of 253 places in 623 ms of which 8 ms to minimize.
[2024-05-28 17:13:50] [INFO ] Deduced a trap composed of 103 places in 443 ms of which 4 ms to minimize.
[2024-05-28 17:13:51] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 3584 ms
[2024-05-28 17:13:51] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-28 17:13:51] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 17:13:51] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2024-05-28 17:13:52] [INFO ] [Real]Added 1674 Read/Feed constraints in 1010 ms returned sat
[2024-05-28 17:13:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:13:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-05-28 17:13:52] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-28 17:13:53] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2024-05-28 17:13:54] [INFO ] [Nat]Added 1674 Read/Feed constraints in 655 ms returned sat
[2024-05-28 17:13:54] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 390 ms.
[2024-05-28 17:13:56] [INFO ] Deduced a trap composed of 34 places in 710 ms of which 7 ms to minimize.
[2024-05-28 17:13:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1076 ms
[2024-05-28 17:13:57] [INFO ] Added : 26 causal constraints over 6 iterations in 3502 ms. Result :sat
Minimization took 7 ms.
[2024-05-28 17:13:57] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-28 17:13:57] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-28 17:13:58] [INFO ] [Real]Absence check using state equation in 713 ms returned sat
[2024-05-28 17:13:59] [INFO ] [Real]Added 1674 Read/Feed constraints in 888 ms returned sat
[2024-05-28 17:13:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:13:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-28 17:13:59] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2024-05-28 17:14:00] [INFO ] [Nat]Absence check using state equation in 685 ms returned sat
[2024-05-28 17:14:01] [INFO ] [Nat]Added 1674 Read/Feed constraints in 843 ms returned sat
[2024-05-28 17:14:01] [INFO ] Deduced a trap composed of 44 places in 461 ms of which 6 ms to minimize.
[2024-05-28 17:14:02] [INFO ] Deduced a trap composed of 45 places in 399 ms of which 4 ms to minimize.
[2024-05-28 17:14:03] [INFO ] Deduced a trap composed of 119 places in 445 ms of which 7 ms to minimize.
[2024-05-28 17:14:03] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 2159 ms
[2024-05-28 17:14:03] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2024-05-28 17:14:03] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2024-05-28 17:14:04] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2024-05-28 17:14:05] [INFO ] [Real]Added 1674 Read/Feed constraints in 955 ms returned sat
[2024-05-28 17:14:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:14:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-28 17:14:05] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-28 17:14:06] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2024-05-28 17:14:07] [INFO ] [Nat]Added 1674 Read/Feed constraints in 867 ms returned sat
[2024-05-28 17:14:07] [INFO ] Deduced a trap composed of 45 places in 584 ms of which 7 ms to minimize.
[2024-05-28 17:14:08] [INFO ] Deduced a trap composed of 44 places in 557 ms of which 6 ms to minimize.
[2024-05-28 17:14:09] [INFO ] Deduced a trap composed of 122 places in 464 ms of which 6 ms to minimize.
[2024-05-28 17:14:10] [INFO ] Deduced a trap composed of 168 places in 563 ms of which 6 ms to minimize.
[2024-05-28 17:14:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
Support contains 5 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.15 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 949 place count 270 transition count 373
Iterating global reduction 1 with 118 rules applied. Total rules applied 1067 place count 270 transition count 373
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1077 place count 270 transition count 363
Discarding 89 places :
Symmetric choice reduction at 2 with 89 rule applications. Total rules 1166 place count 181 transition count 274
Iterating global reduction 2 with 89 rules applied. Total rules applied 1255 place count 181 transition count 274
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 1289 place count 181 transition count 240
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1325 place count 145 transition count 190
Iterating global reduction 3 with 36 rules applied. Total rules applied 1361 place count 145 transition count 190
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 1382 place count 145 transition count 169
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1390 place count 137 transition count 158
Iterating global reduction 4 with 8 rules applied. Total rules applied 1398 place count 137 transition count 158
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1406 place count 129 transition count 150
Iterating global reduction 4 with 8 rules applied. Total rules applied 1414 place count 129 transition count 150
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1418 place count 125 transition count 145
Iterating global reduction 4 with 4 rules applied. Total rules applied 1422 place count 125 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1424 place count 125 transition count 143
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1428 place count 121 transition count 139
Iterating global reduction 5 with 4 rules applied. Total rules applied 1432 place count 121 transition count 139
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1434 place count 119 transition count 137
Iterating global reduction 5 with 2 rules applied. Total rules applied 1436 place count 119 transition count 137
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1437 place count 118 transition count 136
Iterating global reduction 5 with 1 rules applied. Total rules applied 1438 place count 118 transition count 136
Applied a total of 1438 rules in 264 ms. Remains 118 /414 variables (removed 296) and now considering 136/1954 (removed 1818) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 283 ms. Remains : 118/414 places, 136/1954 transitions.
// Phase 1: matrix 136 rows 118 cols
[2024-05-28 17:14:11] [INFO ] Computed 4 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
RANDOM walk for 1000000 steps (224733 resets) in 1257 ms. (794 steps per ms)
BEST_FIRST walk for 5000004 steps (516193 resets) in 3473 ms. (1439 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
[2024-05-28 17:14:16] [INFO ] Invariant cache hit.
[2024-05-28 17:14:16] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 17:14:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:14:16] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-28 17:14:16] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-28 17:14:16] [INFO ] [Real]Added 51 Read/Feed constraints in 20 ms returned sat
[2024-05-28 17:14:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:14:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 17:14:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:14:16] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-28 17:14:16] [INFO ] [Nat]Added 51 Read/Feed constraints in 35 ms returned sat
[2024-05-28 17:14:16] [INFO ] Computed and/alt/rep : 33/87/33 causal constraints (skipped 102 transitions) in 20 ms.
[2024-05-28 17:14:16] [INFO ] Added : 13 causal constraints over 3 iterations in 95 ms. Result :sat
Minimization took 126 ms.
[2024-05-28 17:14:16] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 17:14:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:14:16] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-28 17:14:16] [INFO ] [Real]Added 51 Read/Feed constraints in 17 ms returned sat
[2024-05-28 17:14:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:14:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 17:14:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:14:16] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-28 17:14:16] [INFO ] [Nat]Added 51 Read/Feed constraints in 20 ms returned sat
[2024-05-28 17:14:17] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-28 17:14:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-28 17:14:17] [INFO ] Computed and/alt/rep : 33/87/33 causal constraints (skipped 102 transitions) in 18 ms.
[2024-05-28 17:14:17] [INFO ] Added : 19 causal constraints over 4 iterations in 95 ms. Result :sat
Minimization took 89 ms.
[2024-05-28 17:14:17] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 17:14:17] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:14:17] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-28 17:14:17] [INFO ] [Real]Added 51 Read/Feed constraints in 13 ms returned sat
[2024-05-28 17:14:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:14:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 17:14:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 17:14:17] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-28 17:14:17] [INFO ] [Nat]Added 51 Read/Feed constraints in 17 ms returned sat
[2024-05-28 17:14:17] [INFO ] Computed and/alt/rep : 33/87/33 causal constraints (skipped 102 transitions) in 21 ms.
[2024-05-28 17:14:17] [INFO ] Added : 12 causal constraints over 3 iterations in 81 ms. Result :sat
Minimization took 82 ms.
[2024-05-28 17:14:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 17:14:17] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:14:17] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-28 17:14:17] [INFO ] [Real]Added 51 Read/Feed constraints in 22 ms returned sat
[2024-05-28 17:14:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:14:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 17:14:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:14:17] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-28 17:14:17] [INFO ] [Nat]Added 51 Read/Feed constraints in 17 ms returned sat
[2024-05-28 17:14:18] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-28 17:14:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2024-05-28 17:14:18] [INFO ] Computed and/alt/rep : 33/87/33 causal constraints (skipped 102 transitions) in 14 ms.
[2024-05-28 17:14:18] [INFO ] Added : 14 causal constraints over 3 iterations in 78 ms. Result :sat
Minimization took 112 ms.
[2024-05-28 17:14:18] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 17:14:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:14:18] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-28 17:14:18] [INFO ] [Real]Added 51 Read/Feed constraints in 21 ms returned sat
[2024-05-28 17:14:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:14:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 17:14:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:14:18] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-28 17:14:18] [INFO ] [Nat]Added 51 Read/Feed constraints in 25 ms returned sat
[2024-05-28 17:14:18] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-05-28 17:14:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-05-28 17:14:18] [INFO ] Computed and/alt/rep : 33/87/33 causal constraints (skipped 102 transitions) in 23 ms.
[2024-05-28 17:14:18] [INFO ] Added : 13 causal constraints over 3 iterations in 100 ms. Result :sat
Minimization took 121 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
Support contains 5 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 136/136 transitions.
Applied a total of 0 rules in 18 ms. Remains 118 /118 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 118/118 places, 136/136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 136/136 transitions.
Applied a total of 0 rules in 24 ms. Remains 118 /118 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-05-28 17:14:19] [INFO ] Invariant cache hit.
[2024-05-28 17:14:19] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-28 17:14:19] [INFO ] Invariant cache hit.
[2024-05-28 17:14:19] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-28 17:14:19] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2024-05-28 17:14:19] [INFO ] Redundant transitions in 7 ms returned []
Running 135 sub problems to find dead transitions.
[2024-05-28 17:14:20] [INFO ] Invariant cache hit.
[2024-05-28 17:14:20] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 1/118 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 136/254 variables, 118/122 constraints. Problems are: Problem set: 0 solved, 135 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 51/173 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 0/254 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 173 constraints, problems are : Problem set: 0 solved, 135 unsolved in 6645 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 1/118 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 136/254 variables, 118/122 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 51/173 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 135/308 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-28 17:14:30] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 2 ms to minimize.
[2024-05-28 17:14:30] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-05-28 17:14:31] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 2 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 3/311 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/311 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 10 (OVERLAPS) 0/254 variables, 0/311 constraints. Problems are: Problem set: 3 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 311 constraints, problems are : Problem set: 3 solved, 132 unsolved in 18121 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 3/3 constraints]
After SMT, in 25263ms problems are : Problem set: 3 solved, 132 unsolved
Search for dead transitions found 3 dead transitions in 25298ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 118/118 places, 133/136 transitions.
Graph (complete) has 335 edges and 118 vertex of which 115 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 115 /118 variables (removed 3) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 115 cols
[2024-05-28 17:14:45] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 17:14:45] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-28 17:14:45] [INFO ] Invariant cache hit.
[2024-05-28 17:14:45] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-28 17:14:45] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 115/118 places, 133/136 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 26512 ms. Remains : 115/118 places, 133/136 transitions.
[2024-05-28 17:14:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
RANDOM walk for 1000000 steps (224103 resets) in 1766 ms. (565 steps per ms)
BEST_FIRST walk for 5000004 steps (516390 resets) in 3441 ms. (1452 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
[2024-05-28 17:14:50] [INFO ] Invariant cache hit.
[2024-05-28 17:14:51] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 17:14:51] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-28 17:14:51] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-28 17:14:51] [INFO ] [Real]Added 50 Read/Feed constraints in 13 ms returned sat
[2024-05-28 17:14:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:14:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-28 17:14:51] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-28 17:14:51] [INFO ] [Nat]Added 50 Read/Feed constraints in 19 ms returned sat
[2024-05-28 17:14:51] [INFO ] Computed and/alt/rep : 32/83/32 causal constraints (skipped 100 transitions) in 10 ms.
[2024-05-28 17:14:51] [INFO ] Added : 12 causal constraints over 3 iterations in 61 ms. Result :sat
Minimization took 81 ms.
[2024-05-28 17:14:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 17:14:51] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-28 17:14:51] [INFO ] [Real]Added 50 Read/Feed constraints in 21 ms returned sat
[2024-05-28 17:14:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:14:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 17:14:51] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-28 17:14:51] [INFO ] [Nat]Added 50 Read/Feed constraints in 18 ms returned sat
[2024-05-28 17:14:51] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-28 17:14:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-28 17:14:51] [INFO ] Computed and/alt/rep : 32/83/32 causal constraints (skipped 100 transitions) in 13 ms.
[2024-05-28 17:14:51] [INFO ] Added : 23 causal constraints over 5 iterations in 136 ms. Result :sat
Minimization took 100 ms.
[2024-05-28 17:14:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 17:14:52] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-28 17:14:52] [INFO ] [Real]Added 50 Read/Feed constraints in 19 ms returned sat
[2024-05-28 17:14:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:14:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 17:14:52] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-28 17:14:52] [INFO ] [Nat]Added 50 Read/Feed constraints in 25 ms returned sat
[2024-05-28 17:14:52] [INFO ] Computed and/alt/rep : 32/83/32 causal constraints (skipped 100 transitions) in 18 ms.
[2024-05-28 17:14:52] [INFO ] Added : 13 causal constraints over 4 iterations in 109 ms. Result :sat
Minimization took 94 ms.
[2024-05-28 17:14:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 17:14:52] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-28 17:14:52] [INFO ] [Real]Added 50 Read/Feed constraints in 20 ms returned sat
[2024-05-28 17:14:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:14:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-28 17:14:52] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-28 17:14:52] [INFO ] [Nat]Added 50 Read/Feed constraints in 17 ms returned sat
[2024-05-28 17:14:52] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 11 ms to minimize.
[2024-05-28 17:14:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2024-05-28 17:14:53] [INFO ] Computed and/alt/rep : 32/83/32 causal constraints (skipped 100 transitions) in 17 ms.
[2024-05-28 17:14:53] [INFO ] Added : 20 causal constraints over 5 iterations in 139 ms. Result :sat
Minimization took 102 ms.
[2024-05-28 17:14:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 17:14:53] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-28 17:14:53] [INFO ] [Real]Added 50 Read/Feed constraints in 20 ms returned sat
[2024-05-28 17:14:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:14:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 17:14:53] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-28 17:14:53] [INFO ] [Nat]Added 50 Read/Feed constraints in 19 ms returned sat
[2024-05-28 17:14:53] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 3 ms to minimize.
[2024-05-28 17:14:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-05-28 17:14:53] [INFO ] Computed and/alt/rep : 32/83/32 causal constraints (skipped 100 transitions) in 16 ms.
[2024-05-28 17:14:53] [INFO ] Added : 21 causal constraints over 5 iterations in 136 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 133/133 transitions.
Applied a total of 0 rules in 19 ms. Remains 115 /115 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 115/115 places, 133/133 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 133/133 transitions.
Applied a total of 0 rules in 12 ms. Remains 115 /115 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-05-28 17:14:54] [INFO ] Invariant cache hit.
[2024-05-28 17:14:54] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-28 17:14:54] [INFO ] Invariant cache hit.
[2024-05-28 17:14:54] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-28 17:14:54] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2024-05-28 17:14:54] [INFO ] Redundant transitions in 4 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-28 17:14:54] [INFO ] Invariant cache hit.
[2024-05-28 17:14:54] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD119 is UNSAT
At refinement iteration 4 (OVERLAPS) 133/248 variables, 115/118 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 50/168 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/168 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/248 variables, 0/168 constraints. Problems are: Problem set: 3 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 168 constraints, problems are : Problem set: 3 solved, 129 unsolved in 6009 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 132/244 variables, 112/115 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 49/164 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 16/180 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 4/248 variables, 3/183 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 1/184 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 113/297 constraints. Problems are: Problem set: 3 solved, 129 unsolved
[2024-05-28 17:15:08] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-28 17:15:08] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 2 ms to minimize.
[2024-05-28 17:15:09] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 3/300 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 0/300 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 13 (OVERLAPS) 0/248 variables, 0/300 constraints. Problems are: Problem set: 3 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 300 constraints, problems are : Problem set: 3 solved, 129 unsolved in 19934 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 26228ms problems are : Problem set: 3 solved, 129 unsolved
Search for dead transitions found 3 dead transitions in 26231ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 115/115 places, 130/133 transitions.
Graph (complete) has 326 edges and 115 vertex of which 112 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 112 /115 variables (removed 3) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 112 cols
[2024-05-28 17:15:21] [INFO ] Computed 3 invariants in 4 ms
[2024-05-28 17:15:21] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-28 17:15:21] [INFO ] Invariant cache hit.
[2024-05-28 17:15:21] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 17:15:21] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 112/115 places, 130/133 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 27444 ms. Remains : 112/115 places, 130/133 transitions.
[2024-05-28 17:15:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
RANDOM walk for 1000000 steps (224680 resets) in 1382 ms. (723 steps per ms)
BEST_FIRST walk for 5000002 steps (517734 resets) in 2964 ms. (1686 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 1, 1]
[2024-05-28 17:15:26] [INFO ] Invariant cache hit.
[2024-05-28 17:15:26] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 17:15:26] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:15:26] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-28 17:15:26] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 17:15:26] [INFO ] [Real]Added 49 Read/Feed constraints in 16 ms returned sat
[2024-05-28 17:15:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:15:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 17:15:26] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 17:15:26] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-28 17:15:26] [INFO ] [Nat]Added 49 Read/Feed constraints in 25 ms returned sat
[2024-05-28 17:15:26] [INFO ] Computed and/alt/rep : 31/76/31 causal constraints (skipped 98 transitions) in 17 ms.
[2024-05-28 17:15:26] [INFO ] Added : 12 causal constraints over 3 iterations in 86 ms. Result :sat
Minimization took 109 ms.
[2024-05-28 17:15:26] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 17:15:26] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 17:15:26] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-28 17:15:26] [INFO ] [Real]Added 49 Read/Feed constraints in 22 ms returned sat
[2024-05-28 17:15:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:15:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 17:15:26] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 17:15:26] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-28 17:15:27] [INFO ] [Nat]Added 49 Read/Feed constraints in 27 ms returned sat
[2024-05-28 17:15:27] [INFO ] Computed and/alt/rep : 31/76/31 causal constraints (skipped 98 transitions) in 15 ms.
[2024-05-28 17:15:27] [INFO ] Added : 23 causal constraints over 5 iterations in 130 ms. Result :sat
Minimization took 121 ms.
[2024-05-28 17:15:27] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 17:15:27] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 17:15:27] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-28 17:15:27] [INFO ] [Real]Added 49 Read/Feed constraints in 18 ms returned sat
[2024-05-28 17:15:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:15:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 17:15:27] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:15:27] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-28 17:15:27] [INFO ] [Nat]Added 49 Read/Feed constraints in 23 ms returned sat
[2024-05-28 17:15:27] [INFO ] Computed and/alt/rep : 31/76/31 causal constraints (skipped 98 transitions) in 17 ms.
[2024-05-28 17:15:27] [INFO ] Added : 12 causal constraints over 3 iterations in 86 ms. Result :sat
Minimization took 102 ms.
[2024-05-28 17:15:27] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 17:15:27] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:15:27] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-28 17:15:28] [INFO ] [Real]Added 49 Read/Feed constraints in 29 ms returned sat
[2024-05-28 17:15:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:15:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 17:15:28] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 17:15:28] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-28 17:15:28] [INFO ] [Nat]Added 49 Read/Feed constraints in 20 ms returned sat
[2024-05-28 17:15:28] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 2 ms to minimize.
[2024-05-28 17:15:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 59 ms
[2024-05-28 17:15:28] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 17:15:28] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:15:28] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-28 17:15:28] [INFO ] [Real]Added 49 Read/Feed constraints in 15 ms returned sat
[2024-05-28 17:15:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:15:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 17:15:28] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:15:28] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-28 17:15:28] [INFO ] [Nat]Added 49 Read/Feed constraints in 24 ms returned sat
[2024-05-28 17:15:28] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 2 ms to minimize.
[2024-05-28 17:15:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 1, 42, 0, 0]
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 130/130 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 110 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 109 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 109 transition count 124
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 108 transition count 123
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 108 transition count 123
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 107 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 107 transition count 122
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 106 transition count 121
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 106 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 105 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 105 transition count 120
Applied a total of 16 rules in 26 ms. Remains 105 /112 variables (removed 7) and now considering 120/130 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 105/112 places, 120/130 transitions.
// Phase 1: matrix 120 rows 105 cols
[2024-05-28 17:15:28] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
RANDOM walk for 1000000 steps (224635 resets) in 1320 ms. (757 steps per ms)
BEST_FIRST walk for 3000002 steps (309064 resets) in 1821 ms. (1646 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
[2024-05-28 17:15:31] [INFO ] Invariant cache hit.
[2024-05-28 17:15:31] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 17:15:31] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-28 17:15:31] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 17:15:32] [INFO ] [Real]Added 44 Read/Feed constraints in 15 ms returned sat
[2024-05-28 17:15:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:15:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 17:15:32] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-28 17:15:32] [INFO ] [Nat]Added 44 Read/Feed constraints in 13 ms returned sat
[2024-05-28 17:15:32] [INFO ] Computed and/alt/rep : 29/69/29 causal constraints (skipped 90 transitions) in 10 ms.
[2024-05-28 17:15:32] [INFO ] Added : 13 causal constraints over 4 iterations in 62 ms. Result :sat
Minimization took 50 ms.
[2024-05-28 17:15:32] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 17:15:32] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-28 17:15:32] [INFO ] [Real]Added 44 Read/Feed constraints in 21 ms returned sat
[2024-05-28 17:15:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:15:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 17:15:32] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-28 17:15:32] [INFO ] [Nat]Added 44 Read/Feed constraints in 16 ms returned sat
[2024-05-28 17:15:32] [INFO ] Computed and/alt/rep : 29/69/29 causal constraints (skipped 90 transitions) in 15 ms.
[2024-05-28 17:15:32] [INFO ] Added : 22 causal constraints over 5 iterations in 94 ms. Result :sat
Minimization took 52 ms.
[2024-05-28 17:15:32] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 17:15:32] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-28 17:15:32] [INFO ] [Real]Added 44 Read/Feed constraints in 17 ms returned sat
[2024-05-28 17:15:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:15:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 17:15:32] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-28 17:15:32] [INFO ] [Nat]Added 44 Read/Feed constraints in 15 ms returned sat
[2024-05-28 17:15:33] [INFO ] Computed and/alt/rep : 29/69/29 causal constraints (skipped 90 transitions) in 17 ms.
[2024-05-28 17:15:33] [INFO ] Added : 14 causal constraints over 3 iterations in 93 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1] Max Struct:[42, 1, 42]
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 120/120 transitions.
Applied a total of 0 rules in 9 ms. Remains 105 /105 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 105/105 places, 120/120 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 120/120 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-28 17:15:33] [INFO ] Invariant cache hit.
[2024-05-28 17:15:33] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-28 17:15:33] [INFO ] Invariant cache hit.
[2024-05-28 17:15:33] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 17:15:33] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
[2024-05-28 17:15:33] [INFO ] Redundant transitions in 5 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-28 17:15:33] [INFO ] Invariant cache hit.
[2024-05-28 17:15:33] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/225 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 44/152 constraints. Problems are: Problem set: 0 solved, 119 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/225 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 152 constraints, problems are : Problem set: 0 solved, 119 unsolved in 4356 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/225 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 44/152 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 119/271 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 17:15:41] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 1/272 constraints. Problems are: Problem set: 3 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/272 constraints. Problems are: Problem set: 3 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/272 constraints. Problems are: Problem set: 3 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 272 constraints, problems are : Problem set: 3 solved, 116 unsolved in 13574 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 1/1 constraints]
After SMT, in 18136ms problems are : Problem set: 3 solved, 116 unsolved
Search for dead transitions found 3 dead transitions in 18140ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 105/105 places, 117/120 transitions.
Graph (complete) has 295 edges and 105 vertex of which 102 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 102 /105 variables (removed 3) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 102 cols
[2024-05-28 17:15:52] [INFO ] Computed 2 invariants in 2 ms
[2024-05-28 17:15:52] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-28 17:15:52] [INFO ] Invariant cache hit.
[2024-05-28 17:15:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 17:15:52] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 102/105 places, 117/120 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 19282 ms. Remains : 102/105 places, 117/120 transitions.
[2024-05-28 17:15:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1] Max Struct:[42, 1, 42]
RANDOM walk for 1000000 steps (224547 resets) in 1038 ms. (962 steps per ms)
BEST_FIRST walk for 3000001 steps (309577 resets) in 1588 ms. (1887 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1] Max Struct:[42, 1, 42]
[2024-05-28 17:15:55] [INFO ] Invariant cache hit.
[2024-05-28 17:15:55] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-28 17:15:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 17:15:55] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-28 17:15:55] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 17:15:55] [INFO ] [Real]Added 43 Read/Feed constraints in 17 ms returned sat
[2024-05-28 17:15:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:15:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-28 17:15:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:15:55] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-28 17:15:55] [INFO ] [Nat]Added 43 Read/Feed constraints in 24 ms returned sat
[2024-05-28 17:15:55] [INFO ] Computed and/alt/rep : 28/64/28 causal constraints (skipped 88 transitions) in 10 ms.
[2024-05-28 17:15:55] [INFO ] Added : 13 causal constraints over 4 iterations in 79 ms. Result :sat
Minimization took 79 ms.
[2024-05-28 17:15:55] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 17:15:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:15:55] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-28 17:15:55] [INFO ] [Real]Added 43 Read/Feed constraints in 22 ms returned sat
[2024-05-28 17:15:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:15:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 17:15:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:15:55] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-28 17:15:55] [INFO ] [Nat]Added 43 Read/Feed constraints in 18 ms returned sat
[2024-05-28 17:15:56] [INFO ] Computed and/alt/rep : 28/64/28 causal constraints (skipped 88 transitions) in 11 ms.
[2024-05-28 17:15:56] [INFO ] Added : 20 causal constraints over 4 iterations in 89 ms. Result :sat
Minimization took 75 ms.
[2024-05-28 17:15:56] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 17:15:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:15:56] [INFO ] [Real]Absence check using state equation in 34 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1] Max Struct:[42, 1, 1]
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[42, 1]
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 101 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 100 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 100 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 100 transition count 113
Applied a total of 5 rules in 15 ms. Remains 100 /102 variables (removed 2) and now considering 113/117 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 100/102 places, 113/117 transitions.
// Phase 1: matrix 113 rows 100 cols
[2024-05-28 17:15:56] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[42, 1]
RANDOM walk for 1000000 steps (224517 resets) in 1336 ms. (747 steps per ms)
BEST_FIRST walk for 2000001 steps (206870 resets) in 1053 ms. (1897 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[42, 1]
[2024-05-28 17:15:58] [INFO ] Invariant cache hit.
[2024-05-28 17:15:58] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 17:15:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:15:58] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-28 17:15:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 17:15:58] [INFO ] [Real]Added 42 Read/Feed constraints in 21 ms returned sat
[2024-05-28 17:15:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:15:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-28 17:15:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 17:15:58] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-28 17:15:59] [INFO ] [Nat]Added 42 Read/Feed constraints in 22 ms returned sat
[2024-05-28 17:15:59] [INFO ] Computed and/alt/rep : 27/61/27 causal constraints (skipped 85 transitions) in 15 ms.
[2024-05-28 17:15:59] [INFO ] Added : 13 causal constraints over 3 iterations in 82 ms. Result :sat
Minimization took 77 ms.
[2024-05-28 17:15:59] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-28 17:15:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:15:59] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-28 17:15:59] [INFO ] [Real]Added 42 Read/Feed constraints in 29 ms returned sat
[2024-05-28 17:15:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:15:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-28 17:15:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:15:59] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-28 17:15:59] [INFO ] [Nat]Added 42 Read/Feed constraints in 19 ms returned sat
[2024-05-28 17:15:59] [INFO ] Computed and/alt/rep : 27/61/27 causal constraints (skipped 85 transitions) in 13 ms.
[2024-05-28 17:15:59] [INFO ] Added : 21 causal constraints over 5 iterations in 114 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[42, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[42, 1]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 113/113 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 100/100 places, 113/113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 113/113 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-05-28 17:15:59] [INFO ] Invariant cache hit.
[2024-05-28 17:16:00] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-28 17:16:00] [INFO ] Invariant cache hit.
[2024-05-28 17:16:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 17:16:00] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2024-05-28 17:16:00] [INFO ] Redundant transitions in 4 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-28 17:16:00] [INFO ] Invariant cache hit.
[2024-05-28 17:16:00] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/213 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 42/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 144 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4461 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/213 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 42/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 112/256 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 17:16:07] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/213 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 257 constraints, problems are : Problem set: 0 solved, 112 unsolved in 11646 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
After SMT, in 16302ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 16304ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16847 ms. Remains : 100/100 places, 113/113 transitions.
RANDOM walk for 40000 steps (9018 resets) in 1381 ms. (28 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4159 resets) in 442 ms. (90 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4130 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4206 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4121 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 569801 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 4
Probabilistic random walk after 569801 steps, saw 268725 distinct states, run finished after 3005 ms. (steps per millisecond=189 ) properties seen :0
[2024-05-28 17:16:20] [INFO ] Invariant cache hit.
[2024-05-28 17:16:20] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 59/98 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 67/165 variables, 30/71 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 25/96 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 48/213 variables, 31/127 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 17/144 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/213 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 144 constraints, problems are : Problem set: 1 solved, 3 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/39 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 59/98 variables, 39/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 67/165 variables, 30/71 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 25/96 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 3/99 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 48/213 variables, 31/130 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 17/147 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-28 17:16:20] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 10 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 1/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/213 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 148 constraints, problems are : Problem set: 1 solved, 3 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 564ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 324 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 113/113 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 100/100 places, 113/113 transitions.
RANDOM walk for 40000 steps (8938 resets) in 207 ms. (192 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4105 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (4094 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4112 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 907127 steps, run timeout after 3001 ms. (steps per millisecond=302 ) properties seen :0 out of 3
Probabilistic random walk after 907127 steps, saw 425985 distinct states, run finished after 3001 ms. (steps per millisecond=302 ) properties seen :0
[2024-05-28 17:16:24] [INFO ] Invariant cache hit.
[2024-05-28 17:16:24] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 59/98 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 67/165 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 48/213 variables, 31/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 17/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/213 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 144 constraints, problems are : Problem set: 0 solved, 3 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 59/98 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 67/165 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 48/213 variables, 31/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 17/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 17:16:25] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/213 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 148 constraints, problems are : Problem set: 0 solved, 3 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 636ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 617 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 113/113 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 100/100 places, 113/113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 113/113 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-05-28 17:16:25] [INFO ] Invariant cache hit.
[2024-05-28 17:16:26] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-28 17:16:26] [INFO ] Invariant cache hit.
[2024-05-28 17:16:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 17:16:26] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2024-05-28 17:16:26] [INFO ] Redundant transitions in 1 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-28 17:16:26] [INFO ] Invariant cache hit.
[2024-05-28 17:16:26] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/213 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 42/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 144 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4668 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/213 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 42/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 112/256 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 17:16:33] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/213 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 257 constraints, problems are : Problem set: 0 solved, 112 unsolved in 11511 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
After SMT, in 16389ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 16392ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16921 ms. Remains : 100/100 places, 113/113 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 100 transition count 105
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 94 transition count 105
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 14 place count 94 transition count 88
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 48 place count 77 transition count 88
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 56 place count 73 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 72 transition count 93
Applied a total of 58 rules in 24 ms. Remains 72 /100 variables (removed 28) and now considering 93/113 (removed 20) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 93 rows 72 cols
[2024-05-28 17:16:42] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 17:16:42] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 17:16:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 17:16:42] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-28 17:16:42] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-28 17:16:43] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-05-28 17:16:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
TRAPS : Iteration 1
[2024-05-28 17:16:43] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-28 17:16:43] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 328 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[42, 1]
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[42]
// Phase 1: matrix 113 rows 100 cols
[2024-05-28 17:16:43] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 10000 steps (2233 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (1039 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2024-05-28 17:16:43] [INFO ] Invariant cache hit.
[2024-05-28 17:16:43] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 17:16:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 17:16:43] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-28 17:16:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 17:16:43] [INFO ] [Real]Added 42 Read/Feed constraints in 11 ms returned sat
[2024-05-28 17:16:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:16:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 17:16:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:16:43] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-28 17:16:43] [INFO ] [Nat]Added 42 Read/Feed constraints in 15 ms returned sat
[2024-05-28 17:16:43] [INFO ] Computed and/alt/rep : 27/61/27 causal constraints (skipped 85 transitions) in 11 ms.
[2024-05-28 17:16:43] [INFO ] Added : 13 causal constraints over 3 iterations in 61 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 113/113 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 98 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 98 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 98 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 97 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 97 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 96 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 96 transition count 107
Applied a total of 9 rules in 13 ms. Remains 96 /100 variables (removed 4) and now considering 107/113 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 96/100 places, 107/113 transitions.
// Phase 1: matrix 107 rows 96 cols
[2024-05-28 17:16:43] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 1000000 steps (224523 resets) in 997 ms. (1002 steps per ms)
BEST_FIRST walk for 1000001 steps (103274 resets) in 491 ms. (2032 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2024-05-28 17:16:45] [INFO ] Invariant cache hit.
[2024-05-28 17:16:45] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 17:16:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:16:45] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-28 17:16:45] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-28 17:16:45] [INFO ] [Real]Added 39 Read/Feed constraints in 9 ms returned sat
[2024-05-28 17:16:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:16:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 17:16:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 17:16:45] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-28 17:16:45] [INFO ] [Nat]Added 39 Read/Feed constraints in 10 ms returned sat
[2024-05-28 17:16:45] [INFO ] Computed and/alt/rep : 25/60/25 causal constraints (skipped 81 transitions) in 7 ms.
[2024-05-28 17:16:45] [INFO ] Added : 15 causal constraints over 3 iterations in 52 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 96/96 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 107/107 transitions.
Applied a total of 0 rules in 6 ms. Remains 96 /96 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-28 17:16:45] [INFO ] Invariant cache hit.
[2024-05-28 17:16:45] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-28 17:16:45] [INFO ] Invariant cache hit.
[2024-05-28 17:16:45] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-28 17:16:45] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2024-05-28 17:16:45] [INFO ] Redundant transitions in 1 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-28 17:16:45] [INFO ] Invariant cache hit.
[2024-05-28 17:16:45] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/203 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 39/137 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 137 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4445 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/203 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 39/137 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 106/243 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 17:16:53] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/203 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 244 constraints, problems are : Problem set: 0 solved, 106 unsolved in 11437 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 1/1 constraints]
After SMT, in 16062ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 16065ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16564 ms. Remains : 96/96 places, 107/107 transitions.
RANDOM walk for 40000 steps (8997 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4097 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4174 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 695631 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :0 out of 2
Probabilistic random walk after 695631 steps, saw 327249 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :0
[2024-05-28 17:17:05] [INFO ] Invariant cache hit.
[2024-05-28 17:17:05] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 73/76 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 32/108 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/110 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 91/201 variables, 77/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 37/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/201 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/203 variables, 2/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/203 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/203 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 137 constraints, problems are : Problem set: 1 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/76 variables, 5/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/108 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 9/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/110 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 2/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 91/201 variables, 77/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/201 variables, 37/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/201 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/203 variables, 2/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 17:17:05] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/203 variables, 1/139 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/203 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/203 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 139 constraints, problems are : Problem set: 1 solved, 1 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 396ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 107/107 transitions.
Applied a total of 0 rules in 6 ms. Remains 96 /96 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 96/96 places, 107/107 transitions.
RANDOM walk for 40000 steps (8967 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4031 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2200764 steps, run visited all 1 properties in 2968 ms. (steps per millisecond=741 )
Probabilistic random walk after 2200764 steps, saw 1031697 distinct states, run finished after 2978 ms. (steps per millisecond=739 ) properties seen :1
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[42]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-01 in 25413 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 113 rows 100 cols
[2024-05-28 17:17:08] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2221 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10001 steps (1089 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-28 17:17:08] [INFO ] Invariant cache hit.
[2024-05-28 17:17:08] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 17:17:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 17:17:08] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-28 17:17:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 17:17:08] [INFO ] [Real]Added 42 Read/Feed constraints in 17 ms returned sat
[2024-05-28 17:17:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:17:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 17:17:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:17:08] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-28 17:17:08] [INFO ] [Nat]Added 42 Read/Feed constraints in 11 ms returned sat
[2024-05-28 17:17:08] [INFO ] Computed and/alt/rep : 27/61/27 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-28 17:17:08] [INFO ] Added : 21 causal constraints over 5 iterations in 102 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 100 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p28) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 112/112 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 98 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 98 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 98 transition count 109
Applied a total of 5 rules in 12 ms. Remains 98 /100 variables (removed 2) and now considering 109/112 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 98/100 places, 109/112 transitions.
// Phase 1: matrix 109 rows 98 cols
[2024-05-28 17:17:09] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (224073 resets) in 1277 ms. (782 steps per ms)
BEST_FIRST walk for 1000001 steps (103038 resets) in 504 ms. (1980 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-28 17:17:10] [INFO ] Invariant cache hit.
[2024-05-28 17:17:10] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 17:17:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:17:10] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-28 17:17:10] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 17:17:10] [INFO ] [Real]Added 41 Read/Feed constraints in 12 ms returned sat
[2024-05-28 17:17:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:17:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 17:17:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:17:10] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-28 17:17:10] [INFO ] [Nat]Added 41 Read/Feed constraints in 9 ms returned sat
[2024-05-28 17:17:11] [INFO ] Computed and/alt/rep : 25/58/25 causal constraints (skipped 83 transitions) in 9 ms.
[2024-05-28 17:17:11] [INFO ] Added : 20 causal constraints over 4 iterations in 64 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 98/98 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-28 17:17:11] [INFO ] Invariant cache hit.
[2024-05-28 17:17:11] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 17:17:11] [INFO ] Invariant cache hit.
[2024-05-28 17:17:11] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 17:17:11] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-05-28 17:17:11] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-28 17:17:11] [INFO ] Invariant cache hit.
[2024-05-28 17:17:11] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/207 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 17:17:15] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/207 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 142 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6608 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 109/207 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 108/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 250 constraints, problems are : Problem set: 0 solved, 108 unsolved in 9227 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
After SMT, in 16017ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 16021ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16521 ms. Remains : 98/98 places, 109/109 transitions.
RANDOM walk for 40000 steps (8959 resets) in 220 ms. (180 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4117 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4219 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 740906 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :0 out of 2
Probabilistic random walk after 740906 steps, saw 348210 distinct states, run finished after 3002 ms. (steps per millisecond=246 ) properties seen :0
[2024-05-28 17:17:30] [INFO ] Invariant cache hit.
[2024-05-28 17:17:30] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/94 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 64/158 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 49/207 variables, 32/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 17/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/207 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 141 constraints, problems are : Problem set: 0 solved, 2 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/94 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 64/158 variables, 28/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 24/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 49/207 variables, 32/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 17/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 143 constraints, problems are : Problem set: 0 solved, 2 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 285ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 98/98 places, 109/109 transitions.
RANDOM walk for 40000 steps (8915 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4145 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4045 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 825992 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :0 out of 2
Probabilistic random walk after 825992 steps, saw 385817 distinct states, run finished after 3005 ms. (steps per millisecond=274 ) properties seen :0
[2024-05-28 17:17:34] [INFO ] Invariant cache hit.
[2024-05-28 17:17:34] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/94 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 64/158 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 49/207 variables, 32/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 17/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/207 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 141 constraints, problems are : Problem set: 0 solved, 2 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/94 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 64/158 variables, 28/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 24/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 49/207 variables, 32/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 17/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 143 constraints, problems are : Problem set: 0 solved, 2 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 322ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 98/98 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 109/109 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-28 17:17:34] [INFO ] Invariant cache hit.
[2024-05-28 17:17:34] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 17:17:34] [INFO ] Invariant cache hit.
[2024-05-28 17:17:34] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 17:17:35] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2024-05-28 17:17:35] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-28 17:17:35] [INFO ] Invariant cache hit.
[2024-05-28 17:17:35] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/207 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 17:17:39] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/207 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 142 constraints, problems are : Problem set: 0 solved, 108 unsolved in 8321 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 109/207 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 108/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 250 constraints, problems are : Problem set: 0 solved, 108 unsolved in 9135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
After SMT, in 17625ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 17628ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18115 ms. Remains : 98/98 places, 109/109 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 101
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 92 transition count 101
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 14 place count 92 transition count 84
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 48 place count 75 transition count 84
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 56 place count 71 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 70 transition count 88
Applied a total of 58 rules in 12 ms. Remains 70 /98 variables (removed 28) and now considering 88/109 (removed 21) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 88 rows 70 cols
[2024-05-28 17:17:52] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 17:17:52] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 17:17:52] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:17:52] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-28 17:17:52] [INFO ] After 58ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-05-28 17:17:52] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 127 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-05 in 44358 ms.
[2024-05-28 17:17:53] [INFO ] Flatten gal took : 74 ms
[2024-05-28 17:17:53] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-28 17:17:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 100 places, 113 transitions and 447 arcs took 6 ms.
Total runtime 257729 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SieveSingleMsgMbox-PT-d2m18

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/405/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 100
TRANSITIONS: 113
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]

SAVING FILE /home/mcc/execution/405/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]

----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1086
MODEL NAME: /home/mcc/execution/405/model
100 places, 113 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716916699619

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="SieveSingleMsgMbox-PT-d2m18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is SieveSingleMsgMbox-PT-d2m18, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r377-smll-171683809700117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m18.tgz
mv SieveSingleMsgMbox-PT-d2m18 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;