MCC'2022- Execution of r078-tall-165260110000221

About the Execution of ITS-Tools for DoubleExponent-PT-200

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
4284.640	3600000.00	3759807.00	9478.40	[undef]	Time out reached

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 7.0K Apr 29 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 29 13:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 29 13:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 3.5M May 10 09:33 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 DoubleExponent-PT-200-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652652223266

Running Version 202205111006
[2022-05-15 22:03:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 22:03:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 22:03:44] [INFO ] Load time of PNML (sax parser for PT used): 334 ms
[2022-05-15 22:03:44] [INFO ] Transformed 10604 places.
[2022-05-15 22:03:44] [INFO ] Transformed 9998 transitions.
[2022-05-15 22:03:44] [INFO ] Parsed PT model containing 10604 places and 9998 transitions in 493 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 9998 rows 10604 cols
[2022-05-15 22:03:48] [INFO ] Invariants computation overflowed in 360 ms
Incomplete random walk after 10000 steps, including 333 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 273 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 275 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 278 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 278 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 300 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :0
// Phase 1: matrix 9998 rows 10604 cols
[2022-05-15 22:03:49] [INFO ] Invariants computation overflowed in 263 ms
[2022-05-15 22:03:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:03:54] [INFO ] [Real]Absence check using state equation in 3326 ms returned unknown
[2022-05-15 22:03:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:03:59] [INFO ] [Real]Absence check using state equation in 4137 ms returned unknown
[2022-05-15 22:04:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:04:04] [INFO ] [Real]Absence check using state equation in 4087 ms returned unknown
[2022-05-15 22:04:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:04:09] [INFO ] [Real]Absence check using state equation in 4082 ms returned unknown
[2022-05-15 22:04:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:04:14] [INFO ] [Real]Absence check using state equation in 4028 ms returned unknown
[2022-05-15 22:04:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:04:19] [INFO ] [Real]Absence check using state equation in 4101 ms returned unknown
[2022-05-15 22:04:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:04:24] [INFO ] [Real]Absence check using state equation in 4108 ms returned unknown
[2022-05-15 22:04:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:04:29] [INFO ] [Real]Absence check using state equation in 4069 ms returned unknown
[2022-05-15 22:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:04:35] [INFO ] [Real]Absence check using state equation in 4101 ms returned unknown
[2022-05-15 22:04:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:04:40] [INFO ] [Real]Absence check using state equation in 4055 ms returned unknown
[2022-05-15 22:04:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:04:45] [INFO ] [Real]Absence check using state equation in 4107 ms returned unknown
[2022-05-15 22:04:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:04:50] [INFO ] [Real]Absence check using state equation in 4133 ms returned unknown
[2022-05-15 22:04:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:04:55] [INFO ] [Real]Absence check using state equation in 4083 ms returned unknown
[2022-05-15 22:04:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:05:00] [INFO ] [Real]Absence check using state equation in 4082 ms returned unknown
[2022-05-15 22:05:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:05:05] [INFO ] [Real]Absence check using state equation in 4082 ms returned unknown
[2022-05-15 22:05:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:05:10] [INFO ] [Real]Absence check using state equation in 4054 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 10604 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10604/10604 places, 9998/9998 transitions.
Graph (complete) has 18196 edges and 10604 vertex of which 10598 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.32 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2377 transitions
Trivial Post-agglo rules discarded 2377 transitions
Performed 2377 trivial Post agglomeration. Transition count delta: 2377
Iterating post reduction 0 with 2380 rules applied. Total rules applied 2381 place count 10597 transition count 7619
Reduce places removed 2377 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 2386 rules applied. Total rules applied 4767 place count 8220 transition count 7610
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 4776 place count 8211 transition count 7610
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 401 Pre rules applied. Total rules applied 4776 place count 8211 transition count 7209
Deduced a syphon composed of 401 places in 732 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 5578 place count 7810 transition count 7209
Performed 1801 Post agglomeration using F-continuation condition.Transition count delta: 1801
Deduced a syphon composed of 1801 places in 548 ms
Reduce places removed 1801 places and 0 transitions.
Iterating global reduction 3 with 3602 rules applied. Total rules applied 9180 place count 6009 transition count 5408
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 217 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9382 place count 5908 transition count 5408
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 241 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9584 place count 5807 transition count 5408
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 210 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9786 place count 5706 transition count 5408
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 93 places in 183 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 9972 place count 5613 transition count 5408
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9973 place count 5613 transition count 5407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9974 place count 5612 transition count 5407
Free-agglomeration rule (complex) applied 796 times.
Iterating global reduction 4 with 796 rules applied. Total rules applied 10770 place count 5612 transition count 4611
Reduce places removed 796 places and 0 transitions.
Iterating post reduction 4 with 796 rules applied. Total rules applied 11566 place count 4816 transition count 4611
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 807 times.
Drop transitions removed 807 transitions
Iterating global reduction 5 with 807 rules applied. Total rules applied 12373 place count 4816 transition count 4611
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 12374 place count 4815 transition count 4610
Applied a total of 12374 rules in 8869 ms. Remains 4815 /10604 variables (removed 5789) and now considering 4610/9998 (removed 5388) transitions.
Finished structural reductions, in 1 iterations. Remains : 4815/10604 places, 4610/9998 transitions.
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:05:19] [INFO ] Invariants computation overflowed in 93 ms
Incomplete random walk after 1000000 steps, including 128243 resets, run finished after 2502 ms. (steps per millisecond=399 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84602 resets, run finished after 1638 ms. (steps per millisecond=610 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84799 resets, run finished after 1705 ms. (steps per millisecond=586 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84515 resets, run finished after 1726 ms. (steps per millisecond=579 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84768 resets, run finished after 1561 ms. (steps per millisecond=640 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84811 resets, run finished after 1567 ms. (steps per millisecond=638 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84592 resets, run finished after 1549 ms. (steps per millisecond=645 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84650 resets, run finished after 1564 ms. (steps per millisecond=639 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84540 resets, run finished after 1562 ms. (steps per millisecond=640 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84531 resets, run finished after 1545 ms. (steps per millisecond=647 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84779 resets, run finished after 1559 ms. (steps per millisecond=641 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84864 resets, run finished after 1554 ms. (steps per millisecond=643 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84570 resets, run finished after 1553 ms. (steps per millisecond=643 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84830 resets, run finished after 1573 ms. (steps per millisecond=635 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84632 resets, run finished after 1567 ms. (steps per millisecond=638 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84753 resets, run finished after 1576 ms. (steps per millisecond=634 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84823 resets, run finished after 1557 ms. (steps per millisecond=642 ) properties (out of 16) seen :0
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:05:47] [INFO ] Invariants computation overflowed in 130 ms
[2022-05-15 22:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:06:32] [INFO ] [Real]Absence check using state equation in 44613 ms returned unknown
[2022-05-15 22:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:06:56] [INFO ] [Real]Absence check using state equation in 23755 ms returned sat
[2022-05-15 22:06:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:06:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:07:35] [INFO ] [Nat]Absence check using state equation in 38274 ms returned sat
[2022-05-15 22:07:35] [INFO ] State equation strengthened by 797 read => feed constraints.
[2022-05-15 22:07:38] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 22:07:41] [INFO ] [Nat]Added 797 Read/Feed constraints in 6084 ms returned unknown
[2022-05-15 22:07:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:08:26] [INFO ] [Real]Absence check using state equation in 44606 ms returned unknown
[2022-05-15 22:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:09:11] [INFO ] [Real]Absence check using state equation in 44622 ms returned unknown
[2022-05-15 22:09:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:09:15] [INFO ] [Real]Absence check using state equation in 3205 ms returned sat
[2022-05-15 22:09:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:09:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:09:45] [INFO ] [Nat]Absence check using state equation in 28896 ms returned sat
[2022-05-15 22:09:48] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 22:09:51] [INFO ] [Nat]Added 797 Read/Feed constraints in 6927 ms returned unknown
[2022-05-15 22:09:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:10:36] [INFO ] [Real]Absence check using state equation in 44627 ms returned unknown
[2022-05-15 22:10:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:11:21] [INFO ] [Real]Absence check using state equation in 44640 ms returned unknown
[2022-05-15 22:11:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:11:25] [INFO ] [Real]Absence check using state equation in 2920 ms returned sat
[2022-05-15 22:11:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:11:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:11:28] [INFO ] [Nat]Absence check using state equation in 2905 ms returned sat
[2022-05-15 22:11:29] [INFO ] [Nat]Added 797 Read/Feed constraints in 392 ms returned sat
[2022-05-15 22:11:40] [INFO ] Deduced a trap composed of 4 places in 11035 ms of which 22 ms to minimize.
[2022-05-15 22:11:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11433 ms
[2022-05-15 22:11:41] [INFO ] Computed and/alt/rep : 3637/22817/3637 causal constraints (skipped 972 transitions) in 953 ms.
[2022-05-15 22:11:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:12:16] [INFO ] [Real]Absence check using state equation in 34113 ms returned sat
[2022-05-15 22:12:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:12:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:12:54] [INFO ] [Nat]Absence check using state equation in 37820 ms returned unknown
[2022-05-15 22:12:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:13:09] [INFO ] [Real]Absence check using state equation in 14083 ms returned sat
[2022-05-15 22:13:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:13:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:13:27] [INFO ] [Nat]Absence check using state equation in 17636 ms returned unknown
[2022-05-15 22:13:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:14:12] [INFO ] [Real]Absence check using state equation in 44621 ms returned unknown
[2022-05-15 22:14:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:14:57] [INFO ] [Real]Absence check using state equation in 44618 ms returned unknown
[2022-05-15 22:14:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:15:42] [INFO ] [Real]Absence check using state equation in 44620 ms returned unknown
[2022-05-15 22:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:16:27] [INFO ] [Real]Absence check using state equation in 44605 ms returned unknown
[2022-05-15 22:16:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:17:12] [INFO ] [Real]Absence check using state equation in 44603 ms returned unknown
[2022-05-15 22:17:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:17:57] [INFO ] [Real]Absence check using state equation in 44644 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 4815 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4815/4815 places, 4610/4610 transitions.
Applied a total of 0 rules in 599 ms. Remains 4815 /4815 variables (removed 0) and now considering 4610/4610 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4815/4815 places, 4610/4610 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4815/4815 places, 4610/4610 transitions.
Applied a total of 0 rules in 580 ms. Remains 4815 /4815 variables (removed 0) and now considering 4610/4610 (removed 0) transitions.
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:17:58] [INFO ] Invariants computation overflowed in 111 ms
[2022-05-15 22:18:29] [INFO ] Performed 3422/4815 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:18:42] [INFO ] Implicit Places using invariants in 43739 ms returned []
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:18:42] [INFO ] Invariants computation overflowed in 93 ms
[2022-05-15 22:18:43] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 44689 ms to find 0 implicit places.
[2022-05-15 22:18:43] [INFO ] Redundant transitions in 482 ms returned []
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:18:43] [INFO ] Invariants computation overflowed in 92 ms
[2022-05-15 22:18:47] [INFO ] Dead Transitions using invariants and state equation in 3899 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4815/4815 places, 4610/4610 transitions.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-00
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:18:48] [INFO ] Invariants computation overflowed in 91 ms
Incomplete random walk after 10000 steps, including 1278 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 830 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:18:48] [INFO ] Invariants computation overflowed in 95 ms
[2022-05-15 22:18:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:18:53] [INFO ] [Real]Absence check using state equation in 4662 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4815 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4815/4815 places, 4610/4610 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4815 transition count 4607
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4812 transition count 4607
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 4812 transition count 4605
Deduced a syphon composed of 2 places in 256 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 4810 transition count 4605
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 250 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 4808 transition count 4603
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 254 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 4802 transition count 4604
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 4802 transition count 4596
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 42 place count 4794 transition count 4596
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 45 place count 4794 transition count 4596
Applied a total of 45 rules in 3997 ms. Remains 4794 /4815 variables (removed 21) and now considering 4596/4610 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 4794/4815 places, 4596/4610 transitions.
// Phase 1: matrix 4596 rows 4794 cols
[2022-05-15 22:18:58] [INFO ] Invariants computation overflowed in 82 ms
Incomplete random walk after 1000000 steps, including 128012 resets, run finished after 2454 ms. (steps per millisecond=407 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84542 resets, run finished after 1659 ms. (steps per millisecond=602 ) properties (out of 1) seen :0
// Phase 1: matrix 4596 rows 4794 cols
[2022-05-15 22:19:02] [INFO ] Invariants computation overflowed in 84 ms
[2022-05-15 22:19:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:19:47] [INFO ] [Real]Absence check using state equation in 44613 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4794 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4794/4794 places, 4596/4596 transitions.
Applied a total of 0 rules in 1067 ms. Remains 4794 /4794 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4794/4794 places, 4596/4596 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4794/4794 places, 4596/4596 transitions.
Applied a total of 0 rules in 1036 ms. Remains 4794 /4794 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4794 cols
[2022-05-15 22:19:49] [INFO ] Invariants computation overflowed in 84 ms
[2022-05-15 22:20:20] [INFO ] Performed 1093/4794 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:20:50] [INFO ] Performed 2026/4794 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:21:20] [INFO ] Performed 3046/4794 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:21:50] [INFO ] Performed 4398/4794 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:21:50] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:21:50] [INFO ] Implicit Places using invariants in 121194 ms returned []
// Phase 1: matrix 4596 rows 4794 cols
[2022-05-15 22:21:50] [INFO ] Invariants computation overflowed in 79 ms
[2022-05-15 22:21:51] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 122147 ms to find 0 implicit places.
[2022-05-15 22:21:52] [INFO ] Redundant transitions in 633 ms returned []
// Phase 1: matrix 4596 rows 4794 cols
[2022-05-15 22:21:52] [INFO ] Invariants computation overflowed in 80 ms
[2022-05-15 22:21:57] [INFO ] Dead Transitions using invariants and state equation in 4861 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4794/4794 places, 4596/4596 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-00 in 189612 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-01
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:21:57] [INFO ] Invariants computation overflowed in 99 ms
Incomplete random walk after 10000 steps, including 1270 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:21:57] [INFO ] Invariants computation overflowed in 96 ms
[2022-05-15 22:21:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:22:02] [INFO ] [Real]Absence check using state equation in 4607 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4815 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4815/4815 places, 4610/4610 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4815 transition count 4607
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4812 transition count 4607
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 4812 transition count 4605
Deduced a syphon composed of 2 places in 252 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 4810 transition count 4605
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 253 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 4808 transition count 4603
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 255 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 4802 transition count 4604
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 31 place count 4802 transition count 4599
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 36 place count 4797 transition count 4599
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 39 place count 4797 transition count 4599
Applied a total of 39 rules in 3773 ms. Remains 4797 /4815 variables (removed 18) and now considering 4599/4610 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 4797/4815 places, 4599/4610 transitions.
// Phase 1: matrix 4599 rows 4797 cols
[2022-05-15 22:22:07] [INFO ] Invariants computation overflowed in 85 ms
Incomplete random walk after 1000000 steps, including 128215 resets, run finished after 2198 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84226 resets, run finished after 1496 ms. (steps per millisecond=668 ) properties (out of 1) seen :0
// Phase 1: matrix 4599 rows 4797 cols
[2022-05-15 22:22:11] [INFO ] Invariants computation overflowed in 86 ms
[2022-05-15 22:22:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:22:48] [INFO ] [Real]Absence check using state equation in 37369 ms returned sat
[2022-05-15 22:22:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:22:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:23:19] [INFO ] [Nat]Absence check using state equation in 29458 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4797 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4797/4797 places, 4599/4599 transitions.
Applied a total of 0 rules in 1000 ms. Remains 4797 /4797 variables (removed 0) and now considering 4599/4599 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4797/4797 places, 4599/4599 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4797/4797 places, 4599/4599 transitions.
Applied a total of 0 rules in 972 ms. Remains 4797 /4797 variables (removed 0) and now considering 4599/4599 (removed 0) transitions.
// Phase 1: matrix 4599 rows 4797 cols
[2022-05-15 22:23:21] [INFO ] Invariants computation overflowed in 83 ms
[2022-05-15 22:23:51] [INFO ] Performed 1286/4797 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:24:22] [INFO ] Performed 2459/4797 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:24:52] [INFO ] Performed 3920/4797 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:25:06] [INFO ] Implicit Places using invariants in 105254 ms returned []
// Phase 1: matrix 4599 rows 4797 cols
[2022-05-15 22:25:06] [INFO ] Invariants computation overflowed in 82 ms
[2022-05-15 22:25:07] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 106197 ms to find 0 implicit places.
[2022-05-15 22:25:07] [INFO ] Redundant transitions in 540 ms returned []
// Phase 1: matrix 4599 rows 4797 cols
[2022-05-15 22:25:07] [INFO ] Invariants computation overflowed in 82 ms
[2022-05-15 22:25:12] [INFO ] Dead Transitions using invariants and state equation in 4427 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4797/4797 places, 4599/4599 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-01 in 195139 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-02
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:25:12] [INFO ] Invariants computation overflowed in 95 ms
Incomplete random walk after 10000 steps, including 1286 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:25:13] [INFO ] Invariants computation overflowed in 93 ms
[2022-05-15 22:25:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:25:18] [INFO ] [Real]Absence check using state equation in 4615 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4815 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4815/4815 places, 4610/4610 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4815 transition count 4607
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4812 transition count 4607
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 4812 transition count 4605
Deduced a syphon composed of 2 places in 255 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 4810 transition count 4605
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 264 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 4808 transition count 4603
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 253 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 4803 transition count 4604
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 32 place count 4803 transition count 4596
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 40 place count 4795 transition count 4596
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 4795 transition count 4596
Applied a total of 43 rules in 3956 ms. Remains 4795 /4815 variables (removed 20) and now considering 4596/4610 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4815 places, 4596/4610 transitions.
// Phase 1: matrix 4596 rows 4795 cols
[2022-05-15 22:25:22] [INFO ] Invariants computation overflowed in 80 ms
Incomplete random walk after 1000000 steps, including 128226 resets, run finished after 2453 ms. (steps per millisecond=407 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84848 resets, run finished after 1657 ms. (steps per millisecond=603 ) properties (out of 1) seen :0
// Phase 1: matrix 4596 rows 4795 cols
[2022-05-15 22:25:26] [INFO ] Invariants computation overflowed in 84 ms
[2022-05-15 22:25:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:25:37] [INFO ] [Real]Absence check using state equation in 9703 ms returned sat
[2022-05-15 22:25:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:25:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:25:47] [INFO ] [Nat]Absence check using state equation in 9488 ms returned sat
[2022-05-15 22:25:47] [INFO ] State equation strengthened by 809 read => feed constraints.
[2022-05-15 22:25:51] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 22:25:54] [INFO ] [Nat]Added 809 Read/Feed constraints in 6788 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4795 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4795/4795 places, 4596/4596 transitions.
Applied a total of 0 rules in 1051 ms. Remains 4795 /4795 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4795 places, 4596/4596 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4795/4795 places, 4596/4596 transitions.
Applied a total of 0 rules in 1028 ms. Remains 4795 /4795 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4795 cols
[2022-05-15 22:25:56] [INFO ] Invariants computation overflowed in 83 ms
[2022-05-15 22:26:27] [INFO ] Performed 1098/4795 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:26:57] [INFO ] Performed 2031/4795 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:27:27] [INFO ] Performed 3046/4795 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:27:57] [INFO ] Performed 4354/4795 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:27:57] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:27:57] [INFO ] Implicit Places using invariants in 121172 ms returned []
// Phase 1: matrix 4596 rows 4795 cols
[2022-05-15 22:27:57] [INFO ] Invariants computation overflowed in 82 ms
[2022-05-15 22:27:58] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 122160 ms to find 0 implicit places.
[2022-05-15 22:27:58] [INFO ] Redundant transitions in 603 ms returned []
// Phase 1: matrix 4596 rows 4795 cols
[2022-05-15 22:27:59] [INFO ] Invariants computation overflowed in 84 ms
[2022-05-15 22:28:03] [INFO ] Dead Transitions using invariants and state equation in 4769 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4795 places, 4596/4596 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-02 in 171654 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-03
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:28:04] [INFO ] Invariants computation overflowed in 95 ms
Incomplete random walk after 10000 steps, including 1279 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:28:04] [INFO ] Invariants computation overflowed in 94 ms
[2022-05-15 22:28:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:28:09] [INFO ] [Real]Absence check using state equation in 4573 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4815 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4815/4815 places, 4610/4610 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4815 transition count 4607
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4812 transition count 4607
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 4812 transition count 4606
Deduced a syphon composed of 1 places in 289 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 4811 transition count 4606
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 292 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 4809 transition count 4604
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 288 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 4804 transition count 4604
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 4804 transition count 4596
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 38 place count 4796 transition count 4596
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 4796 transition count 4596
Applied a total of 41 rules in 4432 ms. Remains 4796 /4815 variables (removed 19) and now considering 4596/4610 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4815 places, 4596/4610 transitions.
// Phase 1: matrix 4596 rows 4796 cols
[2022-05-15 22:28:14] [INFO ] Invariants computation overflowed in 83 ms
Incomplete random walk after 1000000 steps, including 128480 resets, run finished after 3476 ms. (steps per millisecond=287 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84648 resets, run finished after 2324 ms. (steps per millisecond=430 ) properties (out of 1) seen :0
// Phase 1: matrix 4596 rows 4796 cols
[2022-05-15 22:28:20] [INFO ] Invariants computation overflowed in 88 ms
[2022-05-15 22:28:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:29:05] [INFO ] [Real]Absence check using state equation in 44588 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4796 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4596/4596 transitions.
Applied a total of 0 rules in 1073 ms. Remains 4796 /4796 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4596/4596 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4596/4596 transitions.
Applied a total of 0 rules in 1056 ms. Remains 4796 /4796 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4796 cols
[2022-05-15 22:29:08] [INFO ] Invariants computation overflowed in 87 ms
[2022-05-15 22:29:38] [INFO ] Performed 1098/4796 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:30:08] [INFO ] Performed 2046/4796 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:30:39] [INFO ] Performed 3046/4796 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:31:09] [INFO ] Performed 4372/4796 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:31:09] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:31:09] [INFO ] Implicit Places using invariants in 121152 ms returned []
// Phase 1: matrix 4596 rows 4796 cols
[2022-05-15 22:31:09] [INFO ] Invariants computation overflowed in 91 ms
[2022-05-15 22:31:10] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 122090 ms to find 0 implicit places.
[2022-05-15 22:31:10] [INFO ] Redundant transitions in 599 ms returned []
// Phase 1: matrix 4596 rows 4796 cols
[2022-05-15 22:31:10] [INFO ] Invariants computation overflowed in 81 ms
[2022-05-15 22:31:15] [INFO ] Dead Transitions using invariants and state equation in 5013 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4596/4596 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-03 in 191932 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-04
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:31:16] [INFO ] Invariants computation overflowed in 94 ms
Incomplete random walk after 10000 steps, including 1307 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:31:16] [INFO ] Invariants computation overflowed in 96 ms
[2022-05-15 22:31:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:31:20] [INFO ] [Real]Absence check using state equation in 3540 ms returned sat
[2022-05-15 22:31:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:31:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:31:25] [INFO ] [Nat]Absence check using state equation in 4628 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4815 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4815/4815 places, 4610/4610 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4815 transition count 4607
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4812 transition count 4607
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 4812 transition count 4605
Deduced a syphon composed of 2 places in 255 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 4810 transition count 4605
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 256 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 4808 transition count 4603
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 255 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 4803 transition count 4604
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 32 place count 4803 transition count 4596
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 40 place count 4795 transition count 4596
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 4795 transition count 4596
Applied a total of 43 rules in 4075 ms. Remains 4795 /4815 variables (removed 20) and now considering 4596/4610 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4815 places, 4596/4610 transitions.
// Phase 1: matrix 4596 rows 4795 cols
[2022-05-15 22:31:30] [INFO ] Invariants computation overflowed in 76 ms
Incomplete random walk after 1000000 steps, including 127911 resets, run finished after 2509 ms. (steps per millisecond=398 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84361 resets, run finished after 1686 ms. (steps per millisecond=593 ) properties (out of 1) seen :0
// Phase 1: matrix 4596 rows 4795 cols
[2022-05-15 22:31:34] [INFO ] Invariants computation overflowed in 104 ms
[2022-05-15 22:31:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:32:13] [INFO ] [Real]Absence check using state equation in 38650 ms returned sat
[2022-05-15 22:32:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:32:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:32:44] [INFO ] [Nat]Absence check using state equation in 29685 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4795 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4795/4795 places, 4596/4596 transitions.
Applied a total of 0 rules in 1048 ms. Remains 4795 /4795 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4795 places, 4596/4596 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4795/4795 places, 4596/4596 transitions.
Applied a total of 0 rules in 1038 ms. Remains 4795 /4795 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4795 cols
[2022-05-15 22:32:46] [INFO ] Invariants computation overflowed in 75 ms
[2022-05-15 22:33:16] [INFO ] Performed 1094/4795 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:33:47] [INFO ] Performed 2027/4795 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:34:17] [INFO ] Performed 3042/4795 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:34:47] [INFO ] Performed 4343/4795 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:34:47] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:34:47] [INFO ] Implicit Places using invariants in 120896 ms returned []
// Phase 1: matrix 4596 rows 4795 cols
[2022-05-15 22:34:47] [INFO ] Invariants computation overflowed in 83 ms
[2022-05-15 22:34:48] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 121978 ms to find 0 implicit places.
[2022-05-15 22:34:49] [INFO ] Redundant transitions in 594 ms returned []
// Phase 1: matrix 4596 rows 4795 cols
[2022-05-15 22:34:49] [INFO ] Invariants computation overflowed in 71 ms
[2022-05-15 22:34:53] [INFO ] Dead Transitions using invariants and state equation in 4792 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4795 places, 4596/4596 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-04 in 218020 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-05
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:34:54] [INFO ] Invariants computation overflowed in 94 ms
Incomplete random walk after 10000 steps, including 1307 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 883 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:34:54] [INFO ] Invariants computation overflowed in 99 ms
[2022-05-15 22:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:34:59] [INFO ] [Real]Absence check using state equation in 4598 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4815 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4815/4815 places, 4610/4610 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 4815 transition count 4608
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4813 transition count 4608
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 4813 transition count 4606
Deduced a syphon composed of 2 places in 252 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 4811 transition count 4606
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 256 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 4809 transition count 4604
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 254 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 4803 transition count 4605
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 31 place count 4803 transition count 4598
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 38 place count 4796 transition count 4598
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 4796 transition count 4598
Applied a total of 41 rules in 3993 ms. Remains 4796 /4815 variables (removed 19) and now considering 4598/4610 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4815 places, 4598/4610 transitions.
// Phase 1: matrix 4598 rows 4796 cols
[2022-05-15 22:35:04] [INFO ] Invariants computation overflowed in 81 ms
Incomplete random walk after 1000000 steps, including 128221 resets, run finished after 2441 ms. (steps per millisecond=409 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84711 resets, run finished after 1681 ms. (steps per millisecond=594 ) properties (out of 1) seen :0
// Phase 1: matrix 4598 rows 4796 cols
[2022-05-15 22:35:08] [INFO ] Invariants computation overflowed in 83 ms
[2022-05-15 22:35:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:35:16] [INFO ] [Real]Absence check using state equation in 7350 ms returned sat
[2022-05-15 22:35:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:35:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:35:24] [INFO ] [Nat]Absence check using state equation in 7603 ms returned sat
[2022-05-15 22:35:24] [INFO ] State equation strengthened by 811 read => feed constraints.
[2022-05-15 22:35:27] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 22:35:33] [INFO ] [Nat]Added 811 Read/Feed constraints in 8475 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4796 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4598/4598 transitions.
Applied a total of 0 rules in 1043 ms. Remains 4796 /4796 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4598/4598 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4598/4598 transitions.
Applied a total of 0 rules in 1028 ms. Remains 4796 /4796 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
// Phase 1: matrix 4598 rows 4796 cols
[2022-05-15 22:35:35] [INFO ] Invariants computation overflowed in 93 ms
[2022-05-15 22:36:06] [INFO ] Performed 1093/4796 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:36:36] [INFO ] Performed 2026/4796 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:37:06] [INFO ] Performed 3041/4796 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:37:36] [INFO ] Performed 4374/4796 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:37:36] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:37:36] [INFO ] Implicit Places using invariants in 121331 ms returned []
// Phase 1: matrix 4598 rows 4796 cols
[2022-05-15 22:37:36] [INFO ] Invariants computation overflowed in 76 ms
[2022-05-15 22:37:37] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 122284 ms to find 0 implicit places.
[2022-05-15 22:37:38] [INFO ] Redundant transitions in 600 ms returned []
// Phase 1: matrix 4598 rows 4796 cols
[2022-05-15 22:37:38] [INFO ] Invariants computation overflowed in 77 ms
[2022-05-15 22:37:43] [INFO ] Dead Transitions using invariants and state equation in 4883 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4598/4598 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-05 in 169275 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-06
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:37:43] [INFO ] Invariants computation overflowed in 92 ms
Incomplete random walk after 10000 steps, including 1305 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:37:43] [INFO ] Invariants computation overflowed in 96 ms
[2022-05-15 22:37:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:37:48] [INFO ] [Real]Absence check using state equation in 4622 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4815 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4815/4815 places, 4610/4610 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4815 transition count 4607
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4812 transition count 4607
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 4812 transition count 4605
Deduced a syphon composed of 2 places in 252 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 4810 transition count 4605
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 252 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 4808 transition count 4603
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 253 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 4802 transition count 4604
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 4802 transition count 4597
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 40 place count 4795 transition count 4597
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 4795 transition count 4597
Applied a total of 43 rules in 4001 ms. Remains 4795 /4815 variables (removed 20) and now considering 4597/4610 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4815 places, 4597/4610 transitions.
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 22:37:53] [INFO ] Invariants computation overflowed in 84 ms
Incomplete random walk after 1000000 steps, including 128058 resets, run finished after 2461 ms. (steps per millisecond=406 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84749 resets, run finished after 1654 ms. (steps per millisecond=604 ) properties (out of 1) seen :0
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 22:37:57] [INFO ] Invariants computation overflowed in 81 ms
[2022-05-15 22:37:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:38:42] [INFO ] [Real]Absence check using state equation in 44637 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4795 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4795/4795 places, 4597/4597 transitions.
Applied a total of 0 rules in 1034 ms. Remains 4795 /4795 variables (removed 0) and now considering 4597/4597 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4795 places, 4597/4597 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4795/4795 places, 4597/4597 transitions.
Applied a total of 0 rules in 1030 ms. Remains 4795 /4795 variables (removed 0) and now considering 4597/4597 (removed 0) transitions.
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 22:38:45] [INFO ] Invariants computation overflowed in 83 ms
[2022-05-15 22:39:15] [INFO ] Performed 1093/4795 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:39:46] [INFO ] Performed 2026/4795 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:40:16] [INFO ] Performed 3016/4795 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:40:46] [INFO ] Performed 4298/4795 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2022-05-15 22:40:46] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2022-05-15 22:40:46] [INFO ] Implicit Places using invariants in 121599 ms returned []
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 22:40:46] [INFO ] Invariants computation overflowed in 78 ms
[2022-05-15 22:40:47] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 122559 ms to find 0 implicit places.
[2022-05-15 22:40:48] [INFO ] Redundant transitions in 589 ms returned []
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 22:40:48] [INFO ] Invariants computation overflowed in 82 ms
[2022-05-15 22:40:52] [INFO ] Dead Transitions using invariants and state equation in 4865 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4795 places, 4597/4597 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-06 in 189917 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-07
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:40:53] [INFO ] Invariants computation overflowed in 95 ms
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:40:53] [INFO ] Invariants computation overflowed in 91 ms
[2022-05-15 22:40:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:40:57] [INFO ] [Real]Absence check using state equation in 3054 ms returned sat
[2022-05-15 22:40:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:40:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:41:00] [INFO ] [Nat]Absence check using state equation in 2752 ms returned sat
[2022-05-15 22:41:00] [INFO ] State equation strengthened by 797 read => feed constraints.
[2022-05-15 22:41:01] [INFO ] [Nat]Added 797 Read/Feed constraints in 404 ms returned sat
[2022-05-15 22:41:12] [INFO ] Deduced a trap composed of 4 places in 11067 ms of which 5 ms to minimize.
[2022-05-15 22:41:12] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4815 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4815/4815 places, 4610/4610 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 4815 transition count 4608
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4813 transition count 4608
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 4813 transition count 4606
Deduced a syphon composed of 2 places in 255 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 4811 transition count 4606
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 255 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 4809 transition count 4604
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 266 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 4804 transition count 4605
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 4804 transition count 4597
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 38 place count 4796 transition count 4597
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 4796 transition count 4597
Applied a total of 41 rules in 3994 ms. Remains 4796 /4815 variables (removed 19) and now considering 4597/4610 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4815 places, 4597/4610 transitions.
// Phase 1: matrix 4597 rows 4796 cols
[2022-05-15 22:41:16] [INFO ] Invariants computation overflowed in 73 ms
Incomplete random walk after 1000000 steps, including 128404 resets, run finished after 2459 ms. (steps per millisecond=406 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84592 resets, run finished after 1677 ms. (steps per millisecond=596 ) properties (out of 1) seen :0
// Phase 1: matrix 4597 rows 4796 cols
[2022-05-15 22:41:21] [INFO ] Invariants computation overflowed in 78 ms
[2022-05-15 22:41:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:41:25] [INFO ] [Real]Absence check using state equation in 3656 ms returned sat
[2022-05-15 22:41:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:41:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:41:29] [INFO ] [Nat]Absence check using state equation in 3649 ms returned sat
[2022-05-15 22:41:29] [INFO ] State equation strengthened by 808 read => feed constraints.
[2022-05-15 22:41:30] [INFO ] [Nat]Added 808 Read/Feed constraints in 880 ms returned sat
[2022-05-15 22:41:50] [INFO ] Deduced a trap composed of 4 places in 19554 ms of which 7 ms to minimize.
[2022-05-15 22:41:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19907 ms
[2022-05-15 22:41:51] [INFO ] Computed and/alt/rep : 3592/22778/3592 causal constraints (skipped 1004 transitions) in 1610 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4796 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4597/4597 transitions.
Applied a total of 0 rules in 1045 ms. Remains 4796 /4796 variables (removed 0) and now considering 4597/4597 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4597/4597 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4597/4597 transitions.
Applied a total of 0 rules in 1035 ms. Remains 4796 /4796 variables (removed 0) and now considering 4597/4597 (removed 0) transitions.
// Phase 1: matrix 4597 rows 4796 cols
[2022-05-15 22:41:54] [INFO ] Invariants computation overflowed in 76 ms
[2022-05-15 22:42:24] [INFO ] Performed 1093/4796 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:42:55] [INFO ] Performed 2004/4796 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:43:25] [INFO ] Performed 2991/4796 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:43:55] [INFO ] Performed 4246/4796 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:43:55] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:43:55] [INFO ] Implicit Places using invariants in 121142 ms returned []
// Phase 1: matrix 4597 rows 4796 cols
[2022-05-15 22:43:55] [INFO ] Invariants computation overflowed in 74 ms
[2022-05-15 22:43:56] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 122161 ms to find 0 implicit places.
[2022-05-15 22:43:56] [INFO ] Redundant transitions in 610 ms returned []
// Phase 1: matrix 4597 rows 4796 cols
[2022-05-15 22:43:56] [INFO ] Invariants computation overflowed in 80 ms
[2022-05-15 22:44:01] [INFO ] Dead Transitions using invariants and state equation in 4702 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4597/4597 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-07 in 188553 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-08
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:44:02] [INFO ] Invariants computation overflowed in 99 ms
Incomplete random walk after 10000 steps, including 1284 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 817 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:44:02] [INFO ] Invariants computation overflowed in 96 ms
[2022-05-15 22:44:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:44:07] [INFO ] [Real]Absence check using state equation in 4616 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4815 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4815/4815 places, 4610/4610 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4815 transition count 4607
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4812 transition count 4607
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 4812 transition count 4605
Deduced a syphon composed of 2 places in 256 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 4810 transition count 4605
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 256 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 4808 transition count 4603
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 258 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 4802 transition count 4604
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 4802 transition count 4596
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 42 place count 4794 transition count 4596
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 4794 transition count 4596
Applied a total of 44 rules in 4082 ms. Remains 4794 /4815 variables (removed 21) and now considering 4596/4610 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 4794/4815 places, 4596/4610 transitions.
// Phase 1: matrix 4596 rows 4794 cols
[2022-05-15 22:44:12] [INFO ] Invariants computation overflowed in 88 ms
Incomplete random walk after 1000000 steps, including 127802 resets, run finished after 2491 ms. (steps per millisecond=401 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84819 resets, run finished after 1687 ms. (steps per millisecond=592 ) properties (out of 1) seen :0
// Phase 1: matrix 4596 rows 4794 cols
[2022-05-15 22:44:16] [INFO ] Invariants computation overflowed in 82 ms
[2022-05-15 22:44:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:45:01] [INFO ] [Real]Absence check using state equation in 44130 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4794 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4794/4794 places, 4596/4596 transitions.
Applied a total of 0 rules in 1055 ms. Remains 4794 /4794 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4794/4794 places, 4596/4596 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4794/4794 places, 4596/4596 transitions.
Applied a total of 0 rules in 1053 ms. Remains 4794 /4794 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4794 cols
[2022-05-15 22:45:03] [INFO ] Invariants computation overflowed in 81 ms
[2022-05-15 22:45:34] [INFO ] Performed 1093/4794 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:46:04] [INFO ] Performed 2026/4794 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:46:34] [INFO ] Performed 3022/4794 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:47:05] [INFO ] Performed 4326/4794 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:47:05] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:47:05] [INFO ] Implicit Places using invariants in 121343 ms returned []
// Phase 1: matrix 4596 rows 4794 cols
[2022-05-15 22:47:05] [INFO ] Invariants computation overflowed in 85 ms
[2022-05-15 22:47:06] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 122386 ms to find 0 implicit places.
[2022-05-15 22:47:06] [INFO ] Redundant transitions in 604 ms returned []
// Phase 1: matrix 4596 rows 4794 cols
[2022-05-15 22:47:06] [INFO ] Invariants computation overflowed in 87 ms
[2022-05-15 22:47:12] [INFO ] Dead Transitions using invariants and state equation in 5402 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4794/4794 places, 4596/4596 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-08 in 190616 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-09
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:47:12] [INFO ] Invariants computation overflowed in 97 ms
Incomplete random walk after 10000 steps, including 1283 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:47:13] [INFO ] Invariants computation overflowed in 97 ms
[2022-05-15 22:47:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:47:18] [INFO ] [Real]Absence check using state equation in 4561 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4815 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4815/4815 places, 4610/4610 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 4815 transition count 4608
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4813 transition count 4608
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 4813 transition count 4606
Deduced a syphon composed of 2 places in 255 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 4811 transition count 4606
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 255 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 4809 transition count 4604
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 253 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 4804 transition count 4605
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 4804 transition count 4597
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 38 place count 4796 transition count 4597
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 4796 transition count 4597
Applied a total of 41 rules in 4019 ms. Remains 4796 /4815 variables (removed 19) and now considering 4597/4610 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4815 places, 4597/4610 transitions.
// Phase 1: matrix 4597 rows 4796 cols
[2022-05-15 22:47:22] [INFO ] Invariants computation overflowed in 91 ms
Incomplete random walk after 1000000 steps, including 128358 resets, run finished after 2496 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84709 resets, run finished after 1690 ms. (steps per millisecond=591 ) properties (out of 1) seen :0
// Phase 1: matrix 4597 rows 4796 cols
[2022-05-15 22:47:27] [INFO ] Invariants computation overflowed in 88 ms
[2022-05-15 22:47:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:47:55] [INFO ] [Real]Absence check using state equation in 27905 ms returned sat
[2022-05-15 22:47:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:47:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:48:25] [INFO ] [Nat]Absence check using state equation in 28996 ms returned sat
[2022-05-15 22:48:25] [INFO ] State equation strengthened by 808 read => feed constraints.
[2022-05-15 22:48:28] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 22:48:31] [INFO ] [Nat]Added 808 Read/Feed constraints in 6080 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4796 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4597/4597 transitions.
Applied a total of 0 rules in 1078 ms. Remains 4796 /4796 variables (removed 0) and now considering 4597/4597 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4597/4597 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4597/4597 transitions.
Applied a total of 0 rules in 1072 ms. Remains 4796 /4796 variables (removed 0) and now considering 4597/4597 (removed 0) transitions.
// Phase 1: matrix 4597 rows 4796 cols
[2022-05-15 22:48:33] [INFO ] Invariants computation overflowed in 90 ms
[2022-05-15 22:49:04] [INFO ] Performed 1067/4796 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:49:34] [INFO ] Performed 1975/4796 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:50:04] [INFO ] Performed 2968/4796 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:50:34] [INFO ] Performed 4243/4796 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:50:34] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:50:34] [INFO ] Implicit Places using invariants in 121401 ms returned []
// Phase 1: matrix 4597 rows 4796 cols
[2022-05-15 22:50:34] [INFO ] Invariants computation overflowed in 85 ms
[2022-05-15 22:50:35] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 122371 ms to find 0 implicit places.
[2022-05-15 22:50:36] [INFO ] Redundant transitions in 609 ms returned []
// Phase 1: matrix 4597 rows 4796 cols
[2022-05-15 22:50:36] [INFO ] Invariants computation overflowed in 87 ms
[2022-05-15 22:50:41] [INFO ] Dead Transitions using invariants and state equation in 5014 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4597/4597 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-09 in 209142 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-10
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:50:42] [INFO ] Invariants computation overflowed in 98 ms
Incomplete random walk after 10000 steps, including 1309 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:50:42] [INFO ] Invariants computation overflowed in 96 ms
[2022-05-15 22:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:50:47] [INFO ] [Real]Absence check using state equation in 4597 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4815 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4815/4815 places, 4610/4610 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4815 transition count 4607
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4812 transition count 4607
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 4812 transition count 4606
Deduced a syphon composed of 1 places in 252 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 4811 transition count 4606
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 260 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 4809 transition count 4604
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 272 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 4803 transition count 4605
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 32 place count 4803 transition count 4597
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 40 place count 4795 transition count 4597
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 4795 transition count 4597
Applied a total of 43 rules in 4065 ms. Remains 4795 /4815 variables (removed 20) and now considering 4597/4610 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4815 places, 4597/4610 transitions.
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 22:50:51] [INFO ] Invariants computation overflowed in 83 ms
Incomplete random walk after 1000000 steps, including 128007 resets, run finished after 2616 ms. (steps per millisecond=382 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84495 resets, run finished after 1780 ms. (steps per millisecond=561 ) properties (out of 1) seen :0
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 22:50:56] [INFO ] Invariants computation overflowed in 81 ms
[2022-05-15 22:50:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:51:41] [INFO ] [Real]Absence check using state equation in 44612 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4795 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4795/4795 places, 4597/4597 transitions.
Applied a total of 0 rules in 1066 ms. Remains 4795 /4795 variables (removed 0) and now considering 4597/4597 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4795 places, 4597/4597 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4795/4795 places, 4597/4597 transitions.
Applied a total of 0 rules in 1055 ms. Remains 4795 /4795 variables (removed 0) and now considering 4597/4597 (removed 0) transitions.
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 22:51:43] [INFO ] Invariants computation overflowed in 81 ms
[2022-05-15 22:52:14] [INFO ] Performed 1093/4795 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:52:44] [INFO ] Performed 2026/4795 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:53:14] [INFO ] Performed 3016/4795 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:53:44] [INFO ] Performed 4314/4795 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:53:44] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:53:44] [INFO ] Implicit Places using invariants in 121334 ms returned []
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 22:53:45] [INFO ] Invariants computation overflowed in 81 ms
[2022-05-15 22:53:45] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 122308 ms to find 0 implicit places.
[2022-05-15 22:53:46] [INFO ] Redundant transitions in 602 ms returned []
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 22:53:46] [INFO ] Invariants computation overflowed in 80 ms
[2022-05-15 22:53:51] [INFO ] Dead Transitions using invariants and state equation in 4978 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4795 places, 4597/4597 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-10 in 190241 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-11
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:53:52] [INFO ] Invariants computation overflowed in 97 ms
Incomplete random walk after 10000 steps, including 1298 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:53:52] [INFO ] Invariants computation overflowed in 92 ms
[2022-05-15 22:53:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:53:57] [INFO ] [Real]Absence check using state equation in 4584 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4815 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4815/4815 places, 4610/4610 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4815 transition count 4607
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4812 transition count 4607
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 4812 transition count 4605
Deduced a syphon composed of 2 places in 273 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 4810 transition count 4605
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 255 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 4808 transition count 4603
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 269 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 4803 transition count 4604
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 32 place count 4803 transition count 4596
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 40 place count 4795 transition count 4596
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 4795 transition count 4596
Applied a total of 43 rules in 4036 ms. Remains 4795 /4815 variables (removed 20) and now considering 4596/4610 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4815 places, 4596/4610 transitions.
// Phase 1: matrix 4596 rows 4795 cols
[2022-05-15 22:54:02] [INFO ] Invariants computation overflowed in 82 ms
Incomplete random walk after 1000000 steps, including 128242 resets, run finished after 2474 ms. (steps per millisecond=404 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84629 resets, run finished after 1677 ms. (steps per millisecond=596 ) properties (out of 1) seen :0
// Phase 1: matrix 4596 rows 4795 cols
[2022-05-15 22:54:06] [INFO ] Invariants computation overflowed in 81 ms
[2022-05-15 22:54:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:54:13] [INFO ] [Real]Absence check using state equation in 6807 ms returned sat
[2022-05-15 22:54:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:54:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:54:20] [INFO ] [Nat]Absence check using state equation in 6685 ms returned sat
[2022-05-15 22:54:20] [INFO ] State equation strengthened by 809 read => feed constraints.
[2022-05-15 22:54:24] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 22:54:27] [INFO ] [Nat]Added 809 Read/Feed constraints in 6047 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4795 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4795/4795 places, 4596/4596 transitions.
Applied a total of 0 rules in 1050 ms. Remains 4795 /4795 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4795 places, 4596/4596 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4795/4795 places, 4596/4596 transitions.
Applied a total of 0 rules in 1052 ms. Remains 4795 /4795 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4795 cols
[2022-05-15 22:54:29] [INFO ] Invariants computation overflowed in 82 ms
[2022-05-15 22:54:59] [INFO ] Performed 1072/4795 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:55:30] [INFO ] Performed 1999/4795 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:56:00] [INFO ] Performed 2995/4795 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:56:30] [INFO ] Performed 4298/4795 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2022-05-15 22:56:30] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2022-05-15 22:56:30] [INFO ] Implicit Places using invariants in 121509 ms returned []
// Phase 1: matrix 4596 rows 4795 cols
[2022-05-15 22:56:30] [INFO ] Invariants computation overflowed in 79 ms
[2022-05-15 22:56:31] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 122488 ms to find 0 implicit places.
[2022-05-15 22:56:32] [INFO ] Redundant transitions in 614 ms returned []
// Phase 1: matrix 4596 rows 4795 cols
[2022-05-15 22:56:32] [INFO ] Invariants computation overflowed in 82 ms
[2022-05-15 22:56:37] [INFO ] Dead Transitions using invariants and state equation in 4823 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4795 places, 4596/4596 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-11 in 165574 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-12
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:56:37] [INFO ] Invariants computation overflowed in 98 ms
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:56:37] [INFO ] Invariants computation overflowed in 100 ms
[2022-05-15 22:56:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:56:43] [INFO ] [Real]Absence check using state equation in 4597 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4815 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4815/4815 places, 4610/4610 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4815 transition count 4607
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4812 transition count 4607
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 4812 transition count 4605
Deduced a syphon composed of 2 places in 258 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 4810 transition count 4605
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 260 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 4809 transition count 4604
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 259 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 4803 transition count 4605
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 32 place count 4803 transition count 4597
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 40 place count 4795 transition count 4597
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 4795 transition count 4597
Applied a total of 43 rules in 4048 ms. Remains 4795 /4815 variables (removed 20) and now considering 4597/4610 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4815 places, 4597/4610 transitions.
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 22:56:47] [INFO ] Invariants computation overflowed in 86 ms
Incomplete random walk after 1000000 steps, including 128129 resets, run finished after 2480 ms. (steps per millisecond=403 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84923 resets, run finished after 1702 ms. (steps per millisecond=587 ) properties (out of 1) seen :0
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 22:56:52] [INFO ] Invariants computation overflowed in 79 ms
[2022-05-15 22:56:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:57:37] [INFO ] [Real]Absence check using state equation in 44592 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4795 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4795/4795 places, 4597/4597 transitions.
Applied a total of 0 rules in 1048 ms. Remains 4795 /4795 variables (removed 0) and now considering 4597/4597 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4795 places, 4597/4597 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4795/4795 places, 4597/4597 transitions.
Applied a total of 0 rules in 1042 ms. Remains 4795 /4795 variables (removed 0) and now considering 4597/4597 (removed 0) transitions.
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 22:57:39] [INFO ] Invariants computation overflowed in 83 ms
[2022-05-15 22:58:09] [INFO ] Performed 1093/4795 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:58:39] [INFO ] Performed 2004/4795 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:59:09] [INFO ] Performed 3005/4795 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:59:39] [INFO ] Performed 4298/4795 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:59:39] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:59:39] [INFO ] Implicit Places using invariants in 120684 ms returned []
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 22:59:39] [INFO ] Invariants computation overflowed in 78 ms
[2022-05-15 22:59:40] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 121601 ms to find 0 implicit places.
[2022-05-15 22:59:41] [INFO ] Redundant transitions in 593 ms returned []
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 22:59:41] [INFO ] Invariants computation overflowed in 79 ms
[2022-05-15 22:59:46] [INFO ] Dead Transitions using invariants and state equation in 4848 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4795 places, 4597/4597 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-12 in 189072 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-13
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:59:46] [INFO ] Invariants computation overflowed in 95 ms
Incomplete random walk after 10000 steps, including 1285 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 868 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 22:59:47] [INFO ] Invariants computation overflowed in 90 ms
[2022-05-15 22:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:59:52] [INFO ] [Real]Absence check using state equation in 4629 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4815 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4815/4815 places, 4610/4610 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4815 transition count 4607
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4812 transition count 4607
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 4812 transition count 4605
Deduced a syphon composed of 2 places in 253 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 4810 transition count 4605
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 262 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 4808 transition count 4603
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 253 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 4802 transition count 4604
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 4802 transition count 4597
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 40 place count 4795 transition count 4597
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 4795 transition count 4597
Applied a total of 42 rules in 3032 ms. Remains 4795 /4815 variables (removed 20) and now considering 4597/4610 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4815 places, 4597/4610 transitions.
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 22:59:55] [INFO ] Invariants computation overflowed in 74 ms
Incomplete random walk after 1000000 steps, including 128228 resets, run finished after 2301 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84911 resets, run finished after 1562 ms. (steps per millisecond=640 ) properties (out of 1) seen :0
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 22:59:59] [INFO ] Invariants computation overflowed in 71 ms
[2022-05-15 22:59:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:00:44] [INFO ] [Real]Absence check using state equation in 44604 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4795 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4795/4795 places, 4597/4597 transitions.
Applied a total of 0 rules in 574 ms. Remains 4795 /4795 variables (removed 0) and now considering 4597/4597 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4795 places, 4597/4597 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4795/4795 places, 4597/4597 transitions.
Applied a total of 0 rules in 558 ms. Remains 4795 /4795 variables (removed 0) and now considering 4597/4597 (removed 0) transitions.
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 23:00:45] [INFO ] Invariants computation overflowed in 73 ms
[2022-05-15 23:01:16] [INFO ] Performed 3073/4795 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 23:01:34] [INFO ] Implicit Places using invariants in 49108 ms returned []
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 23:01:34] [INFO ] Invariants computation overflowed in 68 ms
[2022-05-15 23:01:35] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 50026 ms to find 0 implicit places.
[2022-05-15 23:01:35] [INFO ] Redundant transitions in 363 ms returned []
// Phase 1: matrix 4597 rows 4795 cols
[2022-05-15 23:01:36] [INFO ] Invariants computation overflowed in 70 ms
[2022-05-15 23:01:39] [INFO ] Dead Transitions using invariants and state equation in 3770 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4795 places, 4597/4597 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-13 in 113188 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-14
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 23:01:40] [INFO ] Invariants computation overflowed in 92 ms
Incomplete random walk after 10000 steps, including 1258 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 853 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
// Phase 1: matrix 4610 rows 4815 cols
[2022-05-15 23:01:40] [INFO ] Invariants computation overflowed in 95 ms
[2022-05-15 23:01:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:01:45] [INFO ] [Real]Absence check using state equation in 4628 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4815 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4815/4815 places, 4610/4610 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4815 transition count 4607
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4812 transition count 4607
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 4812 transition count 4605
Deduced a syphon composed of 2 places in 252 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 4810 transition count 4605
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 262 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 4808 transition count 4603
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 252 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 4802 transition count 4604
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 4802 transition count 4598
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 38 place count 4796 transition count 4598
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 4796 transition count 4598
Applied a total of 41 rules in 3932 ms. Remains 4796 /4815 variables (removed 19) and now considering 4598/4610 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4815 places, 4598/4610 transitions.
// Phase 1: matrix 4598 rows 4796 cols
[2022-05-15 23:01:49] [INFO ] Invariants computation overflowed in 81 ms
Incomplete random walk after 1000000 steps, including 128195 resets, run finished after 2436 ms. (steps per millisecond=410 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84603 resets, run finished after 1654 ms. (steps per millisecond=604 ) properties (out of 1) seen :0
// Phase 1: matrix 4598 rows 4796 cols
[2022-05-15 23:01:54] [INFO ] Invariants computation overflowed in 78 ms
[2022-05-15 23:01:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:01:59] [INFO ] [Real]Absence check using state equation in 5380 ms returned sat
[2022-05-15 23:02:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:02:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:02:05] [INFO ] [Nat]Absence check using state equation in 5394 ms returned sat
[2022-05-15 23:02:05] [INFO ] State equation strengthened by 811 read => feed constraints.
[2022-05-15 23:02:08] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 23:02:12] [INFO ] [Nat]Added 811 Read/Feed constraints in 6365 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4796 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4598/4598 transitions.
Applied a total of 0 rules in 1036 ms. Remains 4796 /4796 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4598/4598 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4598/4598 transitions.
Applied a total of 0 rules in 1035 ms. Remains 4796 /4796 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
// Phase 1: matrix 4598 rows 4796 cols
[2022-05-15 23:02:14] [INFO ] Invariants computation overflowed in 81 ms
[2022-05-15 23:02:45] [INFO ] Performed 1098/4796 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 23:03:15] [INFO ] Performed 2052/4796 implicitness test of which 0 returned IMPLICIT in 60 seconds.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-200, 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 r078-tall-165260110000221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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