MCC'2025- Execution of r254-tall-174931339900435

About the Execution of ITS-Tools for MedleyB-PT-B02

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
0.000	1206130.00	0.00	0.00	FTFFFFTFFTFFFFFF	normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 7.9K Jun 6 09:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 6 09:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 6 09:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 6 09:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 09:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Jun 6 09:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 6 09:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 6 09:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 253K Jun 5 20:08 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749386639754

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-08 12:44:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 12:44:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 12:44:01] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2025-06-08 12:44:01] [INFO ] Transformed 1227 places.
[2025-06-08 12:44:01] [INFO ] Transformed 1472 transitions.
[2025-06-08 12:44:01] [INFO ] Found NUPN structural information;
[2025-06-08 12:44:01] [INFO ] Parsed PT model containing 1227 places and 1472 transitions and 4160 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MedleyB-PT-B02-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1227/1227 places, 1472/1472 transitions.
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 97 place count 1130 transition count 1375
Iterating global reduction 0 with 97 rules applied. Total rules applied 194 place count 1130 transition count 1375
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 251 place count 1073 transition count 1318
Iterating global reduction 0 with 57 rules applied. Total rules applied 308 place count 1073 transition count 1318
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 340 place count 1041 transition count 1286
Iterating global reduction 0 with 32 rules applied. Total rules applied 372 place count 1041 transition count 1286
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 396 place count 1017 transition count 1262
Iterating global reduction 0 with 24 rules applied. Total rules applied 420 place count 1017 transition count 1262
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 438 place count 999 transition count 1244
Iterating global reduction 0 with 18 rules applied. Total rules applied 456 place count 999 transition count 1244
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 473 place count 982 transition count 1227
Iterating global reduction 0 with 17 rules applied. Total rules applied 490 place count 982 transition count 1227
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 506 place count 966 transition count 1211
Iterating global reduction 0 with 16 rules applied. Total rules applied 522 place count 966 transition count 1211
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 537 place count 951 transition count 1196
Iterating global reduction 0 with 15 rules applied. Total rules applied 552 place count 951 transition count 1196
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 564 place count 939 transition count 1184
Iterating global reduction 0 with 12 rules applied. Total rules applied 576 place count 939 transition count 1184
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 583 place count 932 transition count 1177
Iterating global reduction 0 with 7 rules applied. Total rules applied 590 place count 932 transition count 1177
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 593 place count 929 transition count 1174
Iterating global reduction 0 with 3 rules applied. Total rules applied 596 place count 929 transition count 1174
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 599 place count 926 transition count 1171
Iterating global reduction 0 with 3 rules applied. Total rules applied 602 place count 926 transition count 1171
Applied a total of 602 rules in 875 ms. Remains 926 /1227 variables (removed 301) and now considering 1171/1472 (removed 301) transitions.
// Phase 1: matrix 1171 rows 926 cols
[2025-06-08 12:44:02] [INFO ] Computed 5 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:44:03] [INFO ] Implicit Places using invariants in 786 ms returned []
[2025-06-08 12:44:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:44:04] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
Running 1170 sub problems to find dead transitions.
[2025-06-08 12:44:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/925 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
SMT process timed out in 30466ms, After SMT, problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 30481ms
Starting structural reductions in LTL mode, iteration 1 : 926/1227 places, 1171/1472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33222 ms. Remains : 926/1227 places, 1171/1472 transitions.
Support contains 37 out of 926 places after structural reductions.
[2025-06-08 12:44:34] [INFO ] Flatten gal took : 99 ms
[2025-06-08 12:44:34] [INFO ] Flatten gal took : 58 ms
[2025-06-08 12:44:35] [INFO ] Input system was already deterministic with 1171 transitions.
RANDOM walk for 40000 steps (514 resets) in 1409 ms. (28 steps per ms) remains 15/24 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (10 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (10 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (9 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (10 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
[2025-06-08 12:44:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 891/912 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/912 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 14/926 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/926 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1171/2097 variables, 926/931 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2097 variables, 0/931 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/2097 variables, 0/931 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2097/2097 variables, and 931 constraints, problems are : Problem set: 1 solved, 14 unsolved in 1964 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 926/926 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 892/912 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:38] [INFO ] Deduced a trap composed of 329 places in 511 ms of which 231 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:39] [INFO ] Deduced a trap composed of 327 places in 522 ms of which 242 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:39] [INFO ] Deduced a trap composed of 330 places in 390 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:39] [INFO ] Deduced a trap composed of 328 places in 406 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:40] [INFO ] Deduced a trap composed of 322 places in 485 ms of which 204 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:41] [INFO ] Deduced a trap composed of 322 places in 375 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:41] [INFO ] Deduced a trap composed of 320 places in 403 ms of which 160 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/912 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:41] [INFO ] Deduced a trap composed of 331 places in 213 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/912 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:42] [INFO ] Deduced a trap composed of 322 places in 303 ms of which 102 ms to minimize.
SMT process timed out in 7002ms, After SMT, problems are : Problem set: 1 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 926 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 926/926 places, 1171/1171 transitions.
Graph (trivial) has 885 edges and 926 vertex of which 64 / 926 are part of one of the 12 SCC in 4 ms
Free SCC test removed 52 places
Drop transitions (Empty/Sink Transition effects.) removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Graph (complete) has 1354 edges and 874 vertex of which 870 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 632 rules applied. Total rules applied 634 place count 870 transition count 468
Reduce places removed 628 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 637 rules applied. Total rules applied 1271 place count 242 transition count 459
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 1278 place count 238 transition count 456
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1281 place count 235 transition count 456
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 1281 place count 235 transition count 399
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1395 place count 178 transition count 399
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1396 place count 177 transition count 398
Iterating global reduction 4 with 1 rules applied. Total rules applied 1397 place count 177 transition count 398
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 1459 place count 146 transition count 367
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 1469 place count 146 transition count 357
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 1491 place count 124 transition count 206
Iterating global reduction 5 with 22 rules applied. Total rules applied 1513 place count 124 transition count 206
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1524 place count 124 transition count 195
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1534 place count 114 transition count 185
Iterating global reduction 6 with 10 rules applied. Total rules applied 1544 place count 114 transition count 185
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1551 place count 107 transition count 178
Iterating global reduction 6 with 7 rules applied. Total rules applied 1558 place count 107 transition count 178
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1560 place count 107 transition count 176
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1570 place count 102 transition count 171
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1574 place count 100 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1576 place count 100 transition count 174
Free-agglomeration rule applied 33 times.
Iterating global reduction 7 with 33 rules applied. Total rules applied 1609 place count 100 transition count 141
Reduce places removed 33 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 38 rules applied. Total rules applied 1647 place count 67 transition count 136
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1651 place count 63 transition count 132
Iterating global reduction 8 with 4 rules applied. Total rules applied 1655 place count 63 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 8 with 20 rules applied. Total rules applied 1675 place count 63 transition count 112
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 1682 place count 63 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1685 place count 63 transition count 109
Applied a total of 1685 rules in 124 ms. Remains 63 /926 variables (removed 863) and now considering 109/1171 (removed 1062) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 63/926 places, 109/1171 transitions.
RANDOM walk for 25721 steps (5 resets) in 538 ms. (47 steps per ms) remains 0/14 properties
FORMULA MedleyB-PT-B02-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 171 stabilizing places and 179 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 926 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 926/926 places, 1171/1171 transitions.
Graph (trivial) has 919 edges and 926 vertex of which 65 / 926 are part of one of the 12 SCC in 2 ms
Free SCC test removed 53 places
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 655 transitions
Trivial Post-agglo rules discarded 655 transitions
Performed 655 trivial Post agglomeration. Transition count delta: 655
Iterating post reduction 0 with 655 rules applied. Total rules applied 656 place count 872 transition count 454
Reduce places removed 655 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 664 rules applied. Total rules applied 1320 place count 217 transition count 445
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1324 place count 213 transition count 445
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 1324 place count 213 transition count 397
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 1420 place count 165 transition count 397
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1430 place count 155 transition count 387
Iterating global reduction 3 with 10 rules applied. Total rules applied 1440 place count 155 transition count 387
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1442 place count 153 transition count 385
Iterating global reduction 3 with 2 rules applied. Total rules applied 1444 place count 153 transition count 385
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1445 place count 152 transition count 384
Iterating global reduction 3 with 1 rules applied. Total rules applied 1446 place count 152 transition count 384
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1447 place count 151 transition count 383
Iterating global reduction 3 with 1 rules applied. Total rules applied 1448 place count 151 transition count 383
Performed 33 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1514 place count 118 transition count 343
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1539 place count 93 transition count 192
Iterating global reduction 3 with 25 rules applied. Total rules applied 1564 place count 93 transition count 192
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1576 place count 93 transition count 180
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1590 place count 79 transition count 162
Iterating global reduction 4 with 14 rules applied. Total rules applied 1604 place count 79 transition count 162
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1618 place count 65 transition count 144
Iterating global reduction 4 with 14 rules applied. Total rules applied 1632 place count 65 transition count 144
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1639 place count 65 transition count 137
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1655 place count 57 transition count 144
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1656 place count 56 transition count 136
Iterating global reduction 5 with 1 rules applied. Total rules applied 1657 place count 56 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1658 place count 56 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1662 place count 56 transition count 131
Applied a total of 1662 rules in 83 ms. Remains 56 /926 variables (removed 870) and now considering 131/1171 (removed 1040) transitions.
[2025-06-08 12:44:43] [INFO ] Flow matrix only has 126 transitions (discarded 5 similar events)
// Phase 1: matrix 126 rows 56 cols
[2025-06-08 12:44:43] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:44:43] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-08 12:44:43] [INFO ] Flow matrix only has 126 transitions (discarded 5 similar events)
[2025-06-08 12:44:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:44:43] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-08 12:44:43] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:44:43] [INFO ] Redundant transitions in 4 ms returned []
Running 114 sub problems to find dead transitions.
[2025-06-08 12:44:43] [INFO ] Flow matrix only has 126 transitions (discarded 5 similar events)
[2025-06-08 12:44:43] [INFO ] Invariant cache hit.
[2025-06-08 12:44:43] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:44] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:44] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:44] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:44] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:44] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:44] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:44] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:44] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:44] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:45] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:45] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:45] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 125/181 variables, 56/70 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 14/84 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 1/182 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (OVERLAPS) 0/182 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 85 constraints, problems are : Problem set: 0 solved, 114 unsolved in 5894 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 125/181 variables, 56/70 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 14/84 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 114/198 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 1/182 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:58] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/182 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 13 (OVERLAPS) 0/182 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 200 constraints, problems are : Problem set: 0 solved, 114 unsolved in 17103 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23044ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 23049ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/926 places, 131/1171 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23285 ms. Remains : 56/926 places, 131/1171 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0)]
Running random walk in product with property : MedleyB-PT-B02-LTLCardinality-00
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 3 ms.
FORMULA MedleyB-PT-B02-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLCardinality-00 finished in 23510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(F(p0)))))&&F(p1)))'
Support contains 3 out of 926 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 926/926 places, 1171/1171 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 912 transition count 1157
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 912 transition count 1157
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 41 place count 899 transition count 1144
Iterating global reduction 0 with 13 rules applied. Total rules applied 54 place count 899 transition count 1144
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 67 place count 886 transition count 1131
Iterating global reduction 0 with 13 rules applied. Total rules applied 80 place count 886 transition count 1131
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 91 place count 875 transition count 1120
Iterating global reduction 0 with 11 rules applied. Total rules applied 102 place count 875 transition count 1120
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 866 transition count 1111
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 866 transition count 1111
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 128 place count 858 transition count 1103
Iterating global reduction 0 with 8 rules applied. Total rules applied 136 place count 858 transition count 1103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 137 place count 858 transition count 1102
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 144 place count 851 transition count 1095
Iterating global reduction 1 with 7 rules applied. Total rules applied 151 place count 851 transition count 1095
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 152 place count 851 transition count 1094
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 157 place count 846 transition count 1089
Iterating global reduction 2 with 5 rules applied. Total rules applied 162 place count 846 transition count 1089
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 167 place count 841 transition count 1084
Iterating global reduction 2 with 5 rules applied. Total rules applied 172 place count 841 transition count 1084
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 173 place count 841 transition count 1083
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 177 place count 837 transition count 1079
Iterating global reduction 3 with 4 rules applied. Total rules applied 181 place count 837 transition count 1079
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 185 place count 833 transition count 1075
Iterating global reduction 3 with 4 rules applied. Total rules applied 189 place count 833 transition count 1075
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 193 place count 829 transition count 1071
Iterating global reduction 3 with 4 rules applied. Total rules applied 197 place count 829 transition count 1071
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 201 place count 825 transition count 1067
Iterating global reduction 3 with 4 rules applied. Total rules applied 205 place count 825 transition count 1067
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 209 place count 821 transition count 1063
Iterating global reduction 3 with 4 rules applied. Total rules applied 213 place count 821 transition count 1063
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 214 place count 821 transition count 1062
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 217 place count 818 transition count 1059
Iterating global reduction 4 with 3 rules applied. Total rules applied 220 place count 818 transition count 1059
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 223 place count 815 transition count 1056
Iterating global reduction 4 with 3 rules applied. Total rules applied 226 place count 815 transition count 1056
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 229 place count 812 transition count 1053
Iterating global reduction 4 with 3 rules applied. Total rules applied 232 place count 812 transition count 1053
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 235 place count 809 transition count 1050
Iterating global reduction 4 with 3 rules applied. Total rules applied 238 place count 809 transition count 1050
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 241 place count 806 transition count 1047
Iterating global reduction 4 with 3 rules applied. Total rules applied 244 place count 806 transition count 1047
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 245 place count 806 transition count 1046
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 247 place count 804 transition count 1044
Iterating global reduction 5 with 2 rules applied. Total rules applied 249 place count 804 transition count 1044
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 251 place count 802 transition count 1042
Iterating global reduction 5 with 2 rules applied. Total rules applied 253 place count 802 transition count 1042
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 254 place count 802 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 255 place count 801 transition count 1040
Iterating global reduction 6 with 1 rules applied. Total rules applied 256 place count 801 transition count 1040
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 257 place count 801 transition count 1039
Applied a total of 257 rules in 520 ms. Remains 801 /926 variables (removed 125) and now considering 1039/1171 (removed 132) transitions.
// Phase 1: matrix 1039 rows 801 cols
[2025-06-08 12:45:07] [INFO ] Computed 5 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:45:07] [INFO ] Implicit Places using invariants in 394 ms returned []
[2025-06-08 12:45:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:45:08] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
Running 1038 sub problems to find dead transitions.
[2025-06-08 12:45:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
SMT process timed out in 30299ms, After SMT, problems are : Problem set: 0 solved, 1038 unsolved
Search for dead transitions found 0 dead transitions in 30304ms
Starting structural reductions in LTL mode, iteration 1 : 801/926 places, 1039/1171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31996 ms. Remains : 801/926 places, 1039/1171 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B02-LTLCardinality-02
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 2 ms.
FORMULA MedleyB-PT-B02-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLCardinality-02 finished in 32304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 926 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 926/926 places, 1171/1171 transitions.
Graph (trivial) has 912 edges and 926 vertex of which 65 / 926 are part of one of the 12 SCC in 1 ms
Free SCC test removed 53 places
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 647 transitions
Trivial Post-agglo rules discarded 647 transitions
Performed 647 trivial Post agglomeration. Transition count delta: 647
Iterating post reduction 0 with 647 rules applied. Total rules applied 648 place count 872 transition count 462
Reduce places removed 647 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 656 rules applied. Total rules applied 1304 place count 225 transition count 453
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 1310 place count 221 transition count 451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1312 place count 219 transition count 451
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1312 place count 219 transition count 403
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1408 place count 171 transition count 403
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1419 place count 160 transition count 392
Iterating global reduction 4 with 11 rules applied. Total rules applied 1430 place count 160 transition count 392
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1433 place count 157 transition count 389
Iterating global reduction 4 with 3 rules applied. Total rules applied 1436 place count 157 transition count 389
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1438 place count 155 transition count 387
Iterating global reduction 4 with 2 rules applied. Total rules applied 1440 place count 155 transition count 387
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1442 place count 153 transition count 385
Iterating global reduction 4 with 2 rules applied. Total rules applied 1444 place count 153 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1445 place count 153 transition count 384
Performed 32 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 1509 place count 121 transition count 346
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1534 place count 96 transition count 195
Iterating global reduction 5 with 25 rules applied. Total rules applied 1559 place count 96 transition count 195
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1570 place count 96 transition count 184
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1583 place count 83 transition count 167
Iterating global reduction 6 with 13 rules applied. Total rules applied 1596 place count 83 transition count 167
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1609 place count 70 transition count 150
Iterating global reduction 6 with 13 rules applied. Total rules applied 1622 place count 70 transition count 150
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1627 place count 70 transition count 145
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 1641 place count 63 transition count 146
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1642 place count 62 transition count 138
Iterating global reduction 7 with 1 rules applied. Total rules applied 1643 place count 62 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1644 place count 62 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1648 place count 62 transition count 133
Applied a total of 1648 rules in 61 ms. Remains 62 /926 variables (removed 864) and now considering 133/1171 (removed 1038) transitions.
[2025-06-08 12:45:39] [INFO ] Flow matrix only has 128 transitions (discarded 5 similar events)
// Phase 1: matrix 128 rows 62 cols
[2025-06-08 12:45:39] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:45:39] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-08 12:45:39] [INFO ] Flow matrix only has 128 transitions (discarded 5 similar events)
[2025-06-08 12:45:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:45:39] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-08 12:45:39] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:45:39] [INFO ] Redundant transitions in 2 ms returned []
Running 124 sub problems to find dead transitions.
[2025-06-08 12:45:39] [INFO ] Flow matrix only has 128 transitions (discarded 5 similar events)
[2025-06-08 12:45:39] [INFO ] Invariant cache hit.
[2025-06-08 12:45:39] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:45:40] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:45:40] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:45:40] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:45:40] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:45:40] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:45:40] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:45:40] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:45:40] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:45:40] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:45:40] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 127/189 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:45:41] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:45:41] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:45:42] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:45:42] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (OVERLAPS) 1/190 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 93 constraints, problems are : Problem set: 0 solved, 124 unsolved in 7114 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 127/189 variables, 62/78 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 14/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 124/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:45:48] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 1/190 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:45:55] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:45:56] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:45:58] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 221 constraints, problems are : Problem set: 0 solved, 124 unsolved in 29060 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36211ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 36212ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/926 places, 133/1171 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36509 ms. Remains : 62/926 places, 133/1171 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B02-LTLCardinality-03
Product exploration explored 100000 steps with 676 reset in 173 ms.
Stuttering criterion allowed to conclude after 19453 steps with 2416 reset in 42 ms.
FORMULA MedleyB-PT-B02-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLCardinality-03 finished in 36879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 926 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 926/926 places, 1171/1171 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 910 transition count 1155
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 910 transition count 1155
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 47 place count 895 transition count 1140
Iterating global reduction 0 with 15 rules applied. Total rules applied 62 place count 895 transition count 1140
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 77 place count 880 transition count 1125
Iterating global reduction 0 with 15 rules applied. Total rules applied 92 place count 880 transition count 1125
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 105 place count 867 transition count 1112
Iterating global reduction 0 with 13 rules applied. Total rules applied 118 place count 867 transition count 1112
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 129 place count 856 transition count 1101
Iterating global reduction 0 with 11 rules applied. Total rules applied 140 place count 856 transition count 1101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 141 place count 856 transition count 1100
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 150 place count 847 transition count 1091
Iterating global reduction 1 with 9 rules applied. Total rules applied 159 place count 847 transition count 1091
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 160 place count 847 transition count 1090
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 168 place count 839 transition count 1082
Iterating global reduction 2 with 8 rules applied. Total rules applied 176 place count 839 transition count 1082
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 177 place count 839 transition count 1081
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 183 place count 833 transition count 1075
Iterating global reduction 3 with 6 rules applied. Total rules applied 189 place count 833 transition count 1075
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 195 place count 827 transition count 1069
Iterating global reduction 3 with 6 rules applied. Total rules applied 201 place count 827 transition count 1069
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 202 place count 827 transition count 1068
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 207 place count 822 transition count 1063
Iterating global reduction 4 with 5 rules applied. Total rules applied 212 place count 822 transition count 1063
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 216 place count 818 transition count 1059
Iterating global reduction 4 with 4 rules applied. Total rules applied 220 place count 818 transition count 1059
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 224 place count 814 transition count 1055
Iterating global reduction 4 with 4 rules applied. Total rules applied 228 place count 814 transition count 1055
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 232 place count 810 transition count 1051
Iterating global reduction 4 with 4 rules applied. Total rules applied 236 place count 810 transition count 1051
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 240 place count 806 transition count 1047
Iterating global reduction 4 with 4 rules applied. Total rules applied 244 place count 806 transition count 1047
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 245 place count 806 transition count 1046
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 248 place count 803 transition count 1043
Iterating global reduction 5 with 3 rules applied. Total rules applied 251 place count 803 transition count 1043
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 254 place count 800 transition count 1040
Iterating global reduction 5 with 3 rules applied. Total rules applied 257 place count 800 transition count 1040
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 260 place count 797 transition count 1037
Iterating global reduction 5 with 3 rules applied. Total rules applied 263 place count 797 transition count 1037
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 266 place count 794 transition count 1034
Iterating global reduction 5 with 3 rules applied. Total rules applied 269 place count 794 transition count 1034
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 272 place count 791 transition count 1031
Iterating global reduction 5 with 3 rules applied. Total rules applied 275 place count 791 transition count 1031
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 276 place count 791 transition count 1030
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 278 place count 789 transition count 1028
Iterating global reduction 6 with 2 rules applied. Total rules applied 280 place count 789 transition count 1028
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 282 place count 787 transition count 1026
Iterating global reduction 6 with 2 rules applied. Total rules applied 284 place count 787 transition count 1026
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 285 place count 787 transition count 1025
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 286 place count 786 transition count 1024
Iterating global reduction 7 with 1 rules applied. Total rules applied 287 place count 786 transition count 1024
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 288 place count 786 transition count 1023
Applied a total of 288 rules in 500 ms. Remains 786 /926 variables (removed 140) and now considering 1023/1171 (removed 148) transitions.
// Phase 1: matrix 1023 rows 786 cols
[2025-06-08 12:46:16] [INFO ] Computed 5 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:46:16] [INFO ] Implicit Places using invariants in 426 ms returned []
[2025-06-08 12:46:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:46:17] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
Running 1022 sub problems to find dead transitions.
[2025-06-08 12:46:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/785 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1022 unsolved
SMT process timed out in 30225ms, After SMT, problems are : Problem set: 0 solved, 1022 unsolved
Search for dead transitions found 0 dead transitions in 30228ms
Starting structural reductions in LTL mode, iteration 1 : 786/926 places, 1023/1171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32003 ms. Remains : 786/926 places, 1023/1171 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B02-LTLCardinality-04
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLCardinality-04 finished in 32102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 926 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 926/926 places, 1171/1171 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 910 transition count 1155
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 910 transition count 1155
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 47 place count 895 transition count 1140
Iterating global reduction 0 with 15 rules applied. Total rules applied 62 place count 895 transition count 1140
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 77 place count 880 transition count 1125
Iterating global reduction 0 with 15 rules applied. Total rules applied 92 place count 880 transition count 1125
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 105 place count 867 transition count 1112
Iterating global reduction 0 with 13 rules applied. Total rules applied 118 place count 867 transition count 1112
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 129 place count 856 transition count 1101
Iterating global reduction 0 with 11 rules applied. Total rules applied 140 place count 856 transition count 1101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 141 place count 856 transition count 1100
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 150 place count 847 transition count 1091
Iterating global reduction 1 with 9 rules applied. Total rules applied 159 place count 847 transition count 1091
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 160 place count 847 transition count 1090
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 168 place count 839 transition count 1082
Iterating global reduction 2 with 8 rules applied. Total rules applied 176 place count 839 transition count 1082
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 177 place count 839 transition count 1081
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 183 place count 833 transition count 1075
Iterating global reduction 3 with 6 rules applied. Total rules applied 189 place count 833 transition count 1075
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 195 place count 827 transition count 1069
Iterating global reduction 3 with 6 rules applied. Total rules applied 201 place count 827 transition count 1069
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 202 place count 827 transition count 1068
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 207 place count 822 transition count 1063
Iterating global reduction 4 with 5 rules applied. Total rules applied 212 place count 822 transition count 1063
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 216 place count 818 transition count 1059
Iterating global reduction 4 with 4 rules applied. Total rules applied 220 place count 818 transition count 1059
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 224 place count 814 transition count 1055
Iterating global reduction 4 with 4 rules applied. Total rules applied 228 place count 814 transition count 1055
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 232 place count 810 transition count 1051
Iterating global reduction 4 with 4 rules applied. Total rules applied 236 place count 810 transition count 1051
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 240 place count 806 transition count 1047
Iterating global reduction 4 with 4 rules applied. Total rules applied 244 place count 806 transition count 1047
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 245 place count 806 transition count 1046
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 248 place count 803 transition count 1043
Iterating global reduction 5 with 3 rules applied. Total rules applied 251 place count 803 transition count 1043
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 254 place count 800 transition count 1040
Iterating global reduction 5 with 3 rules applied. Total rules applied 257 place count 800 transition count 1040
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 260 place count 797 transition count 1037
Iterating global reduction 5 with 3 rules applied. Total rules applied 263 place count 797 transition count 1037
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 266 place count 794 transition count 1034
Iterating global reduction 5 with 3 rules applied. Total rules applied 269 place count 794 transition count 1034
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 272 place count 791 transition count 1031
Iterating global reduction 5 with 3 rules applied. Total rules applied 275 place count 791 transition count 1031
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 276 place count 791 transition count 1030
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 278 place count 789 transition count 1028
Iterating global reduction 6 with 2 rules applied. Total rules applied 280 place count 789 transition count 1028
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 282 place count 787 transition count 1026
Iterating global reduction 6 with 2 rules applied. Total rules applied 284 place count 787 transition count 1026
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 285 place count 787 transition count 1025
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 286 place count 786 transition count 1024
Iterating global reduction 7 with 1 rules applied. Total rules applied 287 place count 786 transition count 1024
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 288 place count 786 transition count 1023
Applied a total of 288 rules in 554 ms. Remains 786 /926 variables (removed 140) and now considering 1023/1171 (removed 148) transitions.
[2025-06-08 12:46:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:46:49] [INFO ] Implicit Places using invariants in 383 ms returned []
[2025-06-08 12:46:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:46:49] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
Running 1022 sub problems to find dead transitions.
[2025-06-08 12:46:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/785 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1022 unsolved
SMT process timed out in 30246ms, After SMT, problems are : Problem set: 0 solved, 1022 unsolved
Search for dead transitions found 0 dead transitions in 30250ms
Starting structural reductions in LTL mode, iteration 1 : 786/926 places, 1023/1171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32024 ms. Remains : 786/926 places, 1023/1171 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B02-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B02-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLCardinality-05 finished in 32205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 926 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 926/926 places, 1171/1171 transitions.
Graph (trivial) has 914 edges and 926 vertex of which 65 / 926 are part of one of the 12 SCC in 2 ms
Free SCC test removed 53 places
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 648 transitions
Trivial Post-agglo rules discarded 648 transitions
Performed 648 trivial Post agglomeration. Transition count delta: 648
Iterating post reduction 0 with 648 rules applied. Total rules applied 649 place count 872 transition count 461
Reduce places removed 648 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 657 rules applied. Total rules applied 1306 place count 224 transition count 452
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 1311 place count 220 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1312 place count 219 transition count 451
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1312 place count 219 transition count 402
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1410 place count 170 transition count 402
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1421 place count 159 transition count 391
Iterating global reduction 4 with 11 rules applied. Total rules applied 1432 place count 159 transition count 391
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1435 place count 156 transition count 388
Iterating global reduction 4 with 3 rules applied. Total rules applied 1438 place count 156 transition count 388
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1440 place count 154 transition count 386
Iterating global reduction 4 with 2 rules applied. Total rules applied 1442 place count 154 transition count 386
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1444 place count 152 transition count 384
Iterating global reduction 4 with 2 rules applied. Total rules applied 1446 place count 152 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1447 place count 152 transition count 383
Performed 32 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 1511 place count 120 transition count 345
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1536 place count 95 transition count 194
Iterating global reduction 5 with 25 rules applied. Total rules applied 1561 place count 95 transition count 194
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1572 place count 95 transition count 183
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1585 place count 82 transition count 166
Iterating global reduction 6 with 13 rules applied. Total rules applied 1598 place count 82 transition count 166
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1611 place count 69 transition count 149
Iterating global reduction 6 with 13 rules applied. Total rules applied 1624 place count 69 transition count 149
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1630 place count 69 transition count 143
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1646 place count 61 transition count 157
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1647 place count 60 transition count 149
Iterating global reduction 7 with 1 rules applied. Total rules applied 1648 place count 60 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1649 place count 60 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1653 place count 60 transition count 144
Applied a total of 1653 rules in 51 ms. Remains 60 /926 variables (removed 866) and now considering 144/1171 (removed 1027) transitions.
[2025-06-08 12:47:20] [INFO ] Flow matrix only has 139 transitions (discarded 5 similar events)
// Phase 1: matrix 139 rows 60 cols
[2025-06-08 12:47:20] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:47:20] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-08 12:47:20] [INFO ] Flow matrix only has 139 transitions (discarded 5 similar events)
[2025-06-08 12:47:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:47:20] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-08 12:47:20] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:47:20] [INFO ] Redundant transitions in 4 ms returned []
Running 119 sub problems to find dead transitions.
[2025-06-08 12:47:20] [INFO ] Flow matrix only has 139 transitions (discarded 5 similar events)
[2025-06-08 12:47:20] [INFO ] Invariant cache hit.
[2025-06-08 12:47:20] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:47:21] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:47:21] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:47:21] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:47:21] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:47:21] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:47:21] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:47:21] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:47:21] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:47:21] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:47:21] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:47:21] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:47:21] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:47:21] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:47:21] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:47:22] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:47:22] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:47:22] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 138/198 variables, 60/79 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 1/199 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/199 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 94 constraints, problems are : Problem set: 0 solved, 119 unsolved in 7452 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 138/198 variables, 60/79 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 119/212 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 1/199 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:47:36] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/199 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 214 constraints, problems are : Problem set: 0 solved, 119 unsolved in 20190 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27668ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 27672ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/926 places, 144/1171 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27862 ms. Remains : 60/926 places, 144/1171 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B02-LTLCardinality-08
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B02-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLCardinality-08 finished in 28043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(p0))))'
Support contains 2 out of 926 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 926/926 places, 1171/1171 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 910 transition count 1155
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 910 transition count 1155
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 47 place count 895 transition count 1140
Iterating global reduction 0 with 15 rules applied. Total rules applied 62 place count 895 transition count 1140
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 77 place count 880 transition count 1125
Iterating global reduction 0 with 15 rules applied. Total rules applied 92 place count 880 transition count 1125
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 105 place count 867 transition count 1112
Iterating global reduction 0 with 13 rules applied. Total rules applied 118 place count 867 transition count 1112
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 129 place count 856 transition count 1101
Iterating global reduction 0 with 11 rules applied. Total rules applied 140 place count 856 transition count 1101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 141 place count 856 transition count 1100
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 150 place count 847 transition count 1091
Iterating global reduction 1 with 9 rules applied. Total rules applied 159 place count 847 transition count 1091
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 160 place count 847 transition count 1090
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 168 place count 839 transition count 1082
Iterating global reduction 2 with 8 rules applied. Total rules applied 176 place count 839 transition count 1082
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 177 place count 839 transition count 1081
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 183 place count 833 transition count 1075
Iterating global reduction 3 with 6 rules applied. Total rules applied 189 place count 833 transition count 1075
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 195 place count 827 transition count 1069
Iterating global reduction 3 with 6 rules applied. Total rules applied 201 place count 827 transition count 1069
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 202 place count 827 transition count 1068
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 207 place count 822 transition count 1063
Iterating global reduction 4 with 5 rules applied. Total rules applied 212 place count 822 transition count 1063
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 216 place count 818 transition count 1059
Iterating global reduction 4 with 4 rules applied. Total rules applied 220 place count 818 transition count 1059
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 224 place count 814 transition count 1055
Iterating global reduction 4 with 4 rules applied. Total rules applied 228 place count 814 transition count 1055
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 232 place count 810 transition count 1051
Iterating global reduction 4 with 4 rules applied. Total rules applied 236 place count 810 transition count 1051
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 240 place count 806 transition count 1047
Iterating global reduction 4 with 4 rules applied. Total rules applied 244 place count 806 transition count 1047
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 245 place count 806 transition count 1046
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 248 place count 803 transition count 1043
Iterating global reduction 5 with 3 rules applied. Total rules applied 251 place count 803 transition count 1043
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 254 place count 800 transition count 1040
Iterating global reduction 5 with 3 rules applied. Total rules applied 257 place count 800 transition count 1040
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 260 place count 797 transition count 1037
Iterating global reduction 5 with 3 rules applied. Total rules applied 263 place count 797 transition count 1037
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 266 place count 794 transition count 1034
Iterating global reduction 5 with 3 rules applied. Total rules applied 269 place count 794 transition count 1034
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 272 place count 791 transition count 1031
Iterating global reduction 5 with 3 rules applied. Total rules applied 275 place count 791 transition count 1031
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 276 place count 791 transition count 1030
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 278 place count 789 transition count 1028
Iterating global reduction 6 with 2 rules applied. Total rules applied 280 place count 789 transition count 1028
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 282 place count 787 transition count 1026
Iterating global reduction 6 with 2 rules applied. Total rules applied 284 place count 787 transition count 1026
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 285 place count 787 transition count 1025
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 286 place count 786 transition count 1024
Iterating global reduction 7 with 1 rules applied. Total rules applied 287 place count 786 transition count 1024
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 288 place count 786 transition count 1023
Applied a total of 288 rules in 548 ms. Remains 786 /926 variables (removed 140) and now considering 1023/1171 (removed 148) transitions.
// Phase 1: matrix 1023 rows 786 cols
[2025-06-08 12:47:48] [INFO ] Computed 5 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:47:49] [INFO ] Implicit Places using invariants in 402 ms returned []
[2025-06-08 12:47:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:47:50] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
Running 1022 sub problems to find dead transitions.
[2025-06-08 12:47:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 30242ms, After SMT, problems are : Problem set: 0 solved, 1022 unsolved
Search for dead transitions found 0 dead transitions in 30249ms
Starting structural reductions in LTL mode, iteration 1 : 786/926 places, 1023/1171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32050 ms. Remains : 786/926 places, 1023/1171 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : MedleyB-PT-B02-LTLCardinality-09
Product exploration explored 100000 steps with 33333 reset in 275 ms.
Product exploration explored 100000 steps with 33333 reset in 343 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 48 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyB-PT-B02-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B02-LTLCardinality-09 finished in 32883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 926 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 926/926 places, 1171/1171 transitions.
Graph (trivial) has 916 edges and 926 vertex of which 65 / 926 are part of one of the 12 SCC in 1 ms
Free SCC test removed 53 places
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 651 transitions
Trivial Post-agglo rules discarded 651 transitions
Performed 651 trivial Post agglomeration. Transition count delta: 651
Iterating post reduction 0 with 651 rules applied. Total rules applied 652 place count 872 transition count 458
Reduce places removed 651 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 660 rules applied. Total rules applied 1312 place count 221 transition count 449
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1316 place count 217 transition count 449
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 1316 place count 217 transition count 398
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 1418 place count 166 transition count 398
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1427 place count 157 transition count 389
Iterating global reduction 3 with 9 rules applied. Total rules applied 1436 place count 157 transition count 389
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1438 place count 155 transition count 387
Iterating global reduction 3 with 2 rules applied. Total rules applied 1440 place count 155 transition count 387
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1442 place count 153 transition count 385
Iterating global reduction 3 with 2 rules applied. Total rules applied 1444 place count 153 transition count 385
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1446 place count 151 transition count 383
Iterating global reduction 3 with 2 rules applied. Total rules applied 1448 place count 151 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1449 place count 151 transition count 382
Performed 32 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 1513 place count 119 transition count 343
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 1537 place count 95 transition count 193
Iterating global reduction 4 with 24 rules applied. Total rules applied 1561 place count 95 transition count 193
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1572 place count 95 transition count 182
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1585 place count 82 transition count 165
Iterating global reduction 5 with 13 rules applied. Total rules applied 1598 place count 82 transition count 165
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1611 place count 69 transition count 148
Iterating global reduction 5 with 13 rules applied. Total rules applied 1624 place count 69 transition count 148
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1630 place count 69 transition count 142
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1646 place count 61 transition count 149
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1647 place count 60 transition count 141
Iterating global reduction 6 with 1 rules applied. Total rules applied 1648 place count 60 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1649 place count 60 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1653 place count 60 transition count 136
Applied a total of 1653 rules in 65 ms. Remains 60 /926 variables (removed 866) and now considering 136/1171 (removed 1035) transitions.
[2025-06-08 12:48:21] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
// Phase 1: matrix 131 rows 60 cols
[2025-06-08 12:48:21] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:48:21] [INFO ] Implicit Places using invariants in 443 ms returned []
[2025-06-08 12:48:21] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2025-06-08 12:48:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:48:21] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-08 12:48:21] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:48:21] [INFO ] Redundant transitions in 5 ms returned []
Running 119 sub problems to find dead transitions.
[2025-06-08 12:48:21] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2025-06-08 12:48:21] [INFO ] Invariant cache hit.
[2025-06-08 12:48:21] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:22] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:22] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:22] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:22] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:22] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:22] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:22] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:23] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:23] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:23] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:23] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:23] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 130/190 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:24] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 1/191 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/191 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 90 constraints, problems are : Problem set: 0 solved, 119 unsolved in 6855 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 130/190 variables, 60/75 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 119/208 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 1/191 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/191 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 209 constraints, problems are : Problem set: 0 solved, 119 unsolved in 12351 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19252ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 19252ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/926 places, 136/1171 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19861 ms. Remains : 60/926 places, 136/1171 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : MedleyB-PT-B02-LTLCardinality-10
Product exploration explored 100000 steps with 847 reset in 48 ms.
Product exploration explored 100000 steps with 97 reset in 48 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5788 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (660 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8234 steps, run visited all 1 properties in 32 ms. (steps per millisecond=257 )
Probabilistic random walk after 8234 steps, saw 2950 distinct states, run finished after 50 ms. (steps per millisecond=164 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 136/136 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2025-06-08 12:48:41] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2025-06-08 12:48:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:48:41] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-08 12:48:41] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2025-06-08 12:48:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:48:41] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-08 12:48:41] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:48:41] [INFO ] Redundant transitions in 1 ms returned []
Running 119 sub problems to find dead transitions.
[2025-06-08 12:48:41] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2025-06-08 12:48:41] [INFO ] Invariant cache hit.
[2025-06-08 12:48:41] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:42] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:42] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:42] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:42] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:42] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:42] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:42] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:43] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:43] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:43] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:43] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:43] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 130/190 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:44] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 1/191 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/191 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 90 constraints, problems are : Problem set: 0 solved, 119 unsolved in 6907 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 130/190 variables, 60/75 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 119/208 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 1/191 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/191 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 209 constraints, problems are : Problem set: 0 solved, 119 unsolved in 12100 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19066ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 19067ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19242 ms. Remains : 60/60 places, 136/136 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5804 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (650 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8234 steps, run visited all 1 properties in 37 ms. (steps per millisecond=222 )
Probabilistic random walk after 8234 steps, saw 2950 distinct states, run finished after 37 ms. (steps per millisecond=222 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 883 reset in 46 ms.
Product exploration explored 100000 steps with 6605 reset in 83 ms.
Built C files in :
/tmp/ltsmin11082198121066385882
[2025-06-08 12:49:01] [INFO ] Computing symmetric may disable matrix : 136 transitions.
[2025-06-08 12:49:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 12:49:01] [INFO ] Computing symmetric may enable matrix : 136 transitions.
[2025-06-08 12:49:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 12:49:01] [INFO ] Computing Do-Not-Accords matrix : 136 transitions.
[2025-06-08 12:49:01] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 12:49:01] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11082198121066385882
Running compilation step : cd /tmp/ltsmin11082198121066385882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 410 ms.
Running link step : cd /tmp/ltsmin11082198121066385882;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin11082198121066385882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8676679362847212287.hoa' '--buchi-type=spotba'
LTSmin run took 487 ms.
FORMULA MedleyB-PT-B02-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyB-PT-B02-LTLCardinality-10 finished in 41341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0))) U (p1 U X(G(p2)))))'
Support contains 6 out of 926 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 926/926 places, 1171/1171 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 912 transition count 1157
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 912 transition count 1157
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 41 place count 899 transition count 1144
Iterating global reduction 0 with 13 rules applied. Total rules applied 54 place count 899 transition count 1144
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 67 place count 886 transition count 1131
Iterating global reduction 0 with 13 rules applied. Total rules applied 80 place count 886 transition count 1131
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 91 place count 875 transition count 1120
Iterating global reduction 0 with 11 rules applied. Total rules applied 102 place count 875 transition count 1120
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 865 transition count 1110
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 865 transition count 1110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 123 place count 865 transition count 1109
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 131 place count 857 transition count 1101
Iterating global reduction 1 with 8 rules applied. Total rules applied 139 place count 857 transition count 1101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 140 place count 857 transition count 1100
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 147 place count 850 transition count 1093
Iterating global reduction 2 with 7 rules applied. Total rules applied 154 place count 850 transition count 1093
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 850 transition count 1092
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 160 place count 845 transition count 1087
Iterating global reduction 3 with 5 rules applied. Total rules applied 165 place count 845 transition count 1087
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 170 place count 840 transition count 1082
Iterating global reduction 3 with 5 rules applied. Total rules applied 175 place count 840 transition count 1082
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 176 place count 840 transition count 1081
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 180 place count 836 transition count 1077
Iterating global reduction 4 with 4 rules applied. Total rules applied 184 place count 836 transition count 1077
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 187 place count 833 transition count 1074
Iterating global reduction 4 with 3 rules applied. Total rules applied 190 place count 833 transition count 1074
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 193 place count 830 transition count 1071
Iterating global reduction 4 with 3 rules applied. Total rules applied 196 place count 830 transition count 1071
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 199 place count 827 transition count 1068
Iterating global reduction 4 with 3 rules applied. Total rules applied 202 place count 827 transition count 1068
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 205 place count 824 transition count 1065
Iterating global reduction 4 with 3 rules applied. Total rules applied 208 place count 824 transition count 1065
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 209 place count 824 transition count 1064
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 211 place count 822 transition count 1062
Iterating global reduction 5 with 2 rules applied. Total rules applied 213 place count 822 transition count 1062
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 215 place count 820 transition count 1060
Iterating global reduction 5 with 2 rules applied. Total rules applied 217 place count 820 transition count 1060
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 219 place count 818 transition count 1058
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 818 transition count 1058
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 223 place count 816 transition count 1056
Iterating global reduction 5 with 2 rules applied. Total rules applied 225 place count 816 transition count 1056
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 227 place count 814 transition count 1054
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 814 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 230 place count 814 transition count 1053
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 231 place count 813 transition count 1052
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 813 transition count 1052
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 233 place count 812 transition count 1051
Iterating global reduction 6 with 1 rules applied. Total rules applied 234 place count 812 transition count 1051
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 235 place count 811 transition count 1050
Iterating global reduction 6 with 1 rules applied. Total rules applied 236 place count 811 transition count 1050
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 237 place count 811 transition count 1049
Applied a total of 237 rules in 585 ms. Remains 811 /926 variables (removed 115) and now considering 1049/1171 (removed 122) transitions.
// Phase 1: matrix 1049 rows 811 cols
[2025-06-08 12:49:03] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:49:03] [INFO ] Implicit Places using invariants in 477 ms returned []
[2025-06-08 12:49:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:49:04] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
Running 1048 sub problems to find dead transitions.
[2025-06-08 12:49:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
SMT process timed out in 30274ms, After SMT, problems are : Problem set: 0 solved, 1048 unsolved
Search for dead transitions found 0 dead transitions in 30276ms
Starting structural reductions in LTL mode, iteration 1 : 811/926 places, 1049/1171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32119 ms. Remains : 811/926 places, 1049/1171 transitions.
Stuttering acceptance computed with spot in 424 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : MedleyB-PT-B02-LTLCardinality-11
Product exploration explored 100000 steps with 20002 reset in 191 ms.
Product exploration explored 100000 steps with 20039 reset in 193 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X p1), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 114 ms. Reduced automaton from 12 states, 24 edges and 3 AP (stutter sensitive) to 12 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 403 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (504 resets) in 447 ms. (89 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40001 steps (106 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (106 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (108 resets) in 157 ms. (253 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (109 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (109 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (111 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
[2025-06-08 12:49:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 599/605 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 206/811 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/811 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1049/1860 variables, 811/816 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1860 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/1860 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1860/1860 variables, and 816 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1407 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 811/811 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf2 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 599/605 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 206/811 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/811 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1049/1860 variables, 811/816 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1860 variables, 4/820 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1860 variables, 0/820 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1860 variables, 0/820 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1860/1860 variables, and 820 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1508 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 811/811 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2943ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 349 ms.
Support contains 4 out of 811 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 811/811 places, 1049/1049 transitions.
Graph (trivial) has 801 edges and 811 vertex of which 64 / 811 are part of one of the 12 SCC in 1 ms
Free SCC test removed 52 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (complete) has 1212 edges and 759 vertex of which 755 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 565 transitions
Trivial Post-agglo rules discarded 565 transitions
Performed 565 trivial Post agglomeration. Transition count delta: 565
Iterating post reduction 0 with 569 rules applied. Total rules applied 571 place count 755 transition count 408
Reduce places removed 565 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 576 rules applied. Total rules applied 1147 place count 190 transition count 397
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1151 place count 186 transition count 397
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 1151 place count 186 transition count 348
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 1249 place count 137 transition count 348
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1250 place count 137 transition count 347
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1306 place count 109 transition count 319
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1314 place count 109 transition count 311
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 1338 place count 85 transition count 158
Iterating global reduction 5 with 24 rules applied. Total rules applied 1362 place count 85 transition count 158
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1374 place count 85 transition count 146
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1386 place count 73 transition count 134
Iterating global reduction 6 with 12 rules applied. Total rules applied 1398 place count 73 transition count 134
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1406 place count 65 transition count 126
Iterating global reduction 6 with 8 rules applied. Total rules applied 1414 place count 65 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1418 place count 65 transition count 122
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1426 place count 61 transition count 118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1434 place count 57 transition count 139
Free-agglomeration rule applied 24 times with reduction of 7 identical transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1458 place count 57 transition count 108
Reduce places removed 24 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 42 rules applied. Total rules applied 1500 place count 33 transition count 90
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1504 place count 29 transition count 86
Iterating global reduction 8 with 4 rules applied. Total rules applied 1508 place count 29 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1509 place count 29 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 9 with 27 rules applied. Total rules applied 1536 place count 29 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1538 place count 28 transition count 61
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1542 place count 28 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1544 place count 28 transition count 59
Applied a total of 1544 rules in 31 ms. Remains 28 /811 variables (removed 783) and now considering 59/1049 (removed 990) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 28/811 places, 59/1049 transitions.
RANDOM walk for 261 steps (0 resets) in 4 ms. (52 steps per ms) remains 0/4 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X p1), (X (X p2)), (X (X p1)), (G (OR p0 p2)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 384 ms. Reduced automaton from 12 states, 24 edges and 3 AP (stutter sensitive) to 12 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 427 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 6 out of 811 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 811/811 places, 1049/1049 transitions.
Applied a total of 0 rules in 22 ms. Remains 811 /811 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
[2025-06-08 12:49:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:49:41] [INFO ] Implicit Places using invariants in 394 ms returned []
[2025-06-08 12:49:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:49:42] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1166 ms to find 0 implicit places.
Running 1048 sub problems to find dead transitions.
[2025-06-08 12:49:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
SMT process timed out in 30369ms, After SMT, problems are : Problem set: 0 solved, 1048 unsolved
Search for dead transitions found 0 dead transitions in 30386ms
Finished structural reductions in LTL mode , in 1 iterations and 31579 ms. Remains : 811/811 places, 1049/1049 transitions.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X p1), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 12 states, 22 edges and 3 AP (stutter sensitive) to 12 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 479 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (507 resets) in 138 ms. (287 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (110 resets) in 33 ms. (1176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (108 resets) in 35 ms. (1111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (109 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (105 resets) in 34 ms. (1142 steps per ms) remains 4/4 properties
[2025-06-08 12:50:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 409/413 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 398/811 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/811 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1049/1860 variables, 811/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1860 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1860 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1860/1860 variables, and 816 constraints, problems are : Problem set: 0 solved, 4 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 811/811 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 409/413 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 398/811 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/811 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1049/1860 variables, 811/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1860 variables, 4/820 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1860 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1860 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1860/1860 variables, and 820 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1463 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 811/811 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2125ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 346 ms.
Support contains 4 out of 811 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 811/811 places, 1049/1049 transitions.
Graph (trivial) has 801 edges and 811 vertex of which 64 / 811 are part of one of the 12 SCC in 1 ms
Free SCC test removed 52 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (complete) has 1212 edges and 759 vertex of which 755 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 565 transitions
Trivial Post-agglo rules discarded 565 transitions
Performed 565 trivial Post agglomeration. Transition count delta: 565
Iterating post reduction 0 with 569 rules applied. Total rules applied 571 place count 755 transition count 408
Reduce places removed 565 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 576 rules applied. Total rules applied 1147 place count 190 transition count 397
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1151 place count 186 transition count 397
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 1151 place count 186 transition count 348
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 1249 place count 137 transition count 348
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1250 place count 137 transition count 347
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1306 place count 109 transition count 319
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1314 place count 109 transition count 311
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 1338 place count 85 transition count 158
Iterating global reduction 5 with 24 rules applied. Total rules applied 1362 place count 85 transition count 158
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1374 place count 85 transition count 146
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1386 place count 73 transition count 134
Iterating global reduction 6 with 12 rules applied. Total rules applied 1398 place count 73 transition count 134
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1406 place count 65 transition count 126
Iterating global reduction 6 with 8 rules applied. Total rules applied 1414 place count 65 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1418 place count 65 transition count 122
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1426 place count 61 transition count 118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1434 place count 57 transition count 139
Free-agglomeration rule applied 24 times with reduction of 7 identical transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1458 place count 57 transition count 108
Reduce places removed 24 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 42 rules applied. Total rules applied 1500 place count 33 transition count 90
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1504 place count 29 transition count 86
Iterating global reduction 8 with 4 rules applied. Total rules applied 1508 place count 29 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1509 place count 29 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 9 with 27 rules applied. Total rules applied 1536 place count 29 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1538 place count 28 transition count 61
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1542 place count 28 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1544 place count 28 transition count 59
Applied a total of 1544 rules in 32 ms. Remains 28 /811 variables (removed 783) and now considering 59/1049 (removed 990) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 28/811 places, 59/1049 transitions.
RANDOM walk for 417 steps (0 resets) in 6 ms. (59 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X p1), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND p2 p1))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 5 factoid took 253 ms. Reduced automaton from 12 states, 22 edges and 3 AP (stutter sensitive) to 12 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 470 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 544 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 501 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 20014 reset in 164 ms.
Product exploration explored 100000 steps with 19999 reset in 169 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, false, false, false, true, false]
Stuttering acceptance computed with spot in 487 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 6 out of 811 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 811/811 places, 1049/1049 transitions.
Graph (trivial) has 797 edges and 811 vertex of which 64 / 811 are part of one of the 12 SCC in 1 ms
Free SCC test removed 52 places
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Performed 554 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 554 rules applied. Total rules applied 555 place count 759 transition count 989
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 562 place count 759 transition count 982
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 562 place count 759 transition count 986
Deduced a syphon composed of 590 places in 1 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 598 place count 759 transition count 986
Discarding 497 places :
Symmetric choice reduction at 2 with 497 rule applications. Total rules 1095 place count 262 transition count 489
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 2 with 497 rules applied. Total rules applied 1592 place count 262 transition count 489
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 140 places in 1 ms
Iterating global reduction 2 with 44 rules applied. Total rules applied 1636 place count 262 transition count 503
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 1707 place count 191 transition count 299
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 2 with 71 rules applied. Total rules applied 1778 place count 191 transition count 299
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 1792 place count 191 transition count 285
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 1824 place count 159 transition count 249
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 3 with 32 rules applied. Total rules applied 1856 place count 159 transition count 249
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1868 place count 147 transition count 237
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1880 place count 147 transition count 237
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1884 place count 147 transition count 233
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1892 place count 139 transition count 225
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 1900 place count 139 transition count 225
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1907 place count 139 transition count 260
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1918 place count 128 transition count 238
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 1929 place count 128 transition count 238
Deduced a syphon composed of 61 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 1937 place count 128 transition count 230
Deduced a syphon composed of 61 places in 0 ms
Applied a total of 1937 rules in 92 ms. Remains 128 /811 variables (removed 683) and now considering 230/1049 (removed 819) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:50:18] [INFO ] Redundant transitions in 2 ms returned []
Running 222 sub problems to find dead transitions.
[2025-06-08 12:50:18] [INFO ] Flow matrix only has 225 transitions (discarded 5 similar events)
// Phase 1: matrix 225 rows 128 cols
[2025-06-08 12:50:18] [INFO ] Computed 2 invariants in 1 ms
[2025-06-08 12:50:18] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:20] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:20] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:20] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:20] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:20] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:20] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:20] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 6 ms to minimize.
Problem TDEAD161 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:21] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:21] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:21] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 5 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 10/12 constraints. Problems are: Problem set: 10 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:21] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/13 constraints. Problems are: Problem set: 10 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:22] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/14 constraints. Problems are: Problem set: 10 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:23] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 1/15 constraints. Problems are: Problem set: 10 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/15 constraints. Problems are: Problem set: 10 solved, 212 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD228 is UNSAT
At refinement iteration 7 (OVERLAPS) 224/352 variables, 128/143 constraints. Problems are: Problem set: 92 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 40/183 constraints. Problems are: Problem set: 92 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/183 constraints. Problems are: Problem set: 92 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 1/353 variables, 1/184 constraints. Problems are: Problem set: 92 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/184 constraints. Problems are: Problem set: 92 solved, 130 unsolved
At refinement iteration 12 (OVERLAPS) 0/353 variables, 0/184 constraints. Problems are: Problem set: 92 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 184 constraints, problems are : Problem set: 92 solved, 130 unsolved in 25644 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 92 solved, 130 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 92 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 62/128 variables, 2/2 constraints. Problems are: Problem set: 92 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 13/15 constraints. Problems are: Problem set: 92 solved, 130 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:45] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:45] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 2/17 constraints. Problems are: Problem set: 92 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/17 constraints. Problems are: Problem set: 92 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 224/352 variables, 128/145 constraints. Problems are: Problem set: 92 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 40/185 constraints. Problems are: Problem set: 92 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 130/315 constraints. Problems are: Problem set: 92 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/315 constraints. Problems are: Problem set: 92 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 1/353 variables, 1/316 constraints. Problems are: Problem set: 92 solved, 130 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:51:00] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 1/317 constraints. Problems are: Problem set: 92 solved, 130 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:51:04] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 1/318 constraints. Problems are: Problem set: 92 solved, 130 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/318 constraints. Problems are: Problem set: 92 solved, 130 unsolved
At refinement iteration 13 (OVERLAPS) 0/353 variables, 0/318 constraints. Problems are: Problem set: 92 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 318 constraints, problems are : Problem set: 92 solved, 130 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 130/222 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55696ms problems are : Problem set: 92 solved, 130 unsolved
Search for dead transitions found 92 dead transitions in 55696ms
Found 92 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 92 transitions
Dead transitions reduction (with SMT) removed 92 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 128/811 places, 138/1049 transitions.
Graph (complete) has 300 edges and 128 vertex of which 67 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.1 ms
Discarding 61 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 146
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 8 ms. Remains 67 /128 variables (removed 61) and now considering 146/138 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/811 places, 146/1049 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55807 ms. Remains : 67/811 places, 146/1049 transitions.
Built C files in :
/tmp/ltsmin8551377566600440661
[2025-06-08 12:51:14] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8551377566600440661
Running compilation step : cd /tmp/ltsmin8551377566600440661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1743 ms.
Running link step : cd /tmp/ltsmin8551377566600440661;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8551377566600440661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14415099994973426785.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 811 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 811/811 places, 1049/1049 transitions.
Applied a total of 0 rules in 25 ms. Remains 811 /811 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
// Phase 1: matrix 1049 rows 811 cols
[2025-06-08 12:51:29] [INFO ] Computed 5 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:51:30] [INFO ] Implicit Places using invariants in 441 ms returned []
[2025-06-08 12:51:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:51:30] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1227 ms to find 0 implicit places.
Running 1048 sub problems to find dead transitions.
[2025-06-08 12:51:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
SMT process timed out in 30211ms, After SMT, problems are : Problem set: 0 solved, 1048 unsolved
Search for dead transitions found 0 dead transitions in 30213ms
Finished structural reductions in LTL mode , in 1 iterations and 31470 ms. Remains : 811/811 places, 1049/1049 transitions.
Built C files in :
/tmp/ltsmin5638929812010422198
[2025-06-08 12:52:01] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5638929812010422198
Running compilation step : cd /tmp/ltsmin5638929812010422198;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1712 ms.
Running link step : cd /tmp/ltsmin5638929812010422198;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5638929812010422198;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14256871305826199657.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-08 12:52:16] [INFO ] Flatten gal took : 40 ms
[2025-06-08 12:52:16] [INFO ] Flatten gal took : 37 ms
[2025-06-08 12:52:16] [INFO ] Time to serialize gal into /tmp/LTL12886730693248466323.gal : 9 ms
[2025-06-08 12:52:16] [INFO ] Time to serialize properties into /tmp/LTL2793814143745551684.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12886730693248466323.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15564148217080920790.hoa' '-atoms' '/tmp/LTL2793814143745551684.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2793814143745551684.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15564148217080920790.hoa
Detected timeout of ITS tools.
[2025-06-08 12:52:31] [INFO ] Flatten gal took : 34 ms
[2025-06-08 12:52:31] [INFO ] Flatten gal took : 32 ms
[2025-06-08 12:52:31] [INFO ] Time to serialize gal into /tmp/LTL310655127330745967.gal : 7 ms
[2025-06-08 12:52:31] [INFO ] Time to serialize properties into /tmp/LTL12491254315742307795.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL310655127330745967.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12491254315742307795.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(X(X("((p972==0)||(p106==1))"))))U(("((p1071==0)||(p451==1))")U(X(G("((p1089==0)||(p450==1))"))))))
Formula 0 simplified : XXX!"((p972==0)||(p106==1))" R (!"((p1071==0)||(p451==1))" R XF!"((p1089==0)||(p450==1))")
Detected timeout of ITS tools.
[2025-06-08 12:52:46] [INFO ] Flatten gal took : 39 ms
[2025-06-08 12:52:46] [INFO ] Applying decomposition
[2025-06-08 12:52:46] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6003228177564277235.txt' '-o' '/tmp/graph6003228177564277235.bin' '-w' '/tmp/graph6003228177564277235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6003228177564277235.bin' '-l' '-1' '-v' '-w' '/tmp/graph6003228177564277235.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:52:46] [INFO ] Decomposing Gal with order
[2025-06-08 12:52:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:52:47] [INFO ] Removed a total of 864 redundant transitions.
[2025-06-08 12:52:47] [INFO ] Flatten gal took : 108 ms
[2025-06-08 12:52:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 17 ms.
[2025-06-08 12:52:47] [INFO ] Time to serialize gal into /tmp/LTL1803419548376240116.gal : 14 ms
[2025-06-08 12:52:47] [INFO ] Time to serialize properties into /tmp/LTL13235025062683230412.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1803419548376240116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13235025062683230412.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(X(X("((i28.u267.p972==0)||(i4.i0.i1.u37.p106==1))"))))U(("((i32.u298.p1071==0)||(i10.i1.i1.u133.p451==1))")U(X(G("((i33.u301.p10...195
Formula 0 simplified : XXX!"((i28.u267.p972==0)||(i4.i0.i1.u37.p106==1))" R (!"((i32.u298.p1071==0)||(i10.i1.i1.u133.p451==1))" R XF!"((i33.u301.p1089==0)|...183
Reverse transition relation is NOT exact ! Due to transitions t35, t80, t184, t280, t447, t481, t586, t642, t675, t781, t857, t858, t864, t867, t871, t878,...615
Computing Next relation with stutter on 89262 deadlock states
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B02-LTLCardinality-11 finished in 239708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(p1))&&(p2 U (p3||G(p2))))))'
Support contains 4 out of 926 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 926/926 places, 1171/1171 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 912 transition count 1157
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 912 transition count 1157
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 41 place count 899 transition count 1144
Iterating global reduction 0 with 13 rules applied. Total rules applied 54 place count 899 transition count 1144
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 67 place count 886 transition count 1131
Iterating global reduction 0 with 13 rules applied. Total rules applied 80 place count 886 transition count 1131
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 91 place count 875 transition count 1120
Iterating global reduction 0 with 11 rules applied. Total rules applied 102 place count 875 transition count 1120
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 866 transition count 1111
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 866 transition count 1111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 121 place count 866 transition count 1110
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 128 place count 859 transition count 1103
Iterating global reduction 1 with 7 rules applied. Total rules applied 135 place count 859 transition count 1103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 136 place count 859 transition count 1102
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 142 place count 853 transition count 1096
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 853 transition count 1096
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 149 place count 853 transition count 1095
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 153 place count 849 transition count 1091
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 849 transition count 1091
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 161 place count 845 transition count 1087
Iterating global reduction 3 with 4 rules applied. Total rules applied 165 place count 845 transition count 1087
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 169 place count 841 transition count 1083
Iterating global reduction 3 with 4 rules applied. Total rules applied 173 place count 841 transition count 1083
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 176 place count 838 transition count 1080
Iterating global reduction 3 with 3 rules applied. Total rules applied 179 place count 838 transition count 1080
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 182 place count 835 transition count 1077
Iterating global reduction 3 with 3 rules applied. Total rules applied 185 place count 835 transition count 1077
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 188 place count 832 transition count 1074
Iterating global reduction 3 with 3 rules applied. Total rules applied 191 place count 832 transition count 1074
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 194 place count 829 transition count 1071
Iterating global reduction 3 with 3 rules applied. Total rules applied 197 place count 829 transition count 1071
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 198 place count 829 transition count 1070
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 200 place count 827 transition count 1068
Iterating global reduction 4 with 2 rules applied. Total rules applied 202 place count 827 transition count 1068
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 204 place count 825 transition count 1066
Iterating global reduction 4 with 2 rules applied. Total rules applied 206 place count 825 transition count 1066
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 208 place count 823 transition count 1064
Iterating global reduction 4 with 2 rules applied. Total rules applied 210 place count 823 transition count 1064
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 212 place count 821 transition count 1062
Iterating global reduction 4 with 2 rules applied. Total rules applied 214 place count 821 transition count 1062
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 216 place count 819 transition count 1060
Iterating global reduction 4 with 2 rules applied. Total rules applied 218 place count 819 transition count 1060
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 819 transition count 1059
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 220 place count 818 transition count 1058
Iterating global reduction 5 with 1 rules applied. Total rules applied 221 place count 818 transition count 1058
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 222 place count 817 transition count 1057
Iterating global reduction 5 with 1 rules applied. Total rules applied 223 place count 817 transition count 1057
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 224 place count 817 transition count 1056
Applied a total of 224 rules in 548 ms. Remains 817 /926 variables (removed 109) and now considering 1056/1171 (removed 115) transitions.
// Phase 1: matrix 1056 rows 817 cols
[2025-06-08 12:53:02] [INFO ] Computed 5 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:53:03] [INFO ] Implicit Places using invariants in 440 ms returned []
[2025-06-08 12:53:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:53:04] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
Running 1055 sub problems to find dead transitions.
[2025-06-08 12:53:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1055 unsolved
SMT process timed out in 30246ms, After SMT, problems are : Problem set: 0 solved, 1055 unsolved
Search for dead transitions found 0 dead transitions in 30249ms
Starting structural reductions in LTL mode, iteration 1 : 817/926 places, 1056/1171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32003 ms. Remains : 817/926 places, 1056/1171 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p3) (NOT p2)), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B02-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B02-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLCardinality-13 finished in 32315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(((F(p0) U (p1&&G(p2)))||X(p3)))))))'
Support contains 7 out of 926 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 926/926 places, 1171/1171 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 913 transition count 1158
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 913 transition count 1158
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 38 place count 901 transition count 1146
Iterating global reduction 0 with 12 rules applied. Total rules applied 50 place count 901 transition count 1146
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 62 place count 889 transition count 1134
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 889 transition count 1134
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 85 place count 878 transition count 1123
Iterating global reduction 0 with 11 rules applied. Total rules applied 96 place count 878 transition count 1123
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 105 place count 869 transition count 1114
Iterating global reduction 0 with 9 rules applied. Total rules applied 114 place count 869 transition count 1114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 115 place count 869 transition count 1113
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 122 place count 862 transition count 1106
Iterating global reduction 1 with 7 rules applied. Total rules applied 129 place count 862 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 130 place count 862 transition count 1105
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 136 place count 856 transition count 1099
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 856 transition count 1099
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 148 place count 850 transition count 1093
Iterating global reduction 2 with 6 rules applied. Total rules applied 154 place count 850 transition count 1093
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 159 place count 845 transition count 1088
Iterating global reduction 2 with 5 rules applied. Total rules applied 164 place count 845 transition count 1088
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 165 place count 845 transition count 1087
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 168 place count 842 transition count 1084
Iterating global reduction 3 with 3 rules applied. Total rules applied 171 place count 842 transition count 1084
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 174 place count 839 transition count 1081
Iterating global reduction 3 with 3 rules applied. Total rules applied 177 place count 839 transition count 1081
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 180 place count 836 transition count 1078
Iterating global reduction 3 with 3 rules applied. Total rules applied 183 place count 836 transition count 1078
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 186 place count 833 transition count 1075
Iterating global reduction 3 with 3 rules applied. Total rules applied 189 place count 833 transition count 1075
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 192 place count 830 transition count 1072
Iterating global reduction 3 with 3 rules applied. Total rules applied 195 place count 830 transition count 1072
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 196 place count 830 transition count 1071
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 198 place count 828 transition count 1069
Iterating global reduction 4 with 2 rules applied. Total rules applied 200 place count 828 transition count 1069
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 202 place count 826 transition count 1067
Iterating global reduction 4 with 2 rules applied. Total rules applied 204 place count 826 transition count 1067
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 206 place count 824 transition count 1065
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 824 transition count 1065
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 210 place count 822 transition count 1063
Iterating global reduction 4 with 2 rules applied. Total rules applied 212 place count 822 transition count 1063
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 214 place count 820 transition count 1061
Iterating global reduction 4 with 2 rules applied. Total rules applied 216 place count 820 transition count 1061
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 218 place count 818 transition count 1059
Iterating global reduction 4 with 2 rules applied. Total rules applied 220 place count 818 transition count 1059
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 222 place count 816 transition count 1057
Iterating global reduction 4 with 2 rules applied. Total rules applied 224 place count 816 transition count 1057
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 225 place count 816 transition count 1056
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 226 place count 815 transition count 1055
Iterating global reduction 5 with 1 rules applied. Total rules applied 227 place count 815 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 228 place count 815 transition count 1054
Applied a total of 228 rules in 544 ms. Remains 815 /926 variables (removed 111) and now considering 1054/1171 (removed 117) transitions.
// Phase 1: matrix 1054 rows 815 cols
[2025-06-08 12:53:35] [INFO ] Computed 5 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:53:35] [INFO ] Implicit Places using invariants in 415 ms returned []
[2025-06-08 12:53:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:53:36] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
Running 1053 sub problems to find dead transitions.
[2025-06-08 12:53:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/814 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1053 unsolved
SMT process timed out in 30214ms, After SMT, problems are : Problem set: 0 solved, 1053 unsolved
Search for dead transitions found 0 dead transitions in 30218ms
Starting structural reductions in LTL mode, iteration 1 : 815/926 places, 1054/1171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31993 ms. Remains : 815/926 places, 1054/1171 transitions.
Stuttering acceptance computed with spot in 517 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p1 (NOT p0) p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : MedleyB-PT-B02-LTLCardinality-15
Product exploration explored 100000 steps with 16693 reset in 173 ms.
Product exploration explored 100000 steps with 16670 reset in 190 ms.
Computed a total of 171 stabilizing places and 179 stable transitions
Computed a total of 171 stabilizing places and 179 stable transitions
Knowledge obtained : [(AND p1 p0 p2 p3)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 10 states, 21 edges and 4 AP (stutter sensitive) to 10 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 520 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) p1 p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (511 resets) in 199 ms. (200 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40003 steps (110 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (110 resets) in 38 ms. (1025 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (106 resets) in 40 ms. (975 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (107 resets) in 58 ms. (678 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (108 resets) in 41 ms. (952 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (105 resets) in 43 ms. (909 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (107 resets) in 36 ms. (1081 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (108 resets) in 41 ms. (952 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (109 resets) in 48 ms. (816 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (107 resets) in 37 ms. (1052 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (106 resets) in 41 ms. (952 steps per ms) remains 11/11 properties
[2025-06-08 12:54:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 794/801 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/801 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 14/815 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/815 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1054/1869 variables, 815/820 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1869 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/1869 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 820 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1760 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 815/815 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 794/801 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:10] [INFO ] Deduced a trap composed of 297 places in 416 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:11] [INFO ] Deduced a trap composed of 298 places in 387 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:11] [INFO ] Deduced a trap composed of 289 places in 338 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:11] [INFO ] Deduced a trap composed of 298 places in 204 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/801 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/801 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 14/815 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1054/1869 variables, 815/824 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1869 variables, 11/835 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:13] [INFO ] Deduced a trap composed of 307 places in 364 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:14] [INFO ] Deduced a trap composed of 307 places in 214 ms of which 20 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1869 variables, 2/837 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 837 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 815/815 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6791ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 815 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 815/815 places, 1054/1054 transitions.
Graph (trivial) has 801 edges and 815 vertex of which 64 / 815 are part of one of the 12 SCC in 4 ms
Free SCC test removed 52 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (complete) has 1215 edges and 763 vertex of which 759 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 564 transitions
Trivial Post-agglo rules discarded 564 transitions
Performed 564 trivial Post agglomeration. Transition count delta: 564
Iterating post reduction 0 with 568 rules applied. Total rules applied 570 place count 759 transition count 414
Reduce places removed 564 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 575 rules applied. Total rules applied 1145 place count 195 transition count 403
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 1151 place count 191 transition count 401
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1153 place count 189 transition count 401
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1153 place count 189 transition count 354
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1247 place count 142 transition count 354
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1248 place count 142 transition count 353
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 1304 place count 114 transition count 325
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1312 place count 114 transition count 317
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1336 place count 90 transition count 164
Iterating global reduction 6 with 24 rules applied. Total rules applied 1360 place count 90 transition count 164
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1372 place count 90 transition count 152
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1383 place count 79 transition count 141
Iterating global reduction 7 with 11 rules applied. Total rules applied 1394 place count 79 transition count 141
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1401 place count 72 transition count 134
Iterating global reduction 7 with 7 rules applied. Total rules applied 1408 place count 72 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1410 place count 72 transition count 132
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1418 place count 68 transition count 128
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1424 place count 65 transition count 146
Free-agglomeration rule applied 26 times.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1450 place count 65 transition count 120
Reduce places removed 26 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 43 rules applied. Total rules applied 1493 place count 39 transition count 103
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1497 place count 35 transition count 99
Iterating global reduction 9 with 4 rules applied. Total rules applied 1501 place count 35 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1502 place count 35 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 10 with 28 rules applied. Total rules applied 1530 place count 35 transition count 70
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 1536 place count 35 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1539 place count 35 transition count 67
Applied a total of 1539 rules in 30 ms. Remains 35 /815 variables (removed 780) and now considering 67/1054 (removed 987) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 35/815 places, 67/1054 transitions.
RANDOM walk for 11808 steps (1 resets) in 39 ms. (295 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p1 p0 p2 p3)]
False Knowledge obtained : [(F (NOT (OR p0 p2 p3))), (F (NOT (OR p2 p3))), (F (NOT (AND (OR p0 p1) (OR p0 p2)))), (F (NOT (AND (OR p0 p1 p3) (OR p0 p2 p3)))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT p3)), (F (NOT (AND p1 p2))), (F (NOT (AND p1 p2))), (F (NOT (AND (OR p1 p3) (OR p2 p3))))]
Knowledge based reduction with 1 factoid took 591 ms. Reduced automaton from 10 states, 21 edges and 4 AP (stutter sensitive) to 10 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 518 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) p1 p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 509 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) p1 p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Support contains 7 out of 815 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 815/815 places, 1054/1054 transitions.
Applied a total of 0 rules in 27 ms. Remains 815 /815 variables (removed 0) and now considering 1054/1054 (removed 0) transitions.
[2025-06-08 12:54:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:54:17] [INFO ] Implicit Places using invariants in 392 ms returned []
[2025-06-08 12:54:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:54:18] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
Running 1053 sub problems to find dead transitions.
[2025-06-08 12:54:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/814 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1053 unsolved
SMT process timed out in 30254ms, After SMT, problems are : Problem set: 0 solved, 1053 unsolved
Search for dead transitions found 0 dead transitions in 30259ms
Finished structural reductions in LTL mode , in 1 iterations and 31516 ms. Remains : 815/815 places, 1054/1054 transitions.
Computed a total of 171 stabilizing places and 179 stable transitions
Computed a total of 171 stabilizing places and 179 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 10 states, 21 edges and 4 AP (stutter sensitive) to 10 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 451 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) p1 p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (517 resets) in 226 ms. (176 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40004 steps (107 resets) in 55 ms. (714 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (106 resets) in 48 ms. (816 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (106 resets) in 60 ms. (655 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (106 resets) in 38 ms. (1025 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (105 resets) in 67 ms. (588 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (109 resets) in 52 ms. (754 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (110 resets) in 46 ms. (851 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (104 resets) in 66 ms. (597 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (106 resets) in 50 ms. (784 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (110 resets) in 37 ms. (1052 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (105 resets) in 79 ms. (500 steps per ms) remains 11/11 properties
[2025-06-08 12:54:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 794/801 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/801 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 14/815 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/815 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1054/1869 variables, 815/820 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1869 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/1869 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 820 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1751 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 815/815 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 794/801 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:51] [INFO ] Deduced a trap composed of 297 places in 420 ms of which 173 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:52] [INFO ] Deduced a trap composed of 298 places in 377 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:52] [INFO ] Deduced a trap composed of 289 places in 483 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:53] [INFO ] Deduced a trap composed of 298 places in 242 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/801 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/801 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 14/815 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1054/1869 variables, 815/824 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1869 variables, 11/835 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:55] [INFO ] Deduced a trap composed of 307 places in 356 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:55] [INFO ] Deduced a trap composed of 307 places in 246 ms of which 33 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1869 variables, 2/837 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 837 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 815/815 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6804ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 815 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 815/815 places, 1054/1054 transitions.
Graph (trivial) has 801 edges and 815 vertex of which 64 / 815 are part of one of the 12 SCC in 1 ms
Free SCC test removed 52 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (complete) has 1215 edges and 763 vertex of which 759 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 564 transitions
Trivial Post-agglo rules discarded 564 transitions
Performed 564 trivial Post agglomeration. Transition count delta: 564
Iterating post reduction 0 with 568 rules applied. Total rules applied 570 place count 759 transition count 414
Reduce places removed 564 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 575 rules applied. Total rules applied 1145 place count 195 transition count 403
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 1151 place count 191 transition count 401
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1153 place count 189 transition count 401
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1153 place count 189 transition count 354
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1247 place count 142 transition count 354
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1248 place count 142 transition count 353
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 1304 place count 114 transition count 325
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1312 place count 114 transition count 317
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1336 place count 90 transition count 164
Iterating global reduction 6 with 24 rules applied. Total rules applied 1360 place count 90 transition count 164
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1372 place count 90 transition count 152
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1383 place count 79 transition count 141
Iterating global reduction 7 with 11 rules applied. Total rules applied 1394 place count 79 transition count 141
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1401 place count 72 transition count 134
Iterating global reduction 7 with 7 rules applied. Total rules applied 1408 place count 72 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1410 place count 72 transition count 132
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1418 place count 68 transition count 128
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1424 place count 65 transition count 146
Free-agglomeration rule applied 26 times.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1450 place count 65 transition count 120
Reduce places removed 26 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 43 rules applied. Total rules applied 1493 place count 39 transition count 103
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1497 place count 35 transition count 99
Iterating global reduction 9 with 4 rules applied. Total rules applied 1501 place count 35 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1502 place count 35 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 10 with 28 rules applied. Total rules applied 1530 place count 35 transition count 70
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 1536 place count 35 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1539 place count 35 transition count 67
Applied a total of 1539 rules in 45 ms. Remains 35 /815 variables (removed 780) and now considering 67/1054 (removed 987) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 35/815 places, 67/1054 transitions.
RANDOM walk for 28351 steps (6 resets) in 107 ms. (262 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 p1 p2 p3)]
False Knowledge obtained : [(F (NOT (OR p0 p2 p3))), (F (NOT (OR p2 p3))), (F (NOT (AND (OR p0 p1) (OR p0 p2)))), (F (NOT (AND (OR p0 p1 p3) (OR p0 p2 p3)))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT p3)), (F (NOT (AND p1 p2))), (F (NOT (AND p1 p2))), (F (NOT (AND (OR p1 p3) (OR p2 p3))))]
Knowledge based reduction with 1 factoid took 454 ms. Reduced automaton from 10 states, 21 edges and 4 AP (stutter sensitive) to 10 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 447 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) p1 p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 452 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) p1 p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 420 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) p1 p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 16654 reset in 195 ms.
Product exploration explored 100000 steps with 16725 reset in 209 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 420 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) p1 p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Support contains 7 out of 815 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 815/815 places, 1054/1054 transitions.
Graph (trivial) has 801 edges and 815 vertex of which 64 / 815 are part of one of the 12 SCC in 0 ms
Free SCC test removed 52 places
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Performed 558 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 558 rules applied. Total rules applied 559 place count 763 transition count 994
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 566 place count 763 transition count 987
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 566 place count 763 transition count 991
Deduced a syphon composed of 592 places in 0 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 600 place count 763 transition count 991
Discarding 498 places :
Symmetric choice reduction at 2 with 498 rule applications. Total rules 1098 place count 265 transition count 493
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 2 with 498 rules applied. Total rules applied 1596 place count 265 transition count 493
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 2 with 44 rules applied. Total rules applied 1640 place count 265 transition count 508
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 1711 place count 194 transition count 304
Deduced a syphon composed of 94 places in 1 ms
Iterating global reduction 2 with 71 rules applied. Total rules applied 1782 place count 194 transition count 304
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1797 place count 194 transition count 289
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1827 place count 164 transition count 255
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 3 with 30 rules applied. Total rules applied 1857 place count 164 transition count 255
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1868 place count 153 transition count 244
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 3 with 11 rules applied. Total rules applied 1879 place count 153 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1881 place count 153 transition count 242
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1888 place count 146 transition count 235
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1895 place count 146 transition count 235
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1902 place count 146 transition count 275
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1913 place count 135 transition count 252
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 1924 place count 135 transition count 252
Deduced a syphon composed of 64 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 1932 place count 135 transition count 244
Deduced a syphon composed of 64 places in 0 ms
Applied a total of 1932 rules in 61 ms. Remains 135 /815 variables (removed 680) and now considering 244/1054 (removed 810) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:54:59] [INFO ] Redundant transitions in 2 ms returned []
Running 232 sub problems to find dead transitions.
[2025-06-08 12:54:59] [INFO ] Flow matrix only has 239 transitions (discarded 5 similar events)
// Phase 1: matrix 239 rows 135 cols
[2025-06-08 12:54:59] [INFO ] Computed 2 invariants in 1 ms
[2025-06-08 12:54:59] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:00] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 4 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:01] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:01] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:01] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:01] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:01] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:01] [INFO ] Deduced a trap composed of 16 places in 238 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:02] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 3 ms to minimize.
Problem TDEAD168 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:02] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:02] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:02] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:02] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:02] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 13/15 constraints. Problems are: Problem set: 14 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:03] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/16 constraints. Problems are: Problem set: 14 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:04] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:04] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:04] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 3/19 constraints. Problems are: Problem set: 14 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/19 constraints. Problems are: Problem set: 14 solved, 218 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
At refinement iteration 6 (OVERLAPS) 238/373 variables, 135/154 constraints. Problems are: Problem set: 97 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 42/196 constraints. Problems are: Problem set: 97 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:07] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:07] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 2/198 constraints. Problems are: Problem set: 97 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/198 constraints. Problems are: Problem set: 97 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 1/374 variables, 1/199 constraints. Problems are: Problem set: 97 solved, 135 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/199 constraints. Problems are: Problem set: 97 solved, 135 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/374 variables, and 199 constraints, problems are : Problem set: 97 solved, 135 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 135/135 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 97 solved, 135 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 97 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 65/135 variables, 2/2 constraints. Problems are: Problem set: 97 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 19/21 constraints. Problems are: Problem set: 97 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:29] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/22 constraints. Problems are: Problem set: 97 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/22 constraints. Problems are: Problem set: 97 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 238/373 variables, 135/157 constraints. Problems are: Problem set: 97 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 42/199 constraints. Problems are: Problem set: 97 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 135/334 constraints. Problems are: Problem set: 97 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:37] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 1/335 constraints. Problems are: Problem set: 97 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/335 constraints. Problems are: Problem set: 97 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 1/374 variables, 1/336 constraints. Problems are: Problem set: 97 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:55:50] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/337 constraints. Problems are: Problem set: 97 solved, 135 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/337 constraints. Problems are: Problem set: 97 solved, 135 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 337 constraints, problems are : Problem set: 97 solved, 135 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 135/135 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 135/232 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 97 solved, 135 unsolved
Search for dead transitions found 97 dead transitions in 60089ms
Found 97 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 97 transitions
Dead transitions reduction (with SMT) removed 97 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 135/815 places, 147/1054 transitions.
Graph (complete) has 308 edges and 135 vertex of which 71 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.1 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 71 /135 variables (removed 64) and now considering 147/147 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/815 places, 147/1054 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60187 ms. Remains : 71/815 places, 147/1054 transitions.
Built C files in :
/tmp/ltsmin6383782961319260537
[2025-06-08 12:55:59] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6383782961319260537
Running compilation step : cd /tmp/ltsmin6383782961319260537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1764 ms.
Running link step : cd /tmp/ltsmin6383782961319260537;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6383782961319260537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2756761234767015140.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 815 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 815/815 places, 1054/1054 transitions.
Applied a total of 0 rules in 41 ms. Remains 815 /815 variables (removed 0) and now considering 1054/1054 (removed 0) transitions.
// Phase 1: matrix 1054 rows 815 cols
[2025-06-08 12:56:14] [INFO ] Computed 5 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:56:14] [INFO ] Implicit Places using invariants in 432 ms returned []
[2025-06-08 12:56:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:56:15] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
Running 1053 sub problems to find dead transitions.
[2025-06-08 12:56:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/814 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1053 unsolved
SMT process timed out in 30213ms, After SMT, problems are : Problem set: 0 solved, 1053 unsolved
Search for dead transitions found 0 dead transitions in 30219ms
Finished structural reductions in LTL mode , in 1 iterations and 31512 ms. Remains : 815/815 places, 1054/1054 transitions.
Built C files in :
/tmp/ltsmin15840421788569441566
[2025-06-08 12:56:45] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15840421788569441566
Running compilation step : cd /tmp/ltsmin15840421788569441566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1870 ms.
Running link step : cd /tmp/ltsmin15840421788569441566;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin15840421788569441566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15231446856177841438.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-08 12:57:01] [INFO ] Flatten gal took : 30 ms
[2025-06-08 12:57:01] [INFO ] Flatten gal took : 38 ms
[2025-06-08 12:57:01] [INFO ] Time to serialize gal into /tmp/LTL1206329824822056024.gal : 6 ms
[2025-06-08 12:57:01] [INFO ] Time to serialize properties into /tmp/LTL10234622353772158599.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1206329824822056024.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13419422629211481814.hoa' '-atoms' '/tmp/LTL10234622353772158599.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10234622353772158599.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13419422629211481814.hoa
Detected timeout of ITS tools.
[2025-06-08 12:57:16] [INFO ] Flatten gal took : 22 ms
[2025-06-08 12:57:16] [INFO ] Flatten gal took : 23 ms
[2025-06-08 12:57:16] [INFO ] Time to serialize gal into /tmp/LTL9835347728225052276.gal : 6 ms
[2025-06-08 12:57:16] [INFO ] Time to serialize properties into /tmp/LTL12231964492499663964.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9835347728225052276.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12231964492499663964.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G(((F("((p197==0)||(p844==1))"))U(("((p1197==0)||(p768==1))")&&(G("((p643==0)||(p877==1))"))))||(X("(p481==0)"))))))))
Formula 0 simplified : XXXF((G!"((p197==0)||(p844==1))" R (!"((p1197==0)||(p768==1))" | F!"((p643==0)||(p877==1))")) & X!"(p481==0)")
Detected timeout of ITS tools.
[2025-06-08 12:57:31] [INFO ] Flatten gal took : 22 ms
[2025-06-08 12:57:31] [INFO ] Applying decomposition
[2025-06-08 12:57:31] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11480168477033473158.txt' '-o' '/tmp/graph11480168477033473158.bin' '-w' '/tmp/graph11480168477033473158.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11480168477033473158.bin' '-l' '-1' '-v' '-w' '/tmp/graph11480168477033473158.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:57:31] [INFO ] Decomposing Gal with order
[2025-06-08 12:57:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:57:31] [INFO ] Removed a total of 862 redundant transitions.
[2025-06-08 12:57:31] [INFO ] Flatten gal took : 44 ms
[2025-06-08 12:57:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 14 ms.
[2025-06-08 12:57:31] [INFO ] Time to serialize gal into /tmp/LTL14218624327586169374.gal : 7 ms
[2025-06-08 12:57:31] [INFO ] Time to serialize properties into /tmp/LTL1876882203013970179.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14218624327586169374.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1876882203013970179.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G(((F("((i9.i1.i2.u62.p197==0)||(i23.i1.i1.u230.p844==1))"))U(("((i35.u332.p1197==0)||(i24.u218.p768==1))")&&(G("((i19.u178.p...227
Formula 0 simplified : XXXF((G!"((i9.i1.i2.u62.p197==0)||(i23.i1.i1.u230.p844==1))" R (!"((i35.u332.p1197==0)||(i24.u218.p768==1))" | F!"((i19.u178.p643==0...212
Reverse transition relation is NOT exact ! Due to transitions t80, t240, t280, t391, t447, t481, t586, t675, t837, t857, t858, t864, t867, t870, t871, t874...595
Computing Next relation with stutter on 89746 deadlock states
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B02-LTLCardinality-15 finished in 251978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0))) U (p1 U X(G(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(((F(p0) U (p1&&G(p2)))||X(p3)))))))'
Found a Lengthening insensitive property : MedleyB-PT-B02-LTLCardinality-15
Stuttering acceptance computed with spot in 524 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p1 (NOT p0) p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Support contains 7 out of 926 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 926/926 places, 1171/1171 transitions.
Graph (trivial) has 908 edges and 926 vertex of which 65 / 926 are part of one of the 12 SCC in 1 ms
Free SCC test removed 53 places
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 640 transitions
Trivial Post-agglo rules discarded 640 transitions
Performed 640 trivial Post agglomeration. Transition count delta: 640
Iterating post reduction 0 with 640 rules applied. Total rules applied 641 place count 872 transition count 469
Reduce places removed 640 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 649 rules applied. Total rules applied 1290 place count 232 transition count 460
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 1297 place count 228 transition count 457
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1300 place count 225 transition count 457
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1300 place count 225 transition count 407
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1400 place count 175 transition count 407
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1409 place count 166 transition count 398
Iterating global reduction 4 with 9 rules applied. Total rules applied 1418 place count 166 transition count 398
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1421 place count 163 transition count 395
Iterating global reduction 4 with 3 rules applied. Total rules applied 1424 place count 163 transition count 395
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1426 place count 161 transition count 393
Iterating global reduction 4 with 2 rules applied. Total rules applied 1428 place count 161 transition count 393
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1430 place count 159 transition count 391
Iterating global reduction 4 with 2 rules applied. Total rules applied 1432 place count 159 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1433 place count 159 transition count 390
Performed 32 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 1497 place count 127 transition count 353
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 1521 place count 103 transition count 203
Iterating global reduction 5 with 24 rules applied. Total rules applied 1545 place count 103 transition count 203
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1556 place count 103 transition count 192
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1568 place count 91 transition count 176
Iterating global reduction 6 with 12 rules applied. Total rules applied 1580 place count 91 transition count 176
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1592 place count 79 transition count 160
Iterating global reduction 6 with 12 rules applied. Total rules applied 1604 place count 79 transition count 160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1608 place count 79 transition count 156
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 1622 place count 72 transition count 160
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1623 place count 71 transition count 152
Iterating global reduction 7 with 1 rules applied. Total rules applied 1624 place count 71 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1625 place count 71 transition count 151
Applied a total of 1625 rules in 44 ms. Remains 71 /926 variables (removed 855) and now considering 151/1171 (removed 1020) transitions.
[2025-06-08 12:57:47] [INFO ] Flow matrix only has 146 transitions (discarded 5 similar events)
// Phase 1: matrix 146 rows 71 cols
[2025-06-08 12:57:47] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:57:47] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-08 12:57:47] [INFO ] Flow matrix only has 146 transitions (discarded 5 similar events)
[2025-06-08 12:57:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:57:47] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-08 12:57:47] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2025-06-08 12:57:47] [INFO ] Flow matrix only has 146 transitions (discarded 5 similar events)
[2025-06-08 12:57:47] [INFO ] Invariant cache hit.
[2025-06-08 12:57:47] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:48] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:48] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:48] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:48] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:48] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:48] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:48] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:48] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:48] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:48] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:48] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:49] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:49] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:49] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:49] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:49] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 145/216 variables, 71/89 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 14/103 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 1/217 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (OVERLAPS) 0/217 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 104 constraints, problems are : Problem set: 0 solved, 138 unsolved in 8879 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 145/216 variables, 71/89 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 14/103 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 138/241 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 1/217 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:04] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:05] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:05] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:05] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 4/246 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (OVERLAPS) 0/217 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 246 constraints, problems are : Problem set: 0 solved, 138 unsolved in 28370 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37278ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 37278ms
Starting structural reductions in LI_LTL mode, iteration 1 : 71/926 places, 151/1171 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 37487 ms. Remains : 71/926 places, 151/1171 transitions.
Running random walk in product with property : MedleyB-PT-B02-LTLCardinality-15
Product exploration explored 100000 steps with 17493 reset in 155 ms.
Product exploration explored 100000 steps with 17474 reset in 193 ms.
Computed a total of 9 stabilizing places and 22 stable transitions
Computed a total of 9 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p1 p0 p2 p3)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 142 ms. Reduced automaton from 10 states, 21 edges and 4 AP (stutter sensitive) to 10 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 536 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) p1 p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (4735 resets) in 159 ms. (250 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40004 steps (630 resets) in 41 ms. (952 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (626 resets) in 31 ms. (1250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (618 resets) in 35 ms. (1111 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (621 resets) in 28 ms. (1379 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (625 resets) in 32 ms. (1212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (629 resets) in 27 ms. (1428 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (619 resets) in 31 ms. (1250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (604 resets) in 31 ms. (1250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (627 resets) in 31 ms. (1250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (619 resets) in 27 ms. (1428 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (647 resets) in 51 ms. (769 steps per ms) remains 11/11 properties
[2025-06-08 12:58:26] [INFO ] Flow matrix only has 146 transitions (discarded 5 similar events)
[2025-06-08 12:58:26] [INFO ] Invariant cache hit.
[2025-06-08 12:58:26] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 144/213 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 14/84 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 3/216 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/217 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/217 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 88 constraints, problems are : Problem set: 0 solved, 11 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:26] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:26] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:26] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:26] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:26] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:26] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 144/213 variables, 69/76 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 3/216 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 11/104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 1/217 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/217 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 105 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1168 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1567ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 4 different solutions.
Finished Parikh walk after 26 steps, including 1 resets, run visited all 6 properties in 6 ms. (steps per millisecond=4 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 11 properties in 84 ms.
Knowledge obtained : [(AND p1 p0 p2 p3)]
False Knowledge obtained : [(F (NOT (OR p0 p2 p3))), (F (NOT (OR p2 p3))), (F (NOT (AND (OR p0 p1) (OR p0 p2)))), (F (NOT (AND (OR p0 p1 p3) (OR p0 p2 p3)))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT p3)), (F (NOT (AND p1 p2))), (F (NOT (AND p1 p2))), (F (NOT (AND (OR p1 p3) (OR p2 p3))))]
Knowledge based reduction with 1 factoid took 613 ms. Reduced automaton from 10 states, 21 edges and 4 AP (stutter sensitive) to 10 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 502 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) p1 p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 526 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) p1 p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Support contains 7 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 151/151 transitions.
Applied a total of 0 rules in 0 ms. Remains 71 /71 variables (removed 0) and now considering 151/151 (removed 0) transitions.
[2025-06-08 12:58:29] [INFO ] Flow matrix only has 146 transitions (discarded 5 similar events)
[2025-06-08 12:58:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:58:29] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-08 12:58:29] [INFO ] Flow matrix only has 146 transitions (discarded 5 similar events)
[2025-06-08 12:58:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:58:29] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-08 12:58:29] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2025-06-08 12:58:29] [INFO ] Flow matrix only has 146 transitions (discarded 5 similar events)
[2025-06-08 12:58:29] [INFO ] Invariant cache hit.
[2025-06-08 12:58:29] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:30] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:30] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:30] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:30] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:30] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:30] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:30] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:30] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:30] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:30] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:30] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:30] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:31] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:31] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:31] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:31] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 145/216 variables, 71/89 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 14/103 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 1/217 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (OVERLAPS) 0/217 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 104 constraints, problems are : Problem set: 0 solved, 138 unsolved in 8905 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 145/216 variables, 71/89 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 14/103 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 138/241 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 1/217 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:46] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:47] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:47] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:47] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 4/246 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (OVERLAPS) 0/217 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 246 constraints, problems are : Problem set: 0 solved, 138 unsolved in 27812 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36741ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 36742ms
Finished structural reductions in LTL mode , in 1 iterations and 36895 ms. Remains : 71/71 places, 151/151 transitions.
Computed a total of 9 stabilizing places and 22 stable transitions
Computed a total of 9 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 10 states, 21 edges and 4 AP (stutter sensitive) to 10 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 499 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) p1 p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (4753 resets) in 220 ms. (180 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40004 steps (627 resets) in 24 ms. (1600 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (610 resets) in 26 ms. (1481 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (612 resets) in 33 ms. (1176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (618 resets) in 27 ms. (1428 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (642 resets) in 30 ms. (1290 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (608 resets) in 28 ms. (1379 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (625 resets) in 29 ms. (1333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (626 resets) in 32 ms. (1212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (620 resets) in 31 ms. (1250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (624 resets) in 47 ms. (833 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (635 resets) in 36 ms. (1081 steps per ms) remains 11/11 properties
[2025-06-08 12:59:07] [INFO ] Flow matrix only has 146 transitions (discarded 5 similar events)
[2025-06-08 12:59:07] [INFO ] Invariant cache hit.
[2025-06-08 12:59:07] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 144/213 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 14/84 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 3/216 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/217 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/217 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 88 constraints, problems are : Problem set: 0 solved, 11 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:07] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:07] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:07] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:07] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:07] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:07] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 144/213 variables, 69/76 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 3/216 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 11/104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 1/217 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/217 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 105 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1137 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1513ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 4 different solutions.
Finished Parikh walk after 27 steps, including 1 resets, run visited all 4 properties in 1 ms. (steps per millisecond=27 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 11 properties in 80 ms.
Knowledge obtained : [(AND p0 p1 p2 p3)]
False Knowledge obtained : [(F (NOT (OR p0 p2 p3))), (F (NOT (OR p2 p3))), (F (NOT (AND (OR p0 p1) (OR p0 p2)))), (F (NOT (AND (OR p0 p1 p3) (OR p0 p2 p3)))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT p3)), (F (NOT (AND p1 p2))), (F (NOT (AND p1 p2))), (F (NOT (AND (OR p1 p3) (OR p2 p3))))]
Knowledge based reduction with 1 factoid took 585 ms. Reduced automaton from 10 states, 21 edges and 4 AP (stutter sensitive) to 10 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 488 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) p1 p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 513 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) p1 p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 504 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) p1 p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 17423 reset in 137 ms.
Product exploration explored 100000 steps with 17436 reset in 159 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 467 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) p1 p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Support contains 7 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 151/151 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 71 transition count 147
Applied a total of 4 rules in 8 ms. Remains 71 /71 variables (removed 0) and now considering 147/151 (removed 4) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:59:11] [INFO ] Redundant transitions in 1 ms returned []
Running 134 sub problems to find dead transitions.
[2025-06-08 12:59:11] [INFO ] Flow matrix only has 142 transitions (discarded 5 similar events)
// Phase 1: matrix 142 rows 71 cols
[2025-06-08 12:59:11] [INFO ] Computed 2 invariants in 2 ms
[2025-06-08 12:59:11] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:12] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:12] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:12] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:12] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:12] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:12] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:12] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:12] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:12] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:12] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:12] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:13] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:13] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:13] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:13] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:13] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:13] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:13] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:14] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 141/212 variables, 71/92 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:59:15] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 1/213 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (OVERLAPS) 0/213 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 108 constraints, problems are : Problem set: 0 solved, 134 unsolved in 11217 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 141/212 variables, 71/93 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 134/241 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (OVERLAPS) 1/213 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (OVERLAPS) 0/213 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 242 constraints, problems are : Problem set: 0 solved, 134 unsolved in 23534 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34778ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 34778ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/71 places, 147/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34794 ms. Remains : 71/71 places, 147/151 transitions.
Built C files in :
/tmp/ltsmin2179857211844801561
[2025-06-08 12:59:46] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2179857211844801561
Running compilation step : cd /tmp/ltsmin2179857211844801561;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 266 ms.
Running link step : cd /tmp/ltsmin2179857211844801561;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2179857211844801561;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10113880039676124109.hoa' '--buchi-type=spotba'
LTSmin run took 226 ms.
Treatment of property MedleyB-PT-B02-LTLCardinality-15 finished in 120360 ms.
FORMULA MedleyB-PT-B02-LTLCardinality-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2025-06-08 12:59:47] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15745126730926746397
[2025-06-08 12:59:47] [INFO ] Computing symmetric may disable matrix : 1171 transitions.
[2025-06-08 12:59:47] [INFO ] Applying decomposition
[2025-06-08 12:59:47] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 12:59:47] [INFO ] Computing symmetric may enable matrix : 1171 transitions.
[2025-06-08 12:59:47] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 12:59:47] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph165953667354249425.txt' '-o' '/tmp/graph165953667354249425.bin' '-w' '/tmp/graph165953667354249425.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph165953667354249425.bin' '-l' '-1' '-v' '-w' '/tmp/graph165953667354249425.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:59:47] [INFO ] Decomposing Gal with order
[2025-06-08 12:59:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:59:47] [INFO ] Removed a total of 888 redundant transitions.
[2025-06-08 12:59:47] [INFO ] Flatten gal took : 54 ms
[2025-06-08 12:59:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2025-06-08 12:59:47] [INFO ] Computing Do-Not-Accords matrix : 1171 transitions.
[2025-06-08 12:59:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality12136568990018069234.gal : 10 ms
[2025-06-08 12:59:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality8805557572166398918.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12136568990018069234.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8805557572166398918.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
[2025-06-08 12:59:47] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 12:59:47] [INFO ] Built C files in 293ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15745126730926746397
Running compilation step : cd /tmp/ltsmin15745126730926746397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !(((X(X(X("((i32.i1.i1.u307.p972==0)||(i3.u39.p106==1))"))))U(("((i35.u337.p1071==0)||(i14.i1.i1.u144.p451==1))")U(X(G("((i36.u341.p10...195
Formula 0 simplified : XXX!"((i32.i1.i1.u307.p972==0)||(i3.u39.p106==1))" R (!"((i35.u337.p1071==0)||(i14.i1.i1.u144.p451==1))" R XF!"((i36.u341.p1089==0)|...183
Compilation finished in 3779 ms.
Running link step : cd /tmp/ltsmin15745126730926746397;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin15745126730926746397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(X((LTLAPp0==true)))) U ((LTLAPp1==true) U X([]((LTLAPp2==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t16, t35, t80, t184, t237, t240, t280, t304, t328, t391, t447, t481, t523, t642, t675, t780, ...672
Computing Next relation with stutter on 134314 deadlock states
237 unique states visited
234 strongly connected components in search stack
472 transitions explored
234 items max in DFS search stack
9545 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,95.5522,2232236,1,0,3.0144e+06,1014,12250,1.78993e+07,241,4092,5961090
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyB-PT-B02-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1204817 ms.

BK_STOP 1749387845884

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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